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/llreve-bench/smt2/loop__barthe.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:43:57,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:43:57,873 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:43:57,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:43:57,887 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:43:57,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:43:57,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:43:57,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:43:57,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:43:57,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:43:57,901 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:43:57,901 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:43:57,903 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:43:57,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:43:57,905 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:43:57,905 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:43:57,906 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:43:57,909 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:43:57,911 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:43:57,920 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:43:57,921 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:43:57,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:43:57,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:43:57,923 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:43:57,924 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:43:57,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:43:57,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:43:57,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:43:57,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:43:57,933 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:43:57,933 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:43:57,934 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:43:57,934 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:43:57,934 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:43:57,935 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:43:57,935 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:43:57,936 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:43:57,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:43:57,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:43:57,953 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:43:57,953 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:43:57,954 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:43:57,954 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:43:57,954 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:43:57,955 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:43:57,955 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:43:57,955 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:43:57,955 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:43:57,955 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:43:57,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:43:57,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:43:57,956 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:43:57,956 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:43:57,956 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:43:57,957 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:43:57,957 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:43:57,957 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:43:57,957 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:43:57,958 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:43:57,959 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:43:57,998 INFO ]: Repository-Root is: /tmp [2018-06-26 18:43:58,013 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:43:58,017 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:43:58,018 INFO ]: Initializing SmtParser... [2018-06-26 18:43:58,018 INFO ]: SmtParser initialized [2018-06-26 18:43:58,019 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 [2018-06-26 18:43:58,020 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 18:43:58,108 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@370a3d57 [2018-06-26 18:43:58,296 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 [2018-06-26 18:43:58,301 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:43:58,306 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:43:58,307 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:43:58,307 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:43:58,307 INFO ]: ChcToBoogie initialized [2018-06-26 18:43:58,311 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:43:58" (1/1) ... [2018-06-26 18:43:58,362 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:43:58 Unit [2018-06-26 18:43:58,362 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:43:58,363 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:43:58,363 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:43:58,363 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:43:58,383 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:43:58" (1/1) ... [2018-06-26 18:43:58,383 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:43:58" (1/1) ... [2018-06-26 18:43:58,388 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:43:58" (1/1) ... [2018-06-26 18:43:58,388 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:43:58" (1/1) ... [2018-06-26 18:43:58,391 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:43:58" (1/1) ... [2018-06-26 18:43:58,393 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:43:58" (1/1) ... [2018-06-26 18:43:58,394 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:43:58" (1/1) ... [2018-06-26 18:43:58,395 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:43:58,397 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:43:58,397 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:43:58,397 INFO ]: RCFGBuilder initialized [2018-06-26 18:43:58,398 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:43:58" (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 18:43:58,413 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:43:58,413 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:43:58,413 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:43:58,413 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:43:58,413 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:43:58,413 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 18:43:58,661 INFO ]: Using library mode [2018-06-26 18:43:58,662 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:43:58 BoogieIcfgContainer [2018-06-26 18:43:58,662 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:43:58,662 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:43:58,662 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:43:58,663 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:43:58,664 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:43:58" (1/1) ... [2018-06-26 18:43:58,680 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-26 18:43:58,682 INFO ]: Using Remove infeasible edges [2018-06-26 18:43:58,683 INFO ]: Using Maximize final states [2018-06-26 18:43:58,683 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:43:58,683 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:43:58,688 INFO ]: Using Remove sink states [2018-06-26 18:43:58,688 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:43:58,689 INFO ]: Using Use SBE [2018-06-26 18:43:58,699 INFO ]: SBE split 0 edges [2018-06-26 18:43:58,704 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 18:43:58,705 INFO ]: 0 new accepting states [2018-06-26 18:43:58,755 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 18:43:58,756 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:43:58,760 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:43:58,760 INFO ]: 0 new accepting states [2018-06-26 18:43:58,760 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:43:58,761 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:43:58,761 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-26 18:43:58,761 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:43:58 BasicIcfg [2018-06-26 18:43:58,761 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:43:58,762 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:43:58,762 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:43:58,765 INFO ]: TraceAbstraction initialized [2018-06-26 18:43:58,765 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:43:58" (1/4) ... [2018-06-26 18:43:58,766 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572afe5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:43:58, skipping insertion in model container [2018-06-26 18:43:58,766 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:43:58" (2/4) ... [2018-06-26 18:43:58,766 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572afe5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:43:58, skipping insertion in model container [2018-06-26 18:43:58,767 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:43:58" (3/4) ... [2018-06-26 18:43:58,768 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572afe5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:43:58, skipping insertion in model container [2018-06-26 18:43:58,768 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:43:58" (4/4) ... [2018-06-26 18:43:58,769 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:43:58,780 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:43:58,786 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:43:58,825 INFO ]: Using default assertion order modulation [2018-06-26 18:43:58,825 INFO ]: Interprodecural is true [2018-06-26 18:43:58,826 INFO ]: Hoare is false [2018-06-26 18:43:58,826 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:43:58,826 INFO ]: Backedges is TWOTRACK [2018-06-26 18:43:58,826 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:43:58,826 INFO ]: Difference is false [2018-06-26 18:43:58,826 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:43:58,826 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:43:58,834 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 18:43:58,843 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:43:58,843 INFO ]: Found error trace [2018-06-26 18:43:58,844 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:43:58,844 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:58,849 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-26 18:43:58,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:58,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:58,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:58,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:58,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:58,935 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:58,986 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:58,987 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:43:58,988 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:43:58,989 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:43:58,999 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:43:58,999 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:43:59,001 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 18:43:59,070 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:59,070 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-26 18:43:59,070 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:43:59,071 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:43:59,071 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:59,078 INFO ]: With dead ends: 7 [2018-06-26 18:43:59,078 INFO ]: Without dead ends: 7 [2018-06-26 18:43:59,080 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:43:59,093 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 18:43:59,104 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 18:43:59,105 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:43:59,105 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-26 18:43:59,106 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-26 18:43:59,106 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:59,106 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-26 18:43:59,106 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:43:59,106 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-26 18:43:59,106 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:43:59,106 INFO ]: Found error trace [2018-06-26 18:43:59,106 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:43:59,106 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:59,107 INFO ]: Analyzing trace with hash 1156261132, now seen corresponding path program 1 times [2018-06-26 18:43:59,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:59,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:59,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:59,107 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:59,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:59,124 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:59,197 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:59,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:59,197 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 18:43:59,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:59,241 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:59,247 INFO ]: Computing forward predicates... [2018-06-26 18:43:59,285 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:59,306 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:43:59,306 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-06-26 18:43:59,307 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:43:59,307 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:43:59,307 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:43:59,307 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2018-06-26 18:43:59,472 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:59,473 INFO ]: Finished difference Result 9 states and 16 transitions. [2018-06-26 18:43:59,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:43:59,473 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 18:43:59,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:59,473 INFO ]: With dead ends: 9 [2018-06-26 18:43:59,473 INFO ]: Without dead ends: 7 [2018-06-26 18:43:59,474 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 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 18:43:59,474 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 18:43:59,475 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 18:43:59,475 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:43:59,475 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-06-26 18:43:59,475 INFO ]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 6 [2018-06-26 18:43:59,476 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:59,476 INFO ]: Abstraction has 7 states and 9 transitions. [2018-06-26 18:43:59,476 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:43:59,476 INFO ]: Start isEmpty. Operand 7 states and 9 transitions. [2018-06-26 18:43:59,476 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:43:59,476 INFO ]: Found error trace [2018-06-26 18:43:59,476 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:43:59,476 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:59,476 INFO ]: Analyzing trace with hash 1156290923, now seen corresponding path program 1 times [2018-06-26 18:43:59,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:59,476 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:59,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:59,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:59,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:59,491 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:59,600 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:59,601 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:43:59,601 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:43:59,601 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:43:59,601 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:43:59,601 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:43:59,601 INFO ]: Start difference. First operand 7 states and 9 transitions. Second operand 3 states. [2018-06-26 18:43:59,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:59,686 INFO ]: Finished difference Result 8 states and 11 transitions. [2018-06-26 18:43:59,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:43:59,687 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:43:59,687 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:59,687 INFO ]: With dead ends: 8 [2018-06-26 18:43:59,687 INFO ]: Without dead ends: 7 [2018-06-26 18:43:59,687 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:43:59,687 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 18:43:59,688 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 18:43:59,688 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:43:59,689 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-06-26 18:43:59,689 INFO ]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 6 [2018-06-26 18:43:59,689 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:59,689 INFO ]: Abstraction has 7 states and 7 transitions. [2018-06-26 18:43:59,689 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:43:59,689 INFO ]: Start isEmpty. Operand 7 states and 7 transitions. [2018-06-26 18:43:59,689 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:43:59,689 INFO ]: Found error trace [2018-06-26 18:43:59,689 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:43:59,689 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:59,689 INFO ]: Analyzing trace with hash 1156350505, now seen corresponding path program 1 times [2018-06-26 18:43:59,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:59,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:59,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:59,690 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:59,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:59,731 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:59,807 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:59,807 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:59,807 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 18:43:59,815 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:59,851 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:59,853 INFO ]: Computing forward predicates... [2018-06-26 18:43:59,954 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:59,986 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:59,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 18:43:59,987 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:43:59,987 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:43:59,987 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:43:59,987 INFO ]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-06-26 18:44:00,025 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:00,025 INFO ]: Finished difference Result 8 states and 8 transitions. [2018-06-26 18:44:00,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:44:00,026 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 18:44:00,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:00,026 INFO ]: With dead ends: 8 [2018-06-26 18:44:00,026 INFO ]: Without dead ends: 8 [2018-06-26 18:44:00,026 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:44:00,026 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 18:44:00,027 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 18:44:00,028 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 18:44:00,028 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-26 18:44:00,028 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-06-26 18:44:00,028 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:00,028 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-26 18:44:00,028 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:44:00,028 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-26 18:44:00,028 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:44:00,028 INFO ]: Found error trace [2018-06-26 18:44:00,028 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 18:44:00,028 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:00,029 INFO ]: Analyzing trace with hash 1486831460, now seen corresponding path program 2 times [2018-06-26 18:44:00,029 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:00,029 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:00,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:00,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:00,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:00,054 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:00,240 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:00,240 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:00,240 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 18:44:00,255 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:44:00,307 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:44:00,307 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:00,310 INFO ]: Computing forward predicates... [2018-06-26 18:44:00,380 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:00,399 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:00,399 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-26 18:44:00,400 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:44:00,400 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:44:00,400 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:44:00,400 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-06-26 18:44:00,468 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:00,468 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-26 18:44:00,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:44:00,469 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-26 18:44:00,469 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:00,469 INFO ]: With dead ends: 9 [2018-06-26 18:44:00,469 INFO ]: Without dead ends: 9 [2018-06-26 18:44:00,469 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:44:00,469 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 18:44:00,470 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 18:44:00,470 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:44:00,471 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-26 18:44:00,471 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-26 18:44:00,471 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:00,471 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-26 18:44:00,471 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:44:00,471 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-26 18:44:00,471 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:44:00,471 INFO ]: Found error trace [2018-06-26 18:44:00,471 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-26 18:44:00,471 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:00,471 INFO ]: Analyzing trace with hash -1153160823, now seen corresponding path program 3 times [2018-06-26 18:44:00,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:00,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:00,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:00,472 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:00,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:00,501 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:00,647 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:00,647 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:00,647 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 18:44:00,655 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:44:00,706 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:44:00,706 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:00,709 INFO ]: Computing forward predicates... [2018-06-26 18:44:00,898 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:00,932 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:00,932 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-26 18:44:00,933 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:44:00,933 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:44:00,933 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:44:00,933 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-06-26 18:44:01,234 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:01,234 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-26 18:44:01,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:44:01,234 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 18:44:01,234 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:01,235 INFO ]: With dead ends: 10 [2018-06-26 18:44:01,235 INFO ]: Without dead ends: 10 [2018-06-26 18:44:01,235 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:44:01,235 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 18:44:01,236 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 18:44:01,236 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:44:01,236 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-26 18:44:01,236 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-26 18:44:01,236 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:01,236 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-26 18:44:01,236 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:44:01,236 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-26 18:44:01,237 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:44:01,237 INFO ]: Found error trace [2018-06-26 18:44:01,237 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-26 18:44:01,237 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:01,237 INFO ]: Analyzing trace with hash -1388542972, now seen corresponding path program 4 times [2018-06-26 18:44:01,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:01,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:01,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:01,238 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:01,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:01,282 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:01,588 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:01,588 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:01,588 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 18:44:01,598 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:44:01,625 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:44:01,625 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:01,628 INFO ]: Computing forward predicates... [2018-06-26 18:44:01,683 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:01,703 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:01,703 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-26 18:44:01,704 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:44:01,704 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:44:01,704 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:44:01,704 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2018-06-26 18:44:01,777 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:01,777 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-26 18:44:01,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:44:01,875 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-26 18:44:01,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:01,876 INFO ]: With dead ends: 11 [2018-06-26 18:44:01,876 INFO ]: Without dead ends: 11 [2018-06-26 18:44:01,876 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:44:01,876 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:44:01,877 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 18:44:01,877 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:44:01,878 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-26 18:44:01,878 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-26 18:44:01,878 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:01,878 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-26 18:44:01,878 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:44:01,878 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-26 18:44:01,878 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:44:01,878 INFO ]: Found error trace [2018-06-26 18:44:01,878 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-26 18:44:01,878 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:01,879 INFO ]: Analyzing trace with hash -95454999, now seen corresponding path program 5 times [2018-06-26 18:44:01,879 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:01,879 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:01,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:01,879 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:01,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:01,899 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:02,380 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:02,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:02,380 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 18:44:02,388 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:44:02,425 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 18:44:02,425 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:02,428 INFO ]: Computing forward predicates... [2018-06-26 18:44:02,492 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:02,524 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:02,524 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-26 18:44:02,524 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:44:02,525 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:44:02,525 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:44:02,525 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2018-06-26 18:44:02,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:02,596 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-26 18:44:02,597 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:44:02,597 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-26 18:44:02,597 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:02,597 INFO ]: With dead ends: 12 [2018-06-26 18:44:02,597 INFO ]: Without dead ends: 12 [2018-06-26 18:44:02,597 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:44:02,598 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:44:02,599 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 18:44:02,599 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:44:02,599 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-26 18:44:02,599 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-26 18:44:02,599 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:02,599 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-26 18:44:02,599 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:44:02,599 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-26 18:44:02,599 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:44:02,599 INFO ]: Found error trace [2018-06-26 18:44:02,599 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-26 18:44:02,600 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:02,600 INFO ]: Analyzing trace with hash 1335566500, now seen corresponding path program 6 times [2018-06-26 18:44:02,600 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:02,600 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:02,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:02,601 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:02,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:02,622 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:03,197 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:03,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:03,197 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 18:44:03,209 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:44:03,295 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 18:44:03,295 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:03,299 INFO ]: Computing forward predicates... [2018-06-26 18:44:03,562 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:03,584 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:03,584 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-26 18:44:03,584 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:44:03,584 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:44:03,584 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:44:03,585 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2018-06-26 18:44:03,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:03,637 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-26 18:44:03,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:44:03,637 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-26 18:44:03,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:03,638 INFO ]: With dead ends: 13 [2018-06-26 18:44:03,638 INFO ]: Without dead ends: 13 [2018-06-26 18:44:03,638 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:44:03,638 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:44:03,639 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 18:44:03,639 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:44:03,640 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-26 18:44:03,640 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-26 18:44:03,640 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:03,640 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-26 18:44:03,640 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:44:03,640 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-26 18:44:03,640 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:44:03,640 INFO ]: Found error trace [2018-06-26 18:44:03,640 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-26 18:44:03,640 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:03,641 INFO ]: Analyzing trace with hash -1547407287, now seen corresponding path program 7 times [2018-06-26 18:44:03,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:03,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:03,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:03,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:03,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:03,662 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:03,920 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:03,920 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:03,920 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 18:44:03,928 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:03,958 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:03,962 INFO ]: Computing forward predicates... [2018-06-26 18:44:04,089 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:04,107 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:04,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-26 18:44:04,108 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:44:04,108 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:44:04,108 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:44:04,108 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-06-26 18:44:04,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:04,171 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-26 18:44:04,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:44:04,172 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-26 18:44:04,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:04,172 INFO ]: With dead ends: 14 [2018-06-26 18:44:04,172 INFO ]: Without dead ends: 14 [2018-06-26 18:44:04,172 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:44:04,173 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:44:04,174 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 18:44:04,174 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:44:04,174 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-26 18:44:04,174 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-26 18:44:04,174 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:04,174 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-26 18:44:04,174 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:44:04,174 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-26 18:44:04,174 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:44:04,174 INFO ]: Found error trace [2018-06-26 18:44:04,175 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-26 18:44:04,175 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:04,175 INFO ]: Analyzing trace with hash -725281468, now seen corresponding path program 8 times [2018-06-26 18:44:04,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:04,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:04,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:04,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:04,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:04,199 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:04,510 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:04,510 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:04,510 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 18:44:04,516 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:44:04,567 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:44:04,567 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:04,572 INFO ]: Computing forward predicates... [2018-06-26 18:44:04,822 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:04,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:04,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-26 18:44:04,850 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:44:04,850 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:44:04,851 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:44:04,851 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-06-26 18:44:04,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:04,944 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-26 18:44:04,944 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:44:04,944 INFO ]: Start accepts. Automaton has 13 states. Word has length 13 [2018-06-26 18:44:04,944 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:04,945 INFO ]: With dead ends: 15 [2018-06-26 18:44:04,945 INFO ]: Without dead ends: 15 [2018-06-26 18:44:04,945 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:44:04,945 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 18:44:04,946 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 18:44:04,946 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 18:44:04,947 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-26 18:44:04,947 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-26 18:44:04,947 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:04,947 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-26 18:44:04,947 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:44:04,947 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-26 18:44:04,947 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:44:04,947 INFO ]: Found error trace [2018-06-26 18:44:04,947 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-26 18:44:04,947 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:04,947 INFO ]: Analyzing trace with hash -1009184855, now seen corresponding path program 9 times [2018-06-26 18:44:04,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:04,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:04,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:04,948 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:04,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:04,984 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:05,227 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:05,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:05,227 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 18:44:05,232 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:44:05,306 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 18:44:05,306 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:05,310 INFO ]: Computing forward predicates... [2018-06-26 18:44:05,361 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:05,381 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:05,381 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-26 18:44:05,381 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:44:05,381 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:44:05,381 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:44:05,382 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-06-26 18:44:05,515 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:05,515 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-26 18:44:05,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:44:05,515 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-26 18:44:05,515 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:05,515 INFO ]: With dead ends: 16 [2018-06-26 18:44:05,515 INFO ]: Without dead ends: 16 [2018-06-26 18:44:05,516 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:44:05,516 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 18:44:05,517 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 18:44:05,517 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 18:44:05,518 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-26 18:44:05,518 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-26 18:44:05,518 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:05,518 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-26 18:44:05,518 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:44:05,518 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-26 18:44:05,519 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:44:05,519 INFO ]: Found error trace [2018-06-26 18:44:05,519 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-26 18:44:05,519 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:05,519 INFO ]: Analyzing trace with hash -1220255260, now seen corresponding path program 10 times [2018-06-26 18:44:05,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:05,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:05,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:05,520 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:05,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:05,547 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:05,957 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:05,957 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:05,957 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 18:44:05,963 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:44:06,019 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:44:06,019 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:06,024 INFO ]: Computing forward predicates... [2018-06-26 18:44:06,160 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:06,180 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:06,180 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-26 18:44:06,180 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:44:06,180 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:44:06,180 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:44:06,180 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2018-06-26 18:44:06,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:06,287 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-26 18:44:06,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:44:06,287 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-26 18:44:06,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:06,287 INFO ]: With dead ends: 17 [2018-06-26 18:44:06,287 INFO ]: Without dead ends: 17 [2018-06-26 18:44:06,287 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:44:06,287 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 18:44:06,289 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 18:44:06,289 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 18:44:06,289 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-26 18:44:06,289 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-26 18:44:06,289 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:06,289 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-26 18:44:06,289 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:44:06,289 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-26 18:44:06,289 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:44:06,289 INFO ]: Found error trace [2018-06-26 18:44:06,289 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-26 18:44:06,290 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:06,290 INFO ]: Analyzing trace with hash 826496777, now seen corresponding path program 11 times [2018-06-26 18:44:06,290 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:06,290 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:06,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:06,290 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:06,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:06,335 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:06,724 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:06,724 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:06,724 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 18:44:06,730 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:44:06,821 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 18:44:06,821 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:06,828 INFO ]: Computing forward predicates... [2018-06-26 18:44:06,877 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:06,904 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:06,904 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-26 18:44:06,904 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:44:06,904 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:44:06,904 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:44:06,905 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2018-06-26 18:44:07,002 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:07,002 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-26 18:44:07,004 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:44:07,004 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-26 18:44:07,004 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:07,004 INFO ]: With dead ends: 18 [2018-06-26 18:44:07,004 INFO ]: Without dead ends: 18 [2018-06-26 18:44:07,005 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:44:07,005 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 18:44:07,006 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 18:44:07,006 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 18:44:07,007 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-26 18:44:07,007 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-26 18:44:07,007 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:07,007 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-26 18:44:07,007 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:44:07,007 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-26 18:44:07,007 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:44:07,007 INFO ]: Found error trace [2018-06-26 18:44:07,007 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-26 18:44:07,007 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:07,007 INFO ]: Analyzing trace with hash -148699516, now seen corresponding path program 12 times [2018-06-26 18:44:07,007 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:07,007 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:07,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:07,008 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:07,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:07,040 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:07,461 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:07,461 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:07,461 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 18:44:07,467 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:44:07,515 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 18:44:07,515 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:07,520 INFO ]: Computing forward predicates... [2018-06-26 18:44:07,948 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:07,986 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:07,986 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-26 18:44:07,986 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:44:07,986 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:44:07,987 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:44:07,987 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2018-06-26 18:44:08,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:08,146 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-26 18:44:08,146 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:44:08,146 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-26 18:44:08,146 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:08,147 INFO ]: With dead ends: 19 [2018-06-26 18:44:08,147 INFO ]: Without dead ends: 19 [2018-06-26 18:44:08,147 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:44:08,147 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 18:44:08,148 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 18:44:08,148 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:44:08,149 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-26 18:44:08,149 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-26 18:44:08,149 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:08,149 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-26 18:44:08,149 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:44:08,149 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-26 18:44:08,149 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:44:08,149 INFO ]: Found error trace [2018-06-26 18:44:08,149 INFO ]: trace histogram [13, 1, 1, 1, 1, 1] [2018-06-26 18:44:08,150 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:08,150 INFO ]: Analyzing trace with hash -315013527, now seen corresponding path program 13 times [2018-06-26 18:44:08,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:08,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:08,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:08,150 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:08,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:08,190 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:09,409 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:09,409 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:09,409 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 18:44:09,414 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:09,475 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:09,480 INFO ]: Computing forward predicates... [2018-06-26 18:44:09,544 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:09,563 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:09,563 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-26 18:44:09,563 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:44:09,563 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:44:09,563 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:44:09,564 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2018-06-26 18:44:09,882 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:09,882 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-26 18:44:09,882 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:44:09,882 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-26 18:44:09,882 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:09,882 INFO ]: With dead ends: 20 [2018-06-26 18:44:09,882 INFO ]: Without dead ends: 20 [2018-06-26 18:44:09,883 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:44:09,883 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 18:44:09,884 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 18:44:09,884 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 18:44:09,885 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-26 18:44:09,885 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-26 18:44:09,885 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:09,885 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-26 18:44:09,885 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:44:09,885 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-26 18:44:09,885 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:44:09,885 INFO ]: Found error trace [2018-06-26 18:44:09,885 INFO ]: trace histogram [14, 1, 1, 1, 1, 1] [2018-06-26 18:44:09,885 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:09,885 INFO ]: Analyzing trace with hash -1175780572, now seen corresponding path program 14 times [2018-06-26 18:44:09,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:09,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:09,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:09,886 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:09,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:09,922 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:10,243 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:10,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:10,243 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 18:44:10,248 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:44:10,311 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:44:10,311 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:10,317 INFO ]: Computing forward predicates... [2018-06-26 18:44:10,411 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:10,430 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:10,430 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-26 18:44:10,430 INFO ]: Interpolant automaton has 18 states [2018-06-26 18:44:10,430 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 18:44:10,430 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:44:10,430 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2018-06-26 18:44:10,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:10,614 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-26 18:44:10,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:44:10,615 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-26 18:44:10,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:10,615 INFO ]: With dead ends: 21 [2018-06-26 18:44:10,615 INFO ]: Without dead ends: 21 [2018-06-26 18:44:10,616 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:44:10,616 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 18:44:10,617 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 18:44:10,617 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 18:44:10,617 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-26 18:44:10,617 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-26 18:44:10,618 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:10,618 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-26 18:44:10,618 INFO ]: Interpolant automaton has 18 states. [2018-06-26 18:44:10,618 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-26 18:44:10,618 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 18:44:10,618 INFO ]: Found error trace [2018-06-26 18:44:10,618 INFO ]: trace histogram [15, 1, 1, 1, 1, 1] [2018-06-26 18:44:10,618 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:10,618 INFO ]: Analyzing trace with hash -2089755191, now seen corresponding path program 15 times [2018-06-26 18:44:10,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:10,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:10,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:10,619 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:10,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:10,666 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:11,466 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:11,466 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:11,466 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 18:44:11,472 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:44:11,528 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-26 18:44:11,528 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:11,534 INFO ]: Computing forward predicates... [2018-06-26 18:44:11,573 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:11,592 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:11,592 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-26 18:44:11,593 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:44:11,593 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:44:11,593 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:44:11,593 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2018-06-26 18:44:11,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:11,848 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-26 18:44:11,908 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 18:44:11,908 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-26 18:44:11,908 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:11,909 INFO ]: With dead ends: 22 [2018-06-26 18:44:11,909 INFO ]: Without dead ends: 22 [2018-06-26 18:44:11,909 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:44:11,909 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 18:44:11,911 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-26 18:44:11,911 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 18:44:11,911 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-26 18:44:11,911 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-26 18:44:11,911 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:11,911 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-26 18:44:11,911 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:44:11,911 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-26 18:44:11,912 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 18:44:11,912 INFO ]: Found error trace [2018-06-26 18:44:11,912 INFO ]: trace histogram [16, 1, 1, 1, 1, 1] [2018-06-26 18:44:11,912 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:11,912 INFO ]: Analyzing trace with hash -358197308, now seen corresponding path program 16 times [2018-06-26 18:44:11,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:11,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:11,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:11,913 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:11,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:11,957 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:12,689 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:12,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:12,689 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 18:44:12,695 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:44:12,816 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:44:12,816 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:12,825 INFO ]: Computing forward predicates... [2018-06-26 18:44:12,989 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:13,019 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:13,019 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-26 18:44:13,019 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:44:13,019 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:44:13,020 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:44:13,020 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 20 states. [2018-06-26 18:44:13,223 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:13,223 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-26 18:44:13,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 18:44:13,224 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-26 18:44:13,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:13,224 INFO ]: With dead ends: 23 [2018-06-26 18:44:13,224 INFO ]: Without dead ends: 23 [2018-06-26 18:44:13,225 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:44:13,225 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 18:44:13,226 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 18:44:13,226 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 18:44:13,227 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-26 18:44:13,227 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-26 18:44:13,227 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:13,227 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-26 18:44:13,227 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:44:13,227 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-26 18:44:13,227 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 18:44:13,227 INFO ]: Found error trace [2018-06-26 18:44:13,227 INFO ]: trace histogram [17, 1, 1, 1, 1, 1] [2018-06-26 18:44:13,227 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:13,227 INFO ]: Analyzing trace with hash 1780489513, now seen corresponding path program 17 times [2018-06-26 18:44:13,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:13,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:13,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:13,228 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:13,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:13,278 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:13,976 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:13,976 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:13,976 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 18:44:13,981 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:44:14,153 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-26 18:44:14,153 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:14,166 INFO ]: Computing forward predicates... [2018-06-26 18:44:14,314 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:14,333 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:14,333 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-26 18:44:14,334 INFO ]: Interpolant automaton has 21 states [2018-06-26 18:44:14,334 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 18:44:14,334 INFO ]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:44:14,334 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 21 states. [2018-06-26 18:44:14,570 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:14,570 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-26 18:44:14,570 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 18:44:14,570 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-26 18:44:14,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:14,570 INFO ]: With dead ends: 24 [2018-06-26 18:44:14,570 INFO ]: Without dead ends: 24 [2018-06-26 18:44:14,571 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:44:14,571 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 18:44:14,575 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 18:44:14,575 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 18:44:14,575 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-26 18:44:14,575 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-26 18:44:14,575 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:14,575 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-26 18:44:14,575 INFO ]: Interpolant automaton has 21 states. [2018-06-26 18:44:14,575 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-26 18:44:14,576 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 18:44:14,576 INFO ]: Found error trace [2018-06-26 18:44:14,576 INFO ]: trace histogram [18, 1, 1, 1, 1, 1] [2018-06-26 18:44:14,576 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:14,576 INFO ]: Analyzing trace with hash -639695772, now seen corresponding path program 18 times [2018-06-26 18:44:14,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:14,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:14,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:14,576 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:14,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:14,636 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:15,022 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:15,022 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:15,022 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 18:44:15,044 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:44:15,127 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-26 18:44:15,127 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:15,135 INFO ]: Computing forward predicates... [2018-06-26 18:44:15,202 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:15,221 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:15,221 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-26 18:44:15,222 INFO ]: Interpolant automaton has 22 states [2018-06-26 18:44:15,222 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 18:44:15,222 INFO ]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:44:15,222 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2018-06-26 18:44:15,435 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:15,435 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-26 18:44:15,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 18:44:15,436 INFO ]: Start accepts. Automaton has 22 states. Word has length 23 [2018-06-26 18:44:15,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:15,436 INFO ]: With dead ends: 25 [2018-06-26 18:44:15,436 INFO ]: Without dead ends: 25 [2018-06-26 18:44:15,436 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:44:15,436 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 18:44:15,439 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-26 18:44:15,439 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 18:44:15,439 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-26 18:44:15,439 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-26 18:44:15,439 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:15,439 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-26 18:44:15,439 INFO ]: Interpolant automaton has 22 states. [2018-06-26 18:44:15,439 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-26 18:44:15,440 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 18:44:15,440 INFO ]: Found error trace [2018-06-26 18:44:15,440 INFO ]: trace histogram [19, 1, 1, 1, 1, 1] [2018-06-26 18:44:15,440 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:15,440 INFO ]: Analyzing trace with hash 1643971721, now seen corresponding path program 19 times [2018-06-26 18:44:15,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:15,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:15,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:15,441 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:15,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:15,487 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:15,932 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:15,932 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:15,932 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 18:44:15,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:16,049 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:16,057 INFO ]: Computing forward predicates... [2018-06-26 18:44:16,140 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:16,159 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:16,159 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-26 18:44:16,159 INFO ]: Interpolant automaton has 23 states [2018-06-26 18:44:16,160 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 18:44:16,160 INFO ]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:44:16,160 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 23 states. [2018-06-26 18:44:16,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:16,498 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-26 18:44:16,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 18:44:16,499 INFO ]: Start accepts. Automaton has 23 states. Word has length 24 [2018-06-26 18:44:16,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:16,500 INFO ]: With dead ends: 26 [2018-06-26 18:44:16,500 INFO ]: Without dead ends: 26 [2018-06-26 18:44:16,500 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:44:16,500 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 18:44:16,502 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 18:44:16,502 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 18:44:16,502 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-26 18:44:16,502 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-26 18:44:16,502 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:16,502 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-26 18:44:16,502 INFO ]: Interpolant automaton has 23 states. [2018-06-26 18:44:16,502 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-26 18:44:16,503 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 18:44:16,503 INFO ]: Found error trace [2018-06-26 18:44:16,503 INFO ]: trace histogram [20, 1, 1, 1, 1, 1] [2018-06-26 18:44:16,503 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:16,503 INFO ]: Analyzing trace with hash -576780028, now seen corresponding path program 20 times [2018-06-26 18:44:16,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:16,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:16,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:16,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:16,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:16,563 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:17,054 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:17,054 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:17,070 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 18:44:17,076 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:44:17,152 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:44:17,152 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:17,159 INFO ]: Computing forward predicates... [2018-06-26 18:44:17,217 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:17,236 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:17,236 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-26 18:44:17,236 INFO ]: Interpolant automaton has 24 states [2018-06-26 18:44:17,236 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 18:44:17,237 INFO ]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:44:17,237 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 24 states. [2018-06-26 18:44:17,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:17,487 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-26 18:44:17,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 18:44:17,489 INFO ]: Start accepts. Automaton has 24 states. Word has length 25 [2018-06-26 18:44:17,489 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:17,489 INFO ]: With dead ends: 27 [2018-06-26 18:44:17,489 INFO ]: Without dead ends: 27 [2018-06-26 18:44:17,489 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:44:17,489 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 18:44:17,491 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-26 18:44:17,491 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 18:44:17,491 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-26 18:44:17,491 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-26 18:44:17,491 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:17,491 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-26 18:44:17,491 INFO ]: Interpolant automaton has 24 states. [2018-06-26 18:44:17,492 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-26 18:44:17,492 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:44:17,492 INFO ]: Found error trace [2018-06-26 18:44:17,492 INFO ]: trace histogram [21, 1, 1, 1, 1, 1] [2018-06-26 18:44:17,492 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:17,492 INFO ]: Analyzing trace with hash -700607511, now seen corresponding path program 21 times [2018-06-26 18:44:17,492 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:17,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:17,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:17,493 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:17,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:17,578 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:18,868 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:18,868 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:18,868 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 18:44:18,874 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:44:19,056 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-26 18:44:19,056 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:19,064 INFO ]: Computing forward predicates... [2018-06-26 18:44:19,142 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:19,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:19,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-26 18:44:19,162 INFO ]: Interpolant automaton has 25 states [2018-06-26 18:44:19,162 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 18:44:19,162 INFO ]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-06-26 18:44:19,163 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 25 states. [2018-06-26 18:44:19,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:19,508 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-26 18:44:19,510 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 18:44:19,510 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-26 18:44:19,510 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:19,510 INFO ]: With dead ends: 28 [2018-06-26 18:44:19,510 INFO ]: Without dead ends: 28 [2018-06-26 18:44:19,511 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-06-26 18:44:19,511 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 18:44:19,512 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-26 18:44:19,512 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 18:44:19,513 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-26 18:44:19,513 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-26 18:44:19,513 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:19,513 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-26 18:44:19,513 INFO ]: Interpolant automaton has 25 states. [2018-06-26 18:44:19,513 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-26 18:44:19,513 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 18:44:19,513 INFO ]: Found error trace [2018-06-26 18:44:19,513 INFO ]: trace histogram [22, 1, 1, 1, 1, 1] [2018-06-26 18:44:19,513 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:19,514 INFO ]: Analyzing trace with hash -244292188, now seen corresponding path program 22 times [2018-06-26 18:44:19,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:19,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:19,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:19,514 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:19,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:19,561 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:20,082 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:20,082 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:20,082 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 18:44:20,087 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:44:20,241 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:44:20,241 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:20,250 INFO ]: Computing forward predicates... [2018-06-26 18:44:20,331 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:20,350 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:20,351 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-06-26 18:44:20,351 INFO ]: Interpolant automaton has 26 states [2018-06-26 18:44:20,351 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 18:44:20,351 INFO ]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-26 18:44:20,351 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 26 states. [2018-06-26 18:44:20,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:20,895 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-26 18:44:20,896 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 18:44:20,896 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-26 18:44:20,896 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:20,896 INFO ]: With dead ends: 29 [2018-06-26 18:44:20,896 INFO ]: Without dead ends: 29 [2018-06-26 18:44:20,896 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-26 18:44:20,896 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 18:44:20,898 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 18:44:20,898 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 18:44:20,898 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-26 18:44:20,899 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-26 18:44:20,899 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:20,899 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-26 18:44:20,899 INFO ]: Interpolant automaton has 26 states. [2018-06-26 18:44:20,899 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-26 18:44:20,899 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 18:44:20,899 INFO ]: Found error trace [2018-06-26 18:44:20,899 INFO ]: trace histogram [23, 1, 1, 1, 1, 1] [2018-06-26 18:44:20,899 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:20,899 INFO ]: Analyzing trace with hash 1016580937, now seen corresponding path program 23 times [2018-06-26 18:44:20,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:20,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:20,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:20,900 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:20,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:20,952 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:21,912 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:21,912 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:21,912 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 18:44:21,920 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:44:22,023 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-26 18:44:22,023 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:22,035 INFO ]: Computing forward predicates... [2018-06-26 18:44:22,110 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:22,129 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:22,174 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-26 18:44:22,174 INFO ]: Interpolant automaton has 27 states [2018-06-26 18:44:22,174 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 18:44:22,174 INFO ]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-06-26 18:44:22,272 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 27 states. [2018-06-26 18:44:22,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:22,608 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-26 18:44:22,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 18:44:22,608 INFO ]: Start accepts. Automaton has 27 states. Word has length 28 [2018-06-26 18:44:22,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:22,608 INFO ]: With dead ends: 30 [2018-06-26 18:44:22,609 INFO ]: Without dead ends: 30 [2018-06-26 18:44:22,609 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-06-26 18:44:22,609 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 18:44:22,610 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-26 18:44:22,610 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 18:44:22,611 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-26 18:44:22,611 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-26 18:44:22,611 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:22,611 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-26 18:44:22,611 INFO ]: Interpolant automaton has 27 states. [2018-06-26 18:44:22,611 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-26 18:44:22,611 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 18:44:22,611 INFO ]: Found error trace [2018-06-26 18:44:22,611 INFO ]: trace histogram [24, 1, 1, 1, 1, 1] [2018-06-26 18:44:22,611 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:22,611 INFO ]: Analyzing trace with hash 1448942148, now seen corresponding path program 24 times [2018-06-26 18:44:22,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:22,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:22,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:22,612 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:22,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:22,684 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:23,427 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:23,427 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:23,427 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 18:44:23,433 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:44:23,526 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-26 18:44:23,527 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:23,535 INFO ]: Computing forward predicates... [2018-06-26 18:44:23,678 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:23,697 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:23,697 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-26 18:44:23,697 INFO ]: Interpolant automaton has 28 states [2018-06-26 18:44:23,697 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 18:44:23,698 INFO ]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:44:23,698 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 28 states. [2018-06-26 18:44:24,168 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:24,168 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-26 18:44:24,168 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 18:44:24,168 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-26 18:44:24,168 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:24,168 INFO ]: With dead ends: 31 [2018-06-26 18:44:24,168 INFO ]: Without dead ends: 31 [2018-06-26 18:44:24,169 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:44:24,169 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 18:44:24,171 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 18:44:24,171 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 18:44:24,171 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-26 18:44:24,171 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-26 18:44:24,171 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:24,171 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-26 18:44:24,171 INFO ]: Interpolant automaton has 28 states. [2018-06-26 18:44:24,171 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-26 18:44:24,173 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 18:44:24,173 INFO ]: Found error trace [2018-06-26 18:44:24,173 INFO ]: trace histogram [25, 1, 1, 1, 1, 1] [2018-06-26 18:44:24,173 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:24,173 INFO ]: Analyzing trace with hash 1967237801, now seen corresponding path program 25 times [2018-06-26 18:44:24,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:24,173 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:24,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:24,173 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:24,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:24,240 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:24,963 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:24,963 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:24,963 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 18:44:24,969 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:25,165 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:25,175 INFO ]: Computing forward predicates... [2018-06-26 18:44:25,246 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:25,265 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:25,265 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-26 18:44:25,265 INFO ]: Interpolant automaton has 29 states [2018-06-26 18:44:25,266 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 18:44:25,266 INFO ]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:44:25,266 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 29 states. [2018-06-26 18:44:25,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:25,656 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-26 18:44:25,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 18:44:25,658 INFO ]: Start accepts. Automaton has 29 states. Word has length 30 [2018-06-26 18:44:25,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:25,658 INFO ]: With dead ends: 32 [2018-06-26 18:44:25,658 INFO ]: Without dead ends: 32 [2018-06-26 18:44:25,658 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:44:25,658 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 18:44:25,660 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-26 18:44:25,660 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 18:44:25,661 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-26 18:44:25,661 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-26 18:44:25,661 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:25,661 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-26 18:44:25,661 INFO ]: Interpolant automaton has 29 states. [2018-06-26 18:44:25,661 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-26 18:44:25,661 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 18:44:25,661 INFO ]: Found error trace [2018-06-26 18:44:25,661 INFO ]: trace histogram [26, 1, 1, 1, 1, 1] [2018-06-26 18:44:25,661 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:25,662 INFO ]: Analyzing trace with hash 854533860, now seen corresponding path program 26 times [2018-06-26 18:44:25,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:25,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:25,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:25,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:25,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:25,775 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:26,551 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:26,551 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:26,551 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 18:44:26,562 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:44:26,682 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:44:26,682 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:26,691 INFO ]: Computing forward predicates... [2018-06-26 18:44:26,795 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:26,814 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:26,814 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-06-26 18:44:26,814 INFO ]: Interpolant automaton has 30 states [2018-06-26 18:44:26,814 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 18:44:26,814 INFO ]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:44:26,815 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 30 states. [2018-06-26 18:44:27,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:27,232 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-26 18:44:27,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 18:44:27,248 INFO ]: Start accepts. Automaton has 30 states. Word has length 31 [2018-06-26 18:44:27,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:27,249 INFO ]: With dead ends: 33 [2018-06-26 18:44:27,249 INFO ]: Without dead ends: 33 [2018-06-26 18:44:27,249 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:44:27,249 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 18:44:27,251 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 18:44:27,251 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 18:44:27,251 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-26 18:44:27,251 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-26 18:44:27,251 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:27,251 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-26 18:44:27,251 INFO ]: Interpolant automaton has 30 states. [2018-06-26 18:44:27,251 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-26 18:44:27,252 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 18:44:27,252 INFO ]: Found error trace [2018-06-26 18:44:27,252 INFO ]: trace histogram [27, 1, 1, 1, 1, 1] [2018-06-26 18:44:27,252 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:27,252 INFO ]: Analyzing trace with hash 720450057, now seen corresponding path program 27 times [2018-06-26 18:44:27,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:27,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:27,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:27,253 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:27,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:27,384 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:28,225 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:28,225 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:28,225 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 18:44:28,231 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:44:28,369 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-26 18:44:28,369 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:28,378 INFO ]: Computing forward predicates... [2018-06-26 18:44:28,541 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:28,560 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:28,561 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-26 18:44:28,561 INFO ]: Interpolant automaton has 31 states [2018-06-26 18:44:28,561 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 18:44:28,561 INFO ]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-26 18:44:28,561 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 31 states. [2018-06-26 18:44:29,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:29,010 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-26 18:44:29,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 18:44:29,011 INFO ]: Start accepts. Automaton has 31 states. Word has length 32 [2018-06-26 18:44:29,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:29,011 INFO ]: With dead ends: 34 [2018-06-26 18:44:29,011 INFO ]: Without dead ends: 34 [2018-06-26 18:44:29,012 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-26 18:44:29,012 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 18:44:29,013 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 18:44:29,013 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:44:29,013 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-26 18:44:29,013 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-26 18:44:29,014 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:29,014 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-26 18:44:29,014 INFO ]: Interpolant automaton has 31 states. [2018-06-26 18:44:29,014 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-26 18:44:29,014 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 18:44:29,014 INFO ]: Found error trace [2018-06-26 18:44:29,014 INFO ]: trace histogram [28, 1, 1, 1, 1, 1] [2018-06-26 18:44:29,014 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:29,014 INFO ]: Analyzing trace with hash 858819460, now seen corresponding path program 28 times [2018-06-26 18:44:29,015 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:29,015 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:29,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:29,015 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:29,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:29,119 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:29,855 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:29,855 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:29,855 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 18:44:29,860 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:44:30,121 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:44:30,121 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:30,134 INFO ]: Computing forward predicates... [2018-06-26 18:44:30,215 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:30,234 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:30,234 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-26 18:44:30,234 INFO ]: Interpolant automaton has 32 states [2018-06-26 18:44:30,234 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 18:44:30,234 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-26 18:44:30,234 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 32 states. [2018-06-26 18:44:30,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:30,710 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-26 18:44:30,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 18:44:30,710 INFO ]: Start accepts. Automaton has 32 states. Word has length 33 [2018-06-26 18:44:30,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:30,710 INFO ]: With dead ends: 35 [2018-06-26 18:44:30,710 INFO ]: Without dead ends: 35 [2018-06-26 18:44:30,711 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-26 18:44:30,711 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 18:44:30,712 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 18:44:30,712 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 18:44:30,713 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-26 18:44:30,713 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-26 18:44:30,713 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:30,713 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-26 18:44:30,713 INFO ]: Interpolant automaton has 32 states. [2018-06-26 18:44:30,713 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-26 18:44:30,713 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 18:44:30,713 INFO ]: Found error trace [2018-06-26 18:44:30,713 INFO ]: trace histogram [29, 1, 1, 1, 1, 1] [2018-06-26 18:44:30,714 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:30,714 INFO ]: Analyzing trace with hash 853303657, now seen corresponding path program 29 times [2018-06-26 18:44:30,714 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:30,714 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:30,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:30,714 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:30,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:30,848 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:31,732 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:31,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:31,732 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 18:44:31,737 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:44:31,866 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-26 18:44:31,866 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:31,881 INFO ]: Computing forward predicates... [2018-06-26 18:44:31,951 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:31,970 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:31,971 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-26 18:44:31,971 INFO ]: Interpolant automaton has 33 states [2018-06-26 18:44:31,971 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-26 18:44:31,971 INFO ]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 18:44:31,971 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2018-06-26 18:44:32,474 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:32,474 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-26 18:44:32,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 18:44:32,526 INFO ]: Start accepts. Automaton has 33 states. Word has length 34 [2018-06-26 18:44:32,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:32,526 INFO ]: With dead ends: 36 [2018-06-26 18:44:32,526 INFO ]: Without dead ends: 36 [2018-06-26 18:44:32,527 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 18:44:32,527 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 18:44:32,529 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-26 18:44:32,529 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 18:44:32,529 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-26 18:44:32,529 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-26 18:44:32,529 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:32,529 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-26 18:44:32,529 INFO ]: Interpolant automaton has 33 states. [2018-06-26 18:44:32,529 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-26 18:44:32,530 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 18:44:32,530 INFO ]: Found error trace [2018-06-26 18:44:32,530 INFO ]: trace histogram [30, 1, 1, 1, 1, 1] [2018-06-26 18:44:32,530 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:32,530 INFO ]: Analyzing trace with hash 682313764, now seen corresponding path program 30 times [2018-06-26 18:44:32,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:32,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:32,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:32,530 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:32,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:32,626 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:33,724 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:33,724 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:33,724 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 18:44:33,730 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:44:33,852 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-26 18:44:33,852 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:33,862 INFO ]: Computing forward predicates... [2018-06-26 18:44:33,933 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:33,952 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:33,952 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-26 18:44:33,953 INFO ]: Interpolant automaton has 34 states [2018-06-26 18:44:33,953 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 18:44:33,953 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 18:44:33,953 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 34 states. [2018-06-26 18:44:34,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:34,497 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-26 18:44:34,497 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 18:44:34,497 INFO ]: Start accepts. Automaton has 34 states. Word has length 35 [2018-06-26 18:44:34,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:34,497 INFO ]: With dead ends: 37 [2018-06-26 18:44:34,497 INFO ]: Without dead ends: 37 [2018-06-26 18:44:34,498 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 18:44:34,498 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 18:44:34,501 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-26 18:44:34,501 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 18:44:34,501 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-26 18:44:34,501 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-26 18:44:34,501 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:34,501 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-26 18:44:34,501 INFO ]: Interpolant automaton has 34 states. [2018-06-26 18:44:34,501 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-26 18:44:34,502 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 18:44:34,502 INFO ]: Found error trace [2018-06-26 18:44:34,502 INFO ]: trace histogram [31, 1, 1, 1, 1, 1] [2018-06-26 18:44:34,502 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:34,502 INFO ]: Analyzing trace with hash -323405623, now seen corresponding path program 31 times [2018-06-26 18:44:34,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:34,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:34,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:34,503 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:34,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:34,612 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:35,760 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:35,760 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:35,760 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 18:44:35,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:36,119 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:36,133 INFO ]: Computing forward predicates... [2018-06-26 18:44:36,198 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:36,218 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:36,218 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-26 18:44:36,219 INFO ]: Interpolant automaton has 35 states [2018-06-26 18:44:36,219 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 18:44:36,219 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 18:44:36,219 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 35 states. [2018-06-26 18:44:36,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:36,809 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-26 18:44:36,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 18:44:36,809 INFO ]: Start accepts. Automaton has 35 states. Word has length 36 [2018-06-26 18:44:36,810 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:36,810 INFO ]: With dead ends: 38 [2018-06-26 18:44:36,810 INFO ]: Without dead ends: 38 [2018-06-26 18:44:36,810 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 18:44:36,810 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 18:44:36,811 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-26 18:44:36,811 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 18:44:36,811 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-26 18:44:36,811 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-26 18:44:36,812 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:36,812 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-26 18:44:36,812 INFO ]: Interpolant automaton has 35 states. [2018-06-26 18:44:36,812 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-26 18:44:36,812 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 18:44:36,812 INFO ]: Found error trace [2018-06-26 18:44:36,812 INFO ]: trace histogram [32, 1, 1, 1, 1, 1] [2018-06-26 18:44:36,812 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:36,812 INFO ]: Analyzing trace with hash -1435935548, now seen corresponding path program 32 times [2018-06-26 18:44:36,812 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:36,812 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:36,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:36,813 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:36,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:36,937 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:38,467 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:38,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:38,467 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 18:44:38,473 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:44:38,646 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:44:38,646 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:38,658 INFO ]: Computing forward predicates... [2018-06-26 18:44:38,766 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:38,785 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:38,785 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-26 18:44:38,786 INFO ]: Interpolant automaton has 36 states [2018-06-26 18:44:38,786 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 18:44:38,786 INFO ]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 18:44:38,786 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 36 states. [2018-06-26 18:44:39,413 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:39,413 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-26 18:44:39,413 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 18:44:39,413 INFO ]: Start accepts. Automaton has 36 states. Word has length 37 [2018-06-26 18:44:39,413 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:39,413 INFO ]: With dead ends: 39 [2018-06-26 18:44:39,413 INFO ]: Without dead ends: 39 [2018-06-26 18:44:39,414 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 18:44:39,414 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 18:44:39,415 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 18:44:39,415 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 18:44:39,415 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-26 18:44:39,415 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-26 18:44:39,415 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:39,415 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-26 18:44:39,415 INFO ]: Interpolant automaton has 36 states. [2018-06-26 18:44:39,415 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-26 18:44:39,416 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 18:44:39,416 INFO ]: Found error trace [2018-06-26 18:44:39,416 INFO ]: trace histogram [33, 1, 1, 1, 1, 1] [2018-06-26 18:44:39,416 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:39,416 INFO ]: Analyzing trace with hash -1564624855, now seen corresponding path program 33 times [2018-06-26 18:44:39,416 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:39,416 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:39,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:39,416 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:39,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:39,514 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:41,758 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:41,758 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:41,758 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 18:44:41,763 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:44:41,899 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-26 18:44:41,899 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:41,911 INFO ]: Computing forward predicates... [2018-06-26 18:44:42,089 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:42,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:42,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-26 18:44:42,109 INFO ]: Interpolant automaton has 37 states [2018-06-26 18:44:42,109 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-26 18:44:42,109 INFO ]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 18:44:42,109 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 37 states. [2018-06-26 18:44:42,755 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:42,755 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-26 18:44:42,755 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 18:44:42,755 INFO ]: Start accepts. Automaton has 37 states. Word has length 38 [2018-06-26 18:44:42,755 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:42,755 INFO ]: With dead ends: 40 [2018-06-26 18:44:42,755 INFO ]: Without dead ends: 40 [2018-06-26 18:44:42,756 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 18:44:42,756 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 18:44:42,757 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-26 18:44:42,757 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 18:44:42,757 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-26 18:44:42,757 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-26 18:44:42,758 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:42,758 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-26 18:44:42,758 INFO ]: Interpolant automaton has 37 states. [2018-06-26 18:44:42,758 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-26 18:44:42,758 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 18:44:42,758 INFO ]: Found error trace [2018-06-26 18:44:42,758 INFO ]: trace histogram [34, 1, 1, 1, 1, 1] [2018-06-26 18:44:42,758 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:42,758 INFO ]: Analyzing trace with hash -1259026076, now seen corresponding path program 34 times [2018-06-26 18:44:42,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:42,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:42,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:42,759 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:42,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:42,847 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:44,270 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:44,270 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:44,270 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 18:44:44,276 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:44:44,744 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:44:44,744 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:44,760 INFO ]: Computing forward predicates... [2018-06-26 18:44:45,344 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:45,364 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:45,364 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-06-26 18:44:45,364 INFO ]: Interpolant automaton has 38 states [2018-06-26 18:44:45,364 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-26 18:44:45,364 INFO ]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 18:44:45,364 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 38 states. [2018-06-26 18:44:46,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:46,053 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-26 18:44:46,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 18:44:46,053 INFO ]: Start accepts. Automaton has 38 states. Word has length 39 [2018-06-26 18:44:46,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:46,054 INFO ]: With dead ends: 41 [2018-06-26 18:44:46,054 INFO ]: Without dead ends: 41 [2018-06-26 18:44:46,054 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 18:44:46,054 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 18:44:46,055 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 18:44:46,055 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 18:44:46,055 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-26 18:44:46,055 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-26 18:44:46,055 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:46,055 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-26 18:44:46,055 INFO ]: Interpolant automaton has 38 states. [2018-06-26 18:44:46,055 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-26 18:44:46,056 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 18:44:46,056 INFO ]: Found error trace [2018-06-26 18:44:46,056 INFO ]: trace histogram [35, 1, 1, 1, 1, 1] [2018-06-26 18:44:46,056 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:46,056 INFO ]: Analyzing trace with hash -375398519, now seen corresponding path program 35 times [2018-06-26 18:44:46,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:46,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:46,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:46,057 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:46,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:46,224 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:47,238 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:47,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:47,239 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 18:44:47,244 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:44:47,420 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-06-26 18:44:47,420 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:47,439 INFO ]: Computing forward predicates... [2018-06-26 18:44:47,545 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:47,564 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:47,565 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-06-26 18:44:47,565 INFO ]: Interpolant automaton has 39 states [2018-06-26 18:44:47,565 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-26 18:44:47,565 INFO ]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 18:44:47,565 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 39 states. [2018-06-26 18:44:48,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:48,290 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-26 18:44:48,290 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-26 18:44:48,290 INFO ]: Start accepts. Automaton has 39 states. Word has length 40 [2018-06-26 18:44:48,290 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:48,290 INFO ]: With dead ends: 42 [2018-06-26 18:44:48,290 INFO ]: Without dead ends: 42 [2018-06-26 18:44:48,291 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 18:44:48,291 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-26 18:44:48,292 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-26 18:44:48,292 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-26 18:44:48,292 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-26 18:44:48,292 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-26 18:44:48,292 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:48,292 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-26 18:44:48,292 INFO ]: Interpolant automaton has 39 states. [2018-06-26 18:44:48,292 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-26 18:44:48,293 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-26 18:44:48,293 INFO ]: Found error trace [2018-06-26 18:44:48,293 INFO ]: trace histogram [36, 1, 1, 1, 1, 1] [2018-06-26 18:44:48,293 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:48,293 INFO ]: Analyzing trace with hash 1247251972, now seen corresponding path program 36 times [2018-06-26 18:44:48,293 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:48,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:48,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:48,293 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:48,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:48,467 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:49,504 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:49,505 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:49,537 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 18:44:49,544 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:44:49,710 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-06-26 18:44:49,710 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:49,728 INFO ]: Computing forward predicates... [2018-06-26 18:44:50,050 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:50,070 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:50,070 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-06-26 18:44:50,070 INFO ]: Interpolant automaton has 40 states [2018-06-26 18:44:50,070 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-26 18:44:50,071 INFO ]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 18:44:50,071 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 40 states. [2018-06-26 18:44:50,849 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:50,849 INFO ]: Finished difference Result 43 states and 43 transitions. [2018-06-26 18:44:50,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 18:44:50,849 INFO ]: Start accepts. Automaton has 40 states. Word has length 41 [2018-06-26 18:44:50,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:50,849 INFO ]: With dead ends: 43 [2018-06-26 18:44:50,849 INFO ]: Without dead ends: 43 [2018-06-26 18:44:50,849 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 18:44:50,849 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 18:44:50,850 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-26 18:44:50,850 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 18:44:50,851 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-06-26 18:44:50,851 INFO ]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-06-26 18:44:50,851 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:50,851 INFO ]: Abstraction has 43 states and 43 transitions. [2018-06-26 18:44:50,851 INFO ]: Interpolant automaton has 40 states. [2018-06-26 18:44:50,851 INFO ]: Start isEmpty. Operand 43 states and 43 transitions. [2018-06-26 18:44:50,851 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 18:44:50,851 INFO ]: Found error trace [2018-06-26 18:44:50,851 INFO ]: trace histogram [37, 1, 1, 1, 1, 1] [2018-06-26 18:44:50,851 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:50,851 INFO ]: Analyzing trace with hash 9809641, now seen corresponding path program 37 times [2018-06-26 18:44:50,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:50,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:50,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:50,852 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:44:50,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:51,057 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:52,459 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:52,459 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:52,459 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 18:44:52,464 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:53,000 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:53,018 INFO ]: Computing forward predicates... [2018-06-26 18:44:53,153 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:53,172 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:53,172 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-06-26 18:44:53,172 INFO ]: Interpolant automaton has 41 states [2018-06-26 18:44:53,172 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-26 18:44:53,173 INFO ]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 18:44:53,173 INFO ]: Start difference. First operand 43 states and 43 transitions. Second operand 41 states. [2018-06-26 18:44:53,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:44:53,998 INFO ]: Finished difference Result 44 states and 44 transitions. [2018-06-26 18:44:53,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-26 18:44:53,999 INFO ]: Start accepts. Automaton has 41 states. Word has length 42 [2018-06-26 18:44:53,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:44:53,999 INFO ]: With dead ends: 44 [2018-06-26 18:44:53,999 INFO ]: Without dead ends: 44 [2018-06-26 18:44:53,999 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 18:44:54,000 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 18:44:54,000 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-26 18:44:54,000 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 18:44:54,001 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-06-26 18:44:54,001 INFO ]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-06-26 18:44:54,001 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:44:54,001 INFO ]: Abstraction has 44 states and 44 transitions. [2018-06-26 18:44:54,001 INFO ]: Interpolant automaton has 41 states. [2018-06-26 18:44:54,001 INFO ]: Start isEmpty. Operand 44 states and 44 transitions. [2018-06-26 18:44:54,001 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-26 18:44:54,001 INFO ]: Found error trace [2018-06-26 18:44:54,001 INFO ]: trace histogram [38, 1, 1, 1, 1, 1] [2018-06-26 18:44:54,001 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:44:54,001 INFO ]: Analyzing trace with hash 303803044, now seen corresponding path program 38 times [2018-06-26 18:44:54,001 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:44:54,001 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:44:54,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:54,001 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:44:54,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:44:54,155 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:55,558 INFO ]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:55,558 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:44:55,558 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 18:44:55,563 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:44:55,806 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:44:55,806 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:44:55,822 INFO ]: Computing forward predicates... [2018-06-26 18:44:56,168 INFO ]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:44:56,188 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:44:56,188 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-06-26 18:44:56,188 INFO ]: Interpolant automaton has 42 states [2018-06-26 18:44:56,188 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-26 18:44:56,188 INFO ]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 18:44:56,188 INFO ]: Start difference. First operand 44 states and 44 transitions. Second operand 42 states. Received shutdown request... [2018-06-26 18:44:56,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:44:56,503 WARN ]: Verification canceled [2018-06-26 18:44:56,506 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:44:56,506 WARN ]: Timeout [2018-06-26 18:44:56,507 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:44:56 BasicIcfg [2018-06-26 18:44:56,507 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:44:56,508 INFO ]: Toolchain (without parser) took 58206.49 ms. Allocated memory was 306.7 MB in the beginning and 1.1 GB in the end (delta: 779.1 MB). Free memory was 263.2 MB in the beginning and 597.7 MB in the end (delta: -334.5 MB). Peak memory consumption was 444.5 MB. Max. memory is 3.6 GB. [2018-06-26 18:44:56,509 INFO ]: SmtParser took 0.04 ms. Allocated memory is still 306.7 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:44:56,509 INFO ]: ChcToBoogie took 55.41 ms. Allocated memory is still 306.7 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:44:56,509 INFO ]: Boogie Preprocessor took 32.51 ms. Allocated memory is still 306.7 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:44:56,510 INFO ]: RCFGBuilder took 264.90 ms. Allocated memory is still 306.7 MB. Free memory was 259.2 MB in the beginning and 251.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:44:56,510 INFO ]: BlockEncodingV2 took 99.18 ms. Allocated memory is still 306.7 MB. Free memory was 251.2 MB in the beginning and 248.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:44:56,511 INFO ]: TraceAbstraction took 57744.52 ms. Allocated memory was 306.7 MB in the beginning and 1.1 GB in the end (delta: 779.1 MB). Free memory was 248.2 MB in the beginning and 597.7 MB in the end (delta: -349.5 MB). Peak memory consumption was 429.6 MB. Max. memory is 3.6 GB. [2018-06-26 18:44:56,516 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.04 ms. Allocated memory is still 306.7 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.41 ms. Allocated memory is still 306.7 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 32.51 ms. Allocated memory is still 306.7 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 264.90 ms. Allocated memory is still 306.7 MB. Free memory was 259.2 MB in the beginning and 251.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 99.18 ms. Allocated memory is still 306.7 MB. Free memory was 251.2 MB in the beginning and 248.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57744.52 ms. Allocated memory was 306.7 MB in the beginning and 1.1 GB in the end (delta: 779.1 MB). Free memory was 248.2 MB in the beginning and 597.7 MB in the end (delta: -349.5 MB). Peak memory consumption was 429.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (44states) and interpolant automaton (currently 17 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 57.6s OverallTime, 41 OverallIterations, 38 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 204 SDtfs, 0 SDslu, 2341 SDs, 0 SdLazy, 21610 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1764 GetRequests, 904 SyntacticMatches, 36 SemanticMatches, 824 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 29.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 40 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 34.4s InterpolantComputationTime, 1885 NumberOfCodeBlocks, 1885 NumberOfCodeBlocksAsserted, 270 NumberOfCheckSat, 1805 ConstructedInterpolants, 0 QuantifiedInterpolants, 1354980 SizeOfPredicates, 194 NumberOfNonLiveVariables, 22993 ConjunctsInSsa, 13691 ConjunctsInUnsatCore, 80 InterpolantComputations, 3 PerfectInterpolantSequences, 2/19763 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/loop__barthe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-44-56-530.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-44-56-530.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-44-56-530.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-44-56-530.csv Completed graceful shutdown