java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/004-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:57:27,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:57:27,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:57:27,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:57:27,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:57:27,838 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:57:27,839 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:57:27,841 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:57:27,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:57:27,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:57:27,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:57:27,844 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:57:27,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:57:27,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:57:27,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:57:27,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:57:27,849 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:57:27,851 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:57:27,853 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:57:27,854 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:57:27,855 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:57:27,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:57:27,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:57:27,858 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:57:27,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:57:27,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:57:27,861 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:57:27,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:57:27,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:57:27,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:57:27,863 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:57:27,864 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:57:27,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:57:27,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:57:27,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:57:27,866 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:57:27,880 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:57:27,880 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:57:27,881 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:57:27,881 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:57:27,882 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:57:27,882 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:57:27,882 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:57:27,883 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:57:27,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:57:27,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:57:27,883 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:57:27,884 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:57:27,884 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:57:27,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:57:27,884 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:57:27,885 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:57:27,885 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:57:27,885 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:57:27,885 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:57:27,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:57:27,886 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:57:27,887 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:57:27,887 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:57:27,937 INFO ]: Repository-Root is: /tmp [2018-06-24 20:57:27,952 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:57:27,958 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:57:27,959 INFO ]: Initializing SmtParser... [2018-06-24 20:57:27,959 INFO ]: SmtParser initialized [2018-06-24 20:57:27,960 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/004-horn.smt2 [2018-06-24 20:57:27,961 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:57:28,052 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/004-horn.smt2 unknown [2018-06-24 20:57:28,240 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/004-horn.smt2 [2018-06-24 20:57:28,247 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:57:28,254 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:57:28,255 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:57:28,255 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:57:28,255 INFO ]: ChcToBoogie initialized [2018-06-24 20:57:28,258 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:57:28" (1/1) ... [2018-06-24 20:57:28,316 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:57:28 Unit [2018-06-24 20:57:28,316 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:57:28,317 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:57:28,317 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:57:28,317 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:57:28,341 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:57:28" (1/1) ... [2018-06-24 20:57:28,341 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:57:28" (1/1) ... [2018-06-24 20:57:28,346 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:57:28" (1/1) ... [2018-06-24 20:57:28,346 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:57:28" (1/1) ... [2018-06-24 20:57:28,349 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:57:28" (1/1) ... [2018-06-24 20:57:28,351 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:57:28" (1/1) ... [2018-06-24 20:57:28,351 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:57:28" (1/1) ... [2018-06-24 20:57:28,353 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:57:28,353 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:57:28,353 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:57:28,353 INFO ]: RCFGBuilder initialized [2018-06-24 20:57:28,355 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:57:28" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:57:28,373 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:57:28,373 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:57:28,373 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:57:28,373 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:57:28,373 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:57:28,373 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:57:28,630 INFO ]: Using library mode [2018-06-24 20:57:28,631 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:57:28 BoogieIcfgContainer [2018-06-24 20:57:28,631 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:57:28,632 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:57:28,632 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:57:28,633 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:57:28,634 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:57:28" (1/1) ... [2018-06-24 20:57:28,653 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-24 20:57:28,655 INFO ]: Using Remove infeasible edges [2018-06-24 20:57:28,655 INFO ]: Using Maximize final states [2018-06-24 20:57:28,656 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:57:28,656 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:57:28,658 INFO ]: Using Remove sink states [2018-06-24 20:57:28,659 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:57:28,659 INFO ]: Using Use SBE [2018-06-24 20:57:28,669 INFO ]: SBE split 0 edges [2018-06-24 20:57:28,674 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:57:28,675 INFO ]: 0 new accepting states [2018-06-24 20:57:28,720 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 20:57:28,722 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:57:28,726 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:57:28,726 INFO ]: 0 new accepting states [2018-06-24 20:57:28,727 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:57:28,727 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:57:28,727 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-24 20:57:28,728 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:57:28 BasicIcfg [2018-06-24 20:57:28,728 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:57:28,729 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:57:28,729 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:57:28,733 INFO ]: TraceAbstraction initialized [2018-06-24 20:57:28,733 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:57:28" (1/4) ... [2018-06-24 20:57:28,734 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8a05be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:57:28, skipping insertion in model container [2018-06-24 20:57:28,734 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:57:28" (2/4) ... [2018-06-24 20:57:28,734 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8a05be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:57:28, skipping insertion in model container [2018-06-24 20:57:28,735 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:57:28" (3/4) ... [2018-06-24 20:57:28,735 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8a05be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:57:28, skipping insertion in model container [2018-06-24 20:57:28,735 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:57:28" (4/4) ... [2018-06-24 20:57:28,736 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:57:28,747 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:57:28,755 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:57:28,792 INFO ]: Using default assertion order modulation [2018-06-24 20:57:28,792 INFO ]: Interprodecural is true [2018-06-24 20:57:28,792 INFO ]: Hoare is false [2018-06-24 20:57:28,792 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:57:28,792 INFO ]: Backedges is TWOTRACK [2018-06-24 20:57:28,792 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:57:28,792 INFO ]: Difference is false [2018-06-24 20:57:28,792 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:57:28,792 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:57:28,801 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 20:57:28,810 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:57:28,810 INFO ]: Found error trace [2018-06-24 20:57:28,811 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:57:28,811 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:28,819 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-24 20:57:28,821 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:28,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:28,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:28,851 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:28,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:28,898 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:28,975 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:28,976 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:57:28,976 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:57:28,978 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:57:28,990 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:57:28,990 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:57:28,994 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 20:57:29,082 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:29,082 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-24 20:57:29,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:57:29,084 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:57:29,084 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:29,091 INFO ]: With dead ends: 7 [2018-06-24 20:57:29,091 INFO ]: Without dead ends: 7 [2018-06-24 20:57:29,093 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:57:29,106 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 20:57:29,124 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 20:57:29,126 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 20:57:29,126 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-24 20:57:29,127 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-24 20:57:29,127 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:29,127 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-24 20:57:29,127 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:57:29,127 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-24 20:57:29,128 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:57:29,128 INFO ]: Found error trace [2018-06-24 20:57:29,128 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:57:29,129 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:29,129 INFO ]: Analyzing trace with hash 1156261132, now seen corresponding path program 1 times [2018-06-24 20:57:29,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:29,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:29,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:29,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:29,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:29,152 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:29,394 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:29,394 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:29,394 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:29,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:29,446 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:29,454 INFO ]: Computing forward predicates... [2018-06-24 20:57:29,509 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:29,529 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:29,529 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 20:57:29,530 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:57:29,530 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:57:29,530 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:57:29,530 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2018-06-24 20:57:29,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:29,697 INFO ]: Finished difference Result 8 states and 14 transitions. [2018-06-24 20:57:29,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:57:29,698 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 20:57:29,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:29,698 INFO ]: With dead ends: 8 [2018-06-24 20:57:29,698 INFO ]: Without dead ends: 8 [2018-06-24 20:57:29,699 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:57:29,699 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:57:29,700 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:57:29,701 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:57:29,701 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-24 20:57:29,701 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 6 [2018-06-24 20:57:29,701 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:29,701 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-24 20:57:29,701 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:57:29,701 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-24 20:57:29,702 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:57:29,702 INFO ]: Found error trace [2018-06-24 20:57:29,702 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:57:29,702 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:29,702 INFO ]: Analyzing trace with hash 1156290923, now seen corresponding path program 1 times [2018-06-24 20:57:29,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:29,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:29,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:29,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:29,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:29,714 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:29,784 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:29,784 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:57:29,784 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:57:29,785 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:57:29,785 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:57:29,785 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:57:29,785 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 3 states. [2018-06-24 20:57:29,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:29,891 INFO ]: Finished difference Result 9 states and 16 transitions. [2018-06-24 20:57:29,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:57:29,891 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 20:57:29,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:29,892 INFO ]: With dead ends: 9 [2018-06-24 20:57:29,892 INFO ]: Without dead ends: 8 [2018-06-24 20:57:29,892 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:57:29,892 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:57:29,893 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:57:29,893 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:57:29,893 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-24 20:57:29,893 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 6 [2018-06-24 20:57:29,893 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:29,893 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-24 20:57:29,894 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:57:29,894 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-24 20:57:29,894 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:57:29,894 INFO ]: Found error trace [2018-06-24 20:57:29,894 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:57:29,894 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:29,894 INFO ]: Analyzing trace with hash 1156320714, now seen corresponding path program 1 times [2018-06-24 20:57:29,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:29,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:29,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:29,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:29,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:29,907 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:29,968 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:29,969 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:29,969 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:29,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:30,002 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:30,003 INFO ]: Computing forward predicates... [2018-06-24 20:57:30,039 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:30,059 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:30,059 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 20:57:30,059 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:57:30,059 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:57:30,059 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:57:30,060 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 5 states. [2018-06-24 20:57:30,091 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:30,091 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-24 20:57:30,092 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:57:30,092 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 20:57:30,092 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:30,092 INFO ]: With dead ends: 10 [2018-06-24 20:57:30,092 INFO ]: Without dead ends: 10 [2018-06-24 20:57:30,093 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:57:30,093 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:57:30,094 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:57:30,094 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:57:30,094 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-24 20:57:30,095 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 6 [2018-06-24 20:57:30,095 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:30,095 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-24 20:57:30,095 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:57:30,095 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-24 20:57:30,095 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:57:30,095 INFO ]: Found error trace [2018-06-24 20:57:30,095 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 20:57:30,095 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:30,095 INFO ]: Analyzing trace with hash 1483971524, now seen corresponding path program 2 times [2018-06-24 20:57:30,095 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:30,095 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:30,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:30,096 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:30,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:30,111 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:30,163 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:30,163 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:30,164 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:30,170 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:57:30,216 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:57:30,216 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:30,218 INFO ]: Computing forward predicates... [2018-06-24 20:57:30,439 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:30,459 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:57:30,459 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-06-24 20:57:30,460 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:57:30,460 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:57:30,460 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:57:30,460 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 7 states. [2018-06-24 20:57:30,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:30,538 INFO ]: Finished difference Result 12 states and 18 transitions. [2018-06-24 20:57:30,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:57:30,538 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 20:57:30,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:30,538 INFO ]: With dead ends: 12 [2018-06-24 20:57:30,538 INFO ]: Without dead ends: 8 [2018-06-24 20:57:30,539 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:57:30,539 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:57:30,540 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:57:30,540 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:57:30,540 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-24 20:57:30,540 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2018-06-24 20:57:30,540 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:30,540 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-24 20:57:30,540 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:57:30,540 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-24 20:57:30,540 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:57:30,540 INFO ]: Found error trace [2018-06-24 20:57:30,540 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:30,541 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:30,541 INFO ]: Analyzing trace with hash 1484031106, now seen corresponding path program 1 times [2018-06-24 20:57:30,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:30,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:30,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:30,541 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:30,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:30,554 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:30,639 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:30,639 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:30,639 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:30,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:30,676 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:30,678 INFO ]: Computing forward predicates... [2018-06-24 20:57:30,704 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:30,725 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:30,725 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:57:30,725 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:57:30,725 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:57:30,725 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:57:30,725 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2018-06-24 20:57:30,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:30,803 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-24 20:57:30,805 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:57:30,805 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:57:30,805 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:30,806 INFO ]: With dead ends: 9 [2018-06-24 20:57:30,806 INFO ]: Without dead ends: 9 [2018-06-24 20:57:30,806 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:57:30,806 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:57:30,807 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:57:30,807 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:57:30,807 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-24 20:57:30,807 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-24 20:57:30,807 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:30,807 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-24 20:57:30,807 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:57:30,808 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-24 20:57:30,808 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:57:30,808 INFO ]: Found error trace [2018-06-24 20:57:30,808 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:30,808 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:30,808 INFO ]: Analyzing trace with hash -1240001588, now seen corresponding path program 2 times [2018-06-24 20:57:30,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:30,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:30,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:30,809 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:30,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:30,826 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:31,041 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:31,041 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:31,041 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:31,053 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:57:31,096 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:57:31,096 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:31,098 INFO ]: Computing forward predicates... [2018-06-24 20:57:31,283 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:31,314 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:31,315 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:57:31,315 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:57:31,315 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:57:31,315 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:57:31,315 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-06-24 20:57:31,443 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:31,443 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-24 20:57:31,444 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:57:31,444 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:57:31,444 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:31,444 INFO ]: With dead ends: 10 [2018-06-24 20:57:31,444 INFO ]: Without dead ends: 10 [2018-06-24 20:57:31,444 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:57:31,444 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:57:31,445 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:57:31,446 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:57:31,446 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-24 20:57:31,446 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-24 20:57:31,446 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:31,446 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-24 20:57:31,446 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:57:31,446 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-24 20:57:31,446 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:57:31,446 INFO ]: Found error trace [2018-06-24 20:57:31,446 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:31,446 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:31,447 INFO ]: Analyzing trace with hash 214330818, now seen corresponding path program 3 times [2018-06-24 20:57:31,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:31,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:31,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:31,447 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:31,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:31,465 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:32,003 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:32,003 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:32,003 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) [2018-06-24 20:57:32,018 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:32,073 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:57:32,073 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:32,076 INFO ]: Computing forward predicates... [2018-06-24 20:57:32,107 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:32,131 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:32,131 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:57:32,132 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:57:32,132 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:57:32,132 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:57:32,132 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-24 20:57:32,172 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:32,172 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-24 20:57:32,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:57:32,172 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 20:57:32,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:32,173 INFO ]: With dead ends: 11 [2018-06-24 20:57:32,173 INFO ]: Without dead ends: 11 [2018-06-24 20:57:32,173 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:57:32,173 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:57:32,174 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:57:32,174 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:57:32,174 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-24 20:57:32,174 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-24 20:57:32,175 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:32,175 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-24 20:57:32,175 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:57:32,175 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-24 20:57:32,175 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:57:32,175 INFO ]: Found error trace [2018-06-24 20:57:32,175 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:32,175 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:32,175 INFO ]: Analyzing trace with hash -1946004852, now seen corresponding path program 4 times [2018-06-24 20:57:32,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:32,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:32,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:32,176 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:32,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:32,216 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:32,357 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:32,358 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:32,358 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:32,371 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:57:32,399 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:57:32,399 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:32,402 INFO ]: Computing forward predicates... [2018-06-24 20:57:32,428 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:32,452 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:32,452 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 20:57:32,452 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:57:32,453 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:57:32,453 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:57:32,453 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-24 20:57:32,519 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:32,519 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-24 20:57:32,519 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:57:32,519 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 20:57:32,519 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:32,520 INFO ]: With dead ends: 12 [2018-06-24 20:57:32,520 INFO ]: Without dead ends: 12 [2018-06-24 20:57:32,520 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:57:32,520 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:57:32,521 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:57:32,521 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:57:32,521 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-24 20:57:32,521 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-24 20:57:32,521 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:32,521 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-24 20:57:32,521 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:57:32,521 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-24 20:57:32,521 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:57:32,521 INFO ]: Found error trace [2018-06-24 20:57:32,521 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:32,522 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:32,522 INFO ]: Analyzing trace with hash -196933886, now seen corresponding path program 5 times [2018-06-24 20:57:32,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:32,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:32,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:32,522 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:32,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:32,540 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:32,720 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:32,721 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:32,721 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:32,730 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:57:32,801 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:57:32,801 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:32,805 INFO ]: Computing forward predicates... [2018-06-24 20:57:32,986 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:33,018 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:33,018 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:57:33,018 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:57:33,018 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:57:33,018 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:57:33,018 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-06-24 20:57:33,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:33,155 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-24 20:57:33,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:57:33,155 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 20:57:33,156 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:33,156 INFO ]: With dead ends: 13 [2018-06-24 20:57:33,156 INFO ]: Without dead ends: 13 [2018-06-24 20:57:33,156 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:57:33,156 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:57:33,157 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:57:33,157 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:57:33,158 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-24 20:57:33,158 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-24 20:57:33,158 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:33,158 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-24 20:57:33,158 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:57:33,158 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-24 20:57:33,158 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:57:33,158 INFO ]: Found error trace [2018-06-24 20:57:33,158 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:33,158 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:33,158 INFO ]: Analyzing trace with hash -1810308788, now seen corresponding path program 6 times [2018-06-24 20:57:33,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:33,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:33,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:33,159 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:33,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:33,180 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:34,033 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:34,033 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:34,033 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:34,046 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:57:34,095 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:57:34,095 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:34,098 INFO ]: Computing forward predicates... [2018-06-24 20:57:34,139 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:34,170 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:34,170 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 20:57:34,171 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:57:34,171 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:57:34,171 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:57:34,171 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-06-24 20:57:34,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:34,233 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-24 20:57:34,235 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:57:34,235 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-24 20:57:34,235 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:34,235 INFO ]: With dead ends: 14 [2018-06-24 20:57:34,235 INFO ]: Without dead ends: 14 [2018-06-24 20:57:34,235 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:57:34,235 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:57:34,236 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:57:34,237 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:57:34,237 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-24 20:57:34,237 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-24 20:57:34,237 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:34,237 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-24 20:57:34,237 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:57:34,237 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-24 20:57:34,237 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:57:34,237 INFO ]: Found error trace [2018-06-24 20:57:34,237 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:34,238 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:34,238 INFO ]: Analyzing trace with hash -285323198, now seen corresponding path program 7 times [2018-06-24 20:57:34,238 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:34,238 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:34,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:34,238 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:34,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:34,260 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:34,474 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:34,474 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:34,474 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:34,481 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:34,508 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:34,512 INFO ]: Computing forward predicates... [2018-06-24 20:57:34,533 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:34,564 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:34,569 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:57:34,569 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:57:34,569 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:57:34,569 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:57:34,570 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-06-24 20:57:34,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:34,683 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-24 20:57:34,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:57:34,683 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 20:57:34,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:34,683 INFO ]: With dead ends: 15 [2018-06-24 20:57:34,683 INFO ]: Without dead ends: 15 [2018-06-24 20:57:34,684 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:57:34,684 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:57:34,685 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:57:34,685 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:57:34,685 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-24 20:57:34,685 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-24 20:57:34,686 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:34,686 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-24 20:57:34,686 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:57:34,686 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-24 20:57:34,686 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:57:34,686 INFO ]: Found error trace [2018-06-24 20:57:34,686 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:34,686 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:34,686 INFO ]: Analyzing trace with hash -255410164, now seen corresponding path program 8 times [2018-06-24 20:57:34,686 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:34,686 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:34,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:34,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:34,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:34,703 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:35,045 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:35,045 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:35,045 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:35,051 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:57:35,095 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:57:35,095 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:35,102 INFO ]: Computing forward predicates... [2018-06-24 20:57:35,169 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:35,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:35,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 20:57:35,194 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:57:35,194 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:57:35,195 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:57:35,195 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-06-24 20:57:35,328 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:35,328 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-24 20:57:35,329 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:57:35,329 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-24 20:57:35,329 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:35,329 INFO ]: With dead ends: 16 [2018-06-24 20:57:35,329 INFO ]: Without dead ends: 16 [2018-06-24 20:57:35,329 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:57:35,330 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:57:35,331 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:57:35,331 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:57:35,331 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-24 20:57:35,331 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-24 20:57:35,331 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:35,331 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-24 20:57:35,331 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:57:35,331 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-24 20:57:35,332 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:57:35,332 INFO ]: Found error trace [2018-06-24 20:57:35,332 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:35,332 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:35,332 INFO ]: Analyzing trace with hash 671893890, now seen corresponding path program 9 times [2018-06-24 20:57:35,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:35,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:35,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:35,332 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:35,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:35,349 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:35,641 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:35,641 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:35,641 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:35,648 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:57:35,692 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:57:35,692 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:35,697 INFO ]: Computing forward predicates... [2018-06-24 20:57:35,717 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:35,742 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:35,742 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 20:57:35,742 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:57:35,742 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:57:35,742 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:57:35,742 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-06-24 20:57:35,902 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:35,902 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-24 20:57:35,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:57:35,902 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-24 20:57:35,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:35,902 INFO ]: With dead ends: 17 [2018-06-24 20:57:35,902 INFO ]: Without dead ends: 17 [2018-06-24 20:57:35,903 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:57:35,903 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:57:35,904 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:57:35,904 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:57:35,904 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-24 20:57:35,904 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-24 20:57:35,905 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:35,905 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-24 20:57:35,905 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:57:35,905 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-24 20:57:35,905 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:57:35,905 INFO ]: Found error trace [2018-06-24 20:57:35,905 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:35,905 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:35,905 INFO ]: Analyzing trace with hash -646451508, now seen corresponding path program 10 times [2018-06-24 20:57:35,905 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:35,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:35,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:35,906 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:35,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:35,922 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:36,197 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:36,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:36,197 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:36,205 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:57:36,248 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:57:36,248 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:36,252 INFO ]: Computing forward predicates... [2018-06-24 20:57:36,292 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:36,321 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:36,321 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-24 20:57:36,321 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:57:36,321 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:57:36,321 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:57:36,321 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2018-06-24 20:57:36,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:36,446 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-24 20:57:36,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:57:36,446 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-24 20:57:36,446 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:36,446 INFO ]: With dead ends: 18 [2018-06-24 20:57:36,446 INFO ]: Without dead ends: 18 [2018-06-24 20:57:36,447 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:57:36,447 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:57:36,448 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:57:36,448 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:57:36,448 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-24 20:57:36,449 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-24 20:57:36,449 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:36,449 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-24 20:57:36,449 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:57:36,449 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-24 20:57:36,449 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:57:36,449 INFO ]: Found error trace [2018-06-24 20:57:36,449 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:36,449 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:36,449 INFO ]: Analyzing trace with hash 1434514114, now seen corresponding path program 11 times [2018-06-24 20:57:36,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:36,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:36,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:36,450 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:36,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:36,475 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:36,789 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:36,789 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:36,789 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:36,795 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:57:36,890 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:57:36,890 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:36,895 INFO ]: Computing forward predicates... [2018-06-24 20:57:36,975 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:36,997 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:36,997 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 20:57:36,998 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:57:36,998 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:57:36,998 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:57:36,998 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2018-06-24 20:57:37,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:37,123 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-24 20:57:37,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:57:37,123 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-24 20:57:37,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:37,123 INFO ]: With dead ends: 19 [2018-06-24 20:57:37,123 INFO ]: Without dead ends: 19 [2018-06-24 20:57:37,124 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:57:37,124 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:57:37,125 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:57:37,125 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:57:37,126 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-24 20:57:37,126 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-24 20:57:37,126 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:37,126 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-24 20:57:37,126 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:57:37,126 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-24 20:57:37,126 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:57:37,126 INFO ]: Found error trace [2018-06-24 20:57:37,126 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:37,126 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:37,126 INFO ]: Analyzing trace with hash 1519938956, now seen corresponding path program 12 times [2018-06-24 20:57:37,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:37,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:37,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:37,127 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:37,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:37,148 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:37,468 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:37,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:37,468 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:37,473 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:57:37,539 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 20:57:37,539 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:37,544 INFO ]: Computing forward predicates... [2018-06-24 20:57:37,572 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:37,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:37,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-24 20:57:37,603 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:57:37,603 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:57:37,603 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:57:37,603 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2018-06-24 20:57:37,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:37,890 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-24 20:57:37,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:57:37,891 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-24 20:57:37,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:37,892 INFO ]: With dead ends: 20 [2018-06-24 20:57:37,892 INFO ]: Without dead ends: 20 [2018-06-24 20:57:37,892 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:57:37,892 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:57:37,894 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:57:37,894 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:57:37,894 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-24 20:57:37,894 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-24 20:57:37,894 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:37,894 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-24 20:57:37,894 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:57:37,894 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-24 20:57:37,895 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:57:37,895 INFO ]: Found error trace [2018-06-24 20:57:37,895 INFO ]: trace histogram [13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:37,895 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:37,895 INFO ]: Analyzing trace with hash -126858238, now seen corresponding path program 13 times [2018-06-24 20:57:37,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:37,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:37,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:37,896 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:37,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:37,946 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:38,461 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:38,461 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:38,461 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:38,467 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:38,506 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:38,510 INFO ]: Computing forward predicates... [2018-06-24 20:57:38,531 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:38,562 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:38,562 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-24 20:57:38,562 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:57:38,562 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:57:38,562 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:57:38,563 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2018-06-24 20:57:39,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:39,054 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-24 20:57:39,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:57:39,054 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-24 20:57:39,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:39,054 INFO ]: With dead ends: 21 [2018-06-24 20:57:39,054 INFO ]: Without dead ends: 21 [2018-06-24 20:57:39,055 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:57:39,055 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:57:39,057 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 20:57:39,057 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:57:39,057 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-24 20:57:39,058 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-24 20:57:39,058 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:39,058 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-24 20:57:39,058 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:57:39,058 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-24 20:57:39,058 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:57:39,058 INFO ]: Found error trace [2018-06-24 20:57:39,058 INFO ]: trace histogram [14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:39,058 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:39,058 INFO ]: Analyzing trace with hash 362036300, now seen corresponding path program 14 times [2018-06-24 20:57:39,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:39,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:39,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:39,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:39,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:39,078 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:39,584 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:39,584 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:39,649 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:39,654 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:57:39,707 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:57:39,707 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:39,712 INFO ]: Computing forward predicates... [2018-06-24 20:57:39,758 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:39,777 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:39,777 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-24 20:57:39,777 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:57:39,777 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:57:39,777 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:57:39,777 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2018-06-24 20:57:39,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:39,938 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-24 20:57:39,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:57:39,939 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-24 20:57:39,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:39,940 INFO ]: With dead ends: 22 [2018-06-24 20:57:39,940 INFO ]: Without dead ends: 22 [2018-06-24 20:57:39,940 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:57:39,940 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:57:39,942 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 20:57:39,942 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:57:39,942 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-24 20:57:39,942 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-24 20:57:39,942 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:39,942 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-24 20:57:39,942 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:57:39,942 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-24 20:57:39,943 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:57:39,943 INFO ]: Found error trace [2018-06-24 20:57:39,943 INFO ]: trace histogram [15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:39,943 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:39,943 INFO ]: Analyzing trace with hash -1662102206, now seen corresponding path program 15 times [2018-06-24 20:57:39,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:39,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:39,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:39,944 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:39,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:39,968 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:40,441 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:40,441 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:40,441 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:40,448 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:57:40,498 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:57:40,498 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:40,503 INFO ]: Computing forward predicates... [2018-06-24 20:57:40,527 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:40,559 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:40,559 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-24 20:57:40,560 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:57:40,560 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:57:40,560 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:57:40,560 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2018-06-24 20:57:40,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:40,806 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-24 20:57:40,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:57:40,806 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-24 20:57:40,806 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:40,807 INFO ]: With dead ends: 23 [2018-06-24 20:57:40,807 INFO ]: Without dead ends: 23 [2018-06-24 20:57:40,807 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:57:40,807 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:57:40,808 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:57:40,809 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:57:40,809 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-24 20:57:40,809 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-24 20:57:40,809 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:40,809 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-24 20:57:40,809 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:57:40,809 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-24 20:57:40,810 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:57:40,810 INFO ]: Found error trace [2018-06-24 20:57:40,810 INFO ]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:40,810 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:40,810 INFO ]: Analyzing trace with hash 14113548, now seen corresponding path program 16 times [2018-06-24 20:57:40,810 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:40,810 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:40,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:40,810 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:40,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:40,836 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:41,326 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:41,326 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:41,326 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:41,332 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:57:41,376 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:57:41,376 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:41,381 INFO ]: Computing forward predicates... [2018-06-24 20:57:41,417 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:41,438 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:41,438 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-24 20:57:41,439 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:57:41,439 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:57:41,439 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:57:41,439 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2018-06-24 20:57:41,651 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:41,651 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-24 20:57:41,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:57:41,652 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-24 20:57:41,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:41,652 INFO ]: With dead ends: 24 [2018-06-24 20:57:41,652 INFO ]: Without dead ends: 24 [2018-06-24 20:57:41,653 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:57:41,653 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:57:41,654 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:57:41,654 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:57:41,654 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-24 20:57:41,654 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-24 20:57:41,654 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:41,654 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-24 20:57:41,655 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:57:41,655 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-24 20:57:41,655 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:57:41,655 INFO ]: Found error trace [2018-06-24 20:57:41,655 INFO ]: trace histogram [17, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:41,655 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:41,655 INFO ]: Analyzing trace with hash 437194370, now seen corresponding path program 17 times [2018-06-24 20:57:41,655 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:41,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:41,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:41,656 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:41,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:41,680 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:42,053 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:42,053 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:42,053 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:42,059 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:57:42,228 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 20:57:42,228 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:42,238 INFO ]: Computing forward predicates... [2018-06-24 20:57:42,402 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:42,435 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:42,435 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-24 20:57:42,435 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:57:42,436 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:57:42,436 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:57:42,436 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-06-24 20:57:42,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:42,738 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-24 20:57:42,739 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:57:42,739 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-24 20:57:42,739 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:42,739 INFO ]: With dead ends: 25 [2018-06-24 20:57:42,739 INFO ]: Without dead ends: 25 [2018-06-24 20:57:42,740 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:57:42,740 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:57:42,741 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 20:57:42,741 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:57:42,742 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-24 20:57:42,742 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-24 20:57:42,742 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:42,742 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-24 20:57:42,742 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:57:42,742 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-24 20:57:42,742 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:57:42,742 INFO ]: Found error trace [2018-06-24 20:57:42,742 INFO ]: trace histogram [18, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:42,742 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:42,742 INFO ]: Analyzing trace with hash 667797964, now seen corresponding path program 18 times [2018-06-24 20:57:42,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:42,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:42,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:42,744 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:42,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:42,769 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:43,135 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:43,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:43,135 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:43,141 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:57:43,207 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-24 20:57:43,207 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:43,213 INFO ]: Computing forward predicates... [2018-06-24 20:57:43,240 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:43,272 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:43,272 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-24 20:57:43,273 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:57:43,273 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:57:43,273 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:57:43,273 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2018-06-24 20:57:43,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:43,517 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-24 20:57:43,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:57:43,518 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-24 20:57:43,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:43,518 INFO ]: With dead ends: 26 [2018-06-24 20:57:43,518 INFO ]: Without dead ends: 26 [2018-06-24 20:57:43,518 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:57:43,518 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:57:43,520 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:57:43,520 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:57:43,520 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-24 20:57:43,520 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-24 20:57:43,520 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:43,520 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-24 20:57:43,520 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:57:43,520 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-24 20:57:43,520 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:57:43,520 INFO ]: Found error trace [2018-06-24 20:57:43,520 INFO ]: trace histogram [19, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:43,520 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:43,520 INFO ]: Analyzing trace with hash -773425214, now seen corresponding path program 19 times [2018-06-24 20:57:43,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:43,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:43,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:43,521 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:43,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:43,553 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:43,968 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:43,968 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:43,968 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:43,974 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:44,035 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:44,042 INFO ]: Computing forward predicates... [2018-06-24 20:57:44,070 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:44,102 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:44,102 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-24 20:57:44,102 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:57:44,102 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:57:44,103 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:57:44,103 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-06-24 20:57:44,367 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:44,367 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-24 20:57:44,369 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:57:44,369 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-24 20:57:44,369 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:44,369 INFO ]: With dead ends: 27 [2018-06-24 20:57:44,369 INFO ]: Without dead ends: 27 [2018-06-24 20:57:44,370 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:57:44,370 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:57:44,371 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 20:57:44,371 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:57:44,372 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-24 20:57:44,372 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-24 20:57:44,372 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:44,372 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-24 20:57:44,372 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:57:44,372 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-24 20:57:44,372 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:57:44,372 INFO ]: Found error trace [2018-06-24 20:57:44,372 INFO ]: trace histogram [20, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:44,372 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:44,372 INFO ]: Analyzing trace with hash 1793296524, now seen corresponding path program 20 times [2018-06-24 20:57:44,372 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:44,372 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:44,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:44,373 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:44,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:44,421 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:45,498 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:45,499 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:45,571 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:45,589 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:57:45,644 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:57:45,644 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:45,649 INFO ]: Computing forward predicates... [2018-06-24 20:57:45,668 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:45,687 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:45,687 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-24 20:57:45,688 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:57:45,688 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:57:45,688 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:57:45,688 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-06-24 20:57:46,060 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:46,060 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-24 20:57:46,061 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:57:46,061 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-24 20:57:46,061 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:46,061 INFO ]: With dead ends: 28 [2018-06-24 20:57:46,061 INFO ]: Without dead ends: 28 [2018-06-24 20:57:46,062 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:57:46,062 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:57:46,063 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 20:57:46,063 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:57:46,064 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-24 20:57:46,064 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-24 20:57:46,064 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:46,064 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-24 20:57:46,064 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:57:46,064 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-24 20:57:46,064 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:57:46,064 INFO ]: Found error trace [2018-06-24 20:57:46,064 INFO ]: trace histogram [21, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:46,064 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:46,065 INFO ]: Analyzing trace with hash -242708222, now seen corresponding path program 21 times [2018-06-24 20:57:46,065 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:46,065 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:46,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:46,066 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:46,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:46,126 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:46,569 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:46,569 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:46,569 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:46,576 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:57:46,651 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-24 20:57:46,651 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:46,657 INFO ]: Computing forward predicates... [2018-06-24 20:57:46,695 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:46,715 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:46,715 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-24 20:57:46,715 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:57:46,715 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:57:46,715 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:57:46,715 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2018-06-24 20:57:47,377 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:47,377 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-24 20:57:47,377 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:57:47,377 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-24 20:57:47,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:47,377 INFO ]: With dead ends: 29 [2018-06-24 20:57:47,377 INFO ]: Without dead ends: 29 [2018-06-24 20:57:47,378 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:57:47,378 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:57:47,380 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:57:47,380 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:57:47,380 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-24 20:57:47,380 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-24 20:57:47,380 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:47,380 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-24 20:57:47,380 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:57:47,380 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-24 20:57:47,381 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:57:47,381 INFO ]: Found error trace [2018-06-24 20:57:47,381 INFO ]: trace histogram [22, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:47,381 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:47,381 INFO ]: Analyzing trace with hash 1065654092, now seen corresponding path program 22 times [2018-06-24 20:57:47,381 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:47,381 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:47,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:47,381 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:47,382 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:47,450 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:48,467 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:48,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:48,467 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:48,473 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:57:48,556 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:57:48,556 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:48,567 INFO ]: Computing forward predicates... [2018-06-24 20:57:48,621 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:48,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:48,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-24 20:57:48,642 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:57:48,643 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:57:48,643 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:57:48,643 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-06-24 20:57:48,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:48,994 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-24 20:57:48,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:57:48,995 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-24 20:57:48,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:48,995 INFO ]: With dead ends: 30 [2018-06-24 20:57:48,995 INFO ]: Without dead ends: 30 [2018-06-24 20:57:48,995 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:57:48,995 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:57:48,997 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 20:57:48,997 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:57:48,997 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-24 20:57:48,997 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-24 20:57:48,997 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:48,997 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-24 20:57:48,997 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:57:48,997 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-24 20:57:48,998 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:57:48,998 INFO ]: Found error trace [2018-06-24 20:57:48,998 INFO ]: trace histogram [23, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:48,998 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:48,998 INFO ]: Analyzing trace with hash -1324787134, now seen corresponding path program 23 times [2018-06-24 20:57:48,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:48,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:48,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:48,998 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:48,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:49,078 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:49,691 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:49,691 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:49,691 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:49,698 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:57:49,776 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-24 20:57:49,776 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:49,783 INFO ]: Computing forward predicates... [2018-06-24 20:57:49,815 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:49,836 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:49,836 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-24 20:57:49,836 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:57:49,837 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:57:49,837 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:57:49,837 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2018-06-24 20:57:50,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:50,171 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-24 20:57:50,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:57:50,172 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-24 20:57:50,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:50,173 INFO ]: With dead ends: 31 [2018-06-24 20:57:50,173 INFO ]: Without dead ends: 31 [2018-06-24 20:57:50,173 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:57:50,173 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:57:50,175 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 20:57:50,175 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:57:50,175 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-24 20:57:50,175 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-24 20:57:50,175 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:50,175 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-24 20:57:50,175 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:57:50,175 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-24 20:57:50,175 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:57:50,176 INFO ]: Found error trace [2018-06-24 20:57:50,176 INFO ]: trace histogram [24, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:50,176 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:50,176 INFO ]: Analyzing trace with hash 1880946188, now seen corresponding path program 24 times [2018-06-24 20:57:50,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:50,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:50,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:50,176 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:50,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:50,211 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:51,671 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:51,671 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:51,671 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:51,677 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:57:51,754 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-24 20:57:51,755 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:51,762 INFO ]: Computing forward predicates... [2018-06-24 20:57:51,817 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:51,847 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:51,847 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-24 20:57:51,847 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:57:51,847 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:57:51,847 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:57:51,847 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-06-24 20:57:52,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:52,282 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-24 20:57:52,284 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:57:52,284 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-24 20:57:52,284 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:52,284 INFO ]: With dead ends: 32 [2018-06-24 20:57:52,284 INFO ]: Without dead ends: 32 [2018-06-24 20:57:52,284 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:57:52,285 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:57:52,389 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:57:52,389 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:57:52,389 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-24 20:57:52,389 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-24 20:57:52,389 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:52,389 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-24 20:57:52,389 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:57:52,389 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-24 20:57:52,390 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:57:52,390 INFO ]: Found error trace [2018-06-24 20:57:52,390 INFO ]: trace histogram [25, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:52,390 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:52,390 INFO ]: Analyzing trace with hash -1820535934, now seen corresponding path program 25 times [2018-06-24 20:57:52,390 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:52,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:52,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:52,390 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:52,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:52,425 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:53,022 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:53,022 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:53,022 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:53,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:53,097 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:53,104 INFO ]: Computing forward predicates... [2018-06-24 20:57:53,153 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:53,186 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:53,186 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-24 20:57:53,186 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:57:53,186 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:57:53,187 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:57:53,187 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-24 20:57:53,595 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:53,595 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-24 20:57:53,597 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:57:53,597 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-24 20:57:53,597 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:53,597 INFO ]: With dead ends: 33 [2018-06-24 20:57:53,597 INFO ]: Without dead ends: 33 [2018-06-24 20:57:53,598 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:57:53,598 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:57:53,600 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:57:53,600 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:57:53,600 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-24 20:57:53,600 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-24 20:57:53,600 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:53,600 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-24 20:57:53,600 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:57:53,600 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-24 20:57:53,600 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:57:53,600 INFO ]: Found error trace [2018-06-24 20:57:53,600 INFO ]: trace histogram [26, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:53,601 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:53,601 INFO ]: Analyzing trace with hash -602364724, now seen corresponding path program 26 times [2018-06-24 20:57:53,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:53,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:53,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:53,601 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:53,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:53,640 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:54,246 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:54,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:54,247 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:54,252 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:57:54,322 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:57:54,322 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:54,330 INFO ]: Computing forward predicates... [2018-06-24 20:57:54,363 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:54,394 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:54,394 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-24 20:57:54,394 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:57:54,394 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:57:54,394 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:57:54,394 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2018-06-24 20:57:54,801 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:54,801 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-24 20:57:54,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:57:54,801 INFO ]: Start accepts. Automaton has 30 states. Word has length 32 [2018-06-24 20:57:54,802 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:54,802 INFO ]: With dead ends: 34 [2018-06-24 20:57:54,802 INFO ]: Without dead ends: 34 [2018-06-24 20:57:54,802 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:57:54,802 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:57:54,803 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:57:54,803 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:57:54,805 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-24 20:57:54,805 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-24 20:57:54,805 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:54,805 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-24 20:57:54,805 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:57:54,805 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-24 20:57:54,805 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:57:54,805 INFO ]: Found error trace [2018-06-24 20:57:54,805 INFO ]: trace histogram [27, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:54,805 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:54,806 INFO ]: Analyzing trace with hash -1493762878, now seen corresponding path program 27 times [2018-06-24 20:57:54,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:54,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:54,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:54,806 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:54,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:54,877 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:56,158 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:56,158 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:56,158 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:56,164 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:57:56,254 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-24 20:57:56,254 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:56,263 INFO ]: Computing forward predicates... [2018-06-24 20:57:56,295 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:56,314 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:56,314 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-24 20:57:56,314 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:57:56,315 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:57:56,315 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:57:56,315 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2018-06-24 20:57:56,734 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:56,734 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-24 20:57:56,790 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:57:56,790 INFO ]: Start accepts. Automaton has 31 states. Word has length 33 [2018-06-24 20:57:56,790 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:56,790 INFO ]: With dead ends: 35 [2018-06-24 20:57:56,790 INFO ]: Without dead ends: 35 [2018-06-24 20:57:56,791 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:57:56,791 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:57:56,792 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:57:56,792 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:57:56,793 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-24 20:57:56,793 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-24 20:57:56,793 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:56,793 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-24 20:57:56,793 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:57:56,793 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-24 20:57:56,793 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:57:56,793 INFO ]: Found error trace [2018-06-24 20:57:56,793 INFO ]: trace histogram [28, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:56,793 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:56,794 INFO ]: Analyzing trace with hash 937665420, now seen corresponding path program 28 times [2018-06-24 20:57:56,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:56,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:56,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:56,797 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:56,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:56,837 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:57,678 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:57,678 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:57,678 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:57,684 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:57:57,759 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:57:57,759 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:57,767 INFO ]: Computing forward predicates... [2018-06-24 20:57:57,792 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:57,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:57,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-24 20:57:57,825 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:57:57,825 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:57:57,825 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:57:57,825 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2018-06-24 20:57:58,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:58,348 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-24 20:57:58,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:57:58,349 INFO ]: Start accepts. Automaton has 32 states. Word has length 34 [2018-06-24 20:57:58,349 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:58,349 INFO ]: With dead ends: 36 [2018-06-24 20:57:58,349 INFO ]: Without dead ends: 36 [2018-06-24 20:57:58,349 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:57:58,349 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:57:58,351 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 20:57:58,351 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:57:58,351 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-24 20:57:58,351 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-24 20:57:58,351 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:58,351 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-24 20:57:58,351 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:57:58,351 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-24 20:57:58,351 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:57:58,351 INFO ]: Found error trace [2018-06-24 20:57:58,351 INFO ]: trace histogram [29, 1, 1, 1, 1, 1, 1] [2018-06-24 20:57:58,351 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:58,352 INFO ]: Analyzing trace with hash -997468670, now seen corresponding path program 29 times [2018-06-24 20:57:58,352 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:58,352 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:58,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:58,352 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:58,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:58,381 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:59,468 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:59,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:59,468 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:59,474 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:57:59,591 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-24 20:57:59,591 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:59,601 INFO ]: Computing forward predicates... [2018-06-24 20:57:59,661 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:59,691 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:59,692 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-24 20:57:59,692 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:57:59,692 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:57:59,692 INFO ]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:57:59,692 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2018-06-24 20:58:00,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:00,162 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-24 20:58:00,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:58:00,162 INFO ]: Start accepts. Automaton has 33 states. Word has length 35 [2018-06-24 20:58:00,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:00,162 INFO ]: With dead ends: 37 [2018-06-24 20:58:00,162 INFO ]: Without dead ends: 37 [2018-06-24 20:58:00,162 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:58:00,163 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:58:00,164 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 20:58:00,164 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:58:00,164 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-24 20:58:00,164 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-24 20:58:00,165 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:00,165 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-24 20:58:00,165 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:58:00,165 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-24 20:58:00,165 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:58:00,165 INFO ]: Found error trace [2018-06-24 20:58:00,165 INFO ]: trace histogram [30, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:00,165 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:00,165 INFO ]: Analyzing trace with hash -857083316, now seen corresponding path program 30 times [2018-06-24 20:58:00,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:00,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:00,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:00,166 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:00,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:00,196 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:00,977 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:00,977 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:00,977 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:00,983 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:58:01,089 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-06-24 20:58:01,089 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:01,099 INFO ]: Computing forward predicates... [2018-06-24 20:58:01,128 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:01,149 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:01,149 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-24 20:58:01,149 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:58:01,149 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:58:01,149 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:58:01,149 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-06-24 20:58:01,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:01,689 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-24 20:58:01,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 20:58:01,689 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-24 20:58:01,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:01,689 INFO ]: With dead ends: 38 [2018-06-24 20:58:01,689 INFO ]: Without dead ends: 38 [2018-06-24 20:58:01,690 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:58:01,690 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:58:01,691 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 20:58:01,691 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:58:01,691 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-24 20:58:01,691 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-24 20:58:01,692 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:01,692 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-24 20:58:01,692 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:58:01,692 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-24 20:58:01,692 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:58:01,692 INFO ]: Found error trace [2018-06-24 20:58:01,692 INFO ]: trace histogram [31, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:01,692 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:01,692 INFO ]: Analyzing trace with hash -800104638, now seen corresponding path program 31 times [2018-06-24 20:58:01,692 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:01,692 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:01,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:01,693 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:01,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:01,742 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:02,653 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:02,653 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:02,653 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:02,658 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:02,738 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:02,747 INFO ]: Computing forward predicates... [2018-06-24 20:58:02,771 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:02,789 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:02,790 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-24 20:58:02,790 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:58:02,790 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:58:02,790 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:58:02,790 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2018-06-24 20:58:03,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:03,346 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-24 20:58:03,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:58:03,346 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-24 20:58:03,346 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:03,346 INFO ]: With dead ends: 39 [2018-06-24 20:58:03,346 INFO ]: Without dead ends: 39 [2018-06-24 20:58:03,346 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:58:03,346 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:58:03,348 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 20:58:03,348 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:58:03,348 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-24 20:58:03,348 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-24 20:58:03,348 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:03,348 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-24 20:58:03,348 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:58:03,348 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-24 20:58:03,348 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:58:03,348 INFO ]: Found error trace [2018-06-24 20:58:03,349 INFO ]: trace histogram [32, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:03,349 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:03,349 INFO ]: Analyzing trace with hash 966234380, now seen corresponding path program 32 times [2018-06-24 20:58:03,349 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:03,349 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:03,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:03,349 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:03,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:03,388 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:04,301 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:04,301 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:04,301 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:04,309 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:58:04,392 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:58:04,392 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:04,401 INFO ]: Computing forward predicates... [2018-06-24 20:58:04,460 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:04,479 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:04,479 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-24 20:58:04,479 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:58:04,479 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:58:04,479 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:58:04,480 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2018-06-24 20:58:05,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:05,044 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-24 20:58:05,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 20:58:05,044 INFO ]: Start accepts. Automaton has 36 states. Word has length 38 [2018-06-24 20:58:05,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:05,045 INFO ]: With dead ends: 40 [2018-06-24 20:58:05,045 INFO ]: Without dead ends: 40 [2018-06-24 20:58:05,045 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:58:05,045 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:58:05,046 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 20:58:05,046 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:58:05,046 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-24 20:58:05,046 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-24 20:58:05,046 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:05,046 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-24 20:58:05,046 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:58:05,047 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-24 20:58:05,047 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:58:05,047 INFO ]: Found error trace [2018-06-24 20:58:05,047 INFO ]: trace histogram [33, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:05,047 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:05,047 INFO ]: Analyzing trace with hash -111830910, now seen corresponding path program 33 times [2018-06-24 20:58:05,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:05,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:05,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:05,047 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:05,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:05,134 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:06,535 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:06,536 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:06,536 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:06,542 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:58:06,671 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-24 20:58:06,672 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:06,681 INFO ]: Computing forward predicates... [2018-06-24 20:58:06,711 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:06,731 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:06,732 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-06-24 20:58:06,732 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:58:06,732 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:58:06,732 INFO ]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:58:06,732 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2018-06-24 20:58:07,385 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:07,385 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-24 20:58:07,386 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:58:07,386 INFO ]: Start accepts. Automaton has 37 states. Word has length 39 [2018-06-24 20:58:07,386 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:07,386 INFO ]: With dead ends: 41 [2018-06-24 20:58:07,386 INFO ]: Without dead ends: 41 [2018-06-24 20:58:07,386 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:58:07,386 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:58:07,387 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 20:58:07,387 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:58:07,388 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-24 20:58:07,388 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-24 20:58:07,388 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:07,388 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-24 20:58:07,388 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:58:07,388 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-24 20:58:07,388 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:58:07,388 INFO ]: Found error trace [2018-06-24 20:58:07,388 INFO ]: trace histogram [34, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:07,388 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:07,388 INFO ]: Analyzing trace with hash 827883468, now seen corresponding path program 34 times [2018-06-24 20:58:07,388 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:07,388 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:07,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:07,388 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:07,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:07,436 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:08,966 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:08,966 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:08,966 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:08,972 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:58:09,077 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:58:09,077 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:09,090 INFO ]: Computing forward predicates... [2018-06-24 20:58:09,281 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:09,310 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:09,310 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-06-24 20:58:09,311 INFO ]: Interpolant automaton has 38 states [2018-06-24 20:58:09,311 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 20:58:09,311 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:58:09,311 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 38 states. [2018-06-24 20:58:10,643 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:10,643 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-24 20:58:10,643 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 20:58:10,643 INFO ]: Start accepts. Automaton has 38 states. Word has length 40 [2018-06-24 20:58:10,643 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:10,644 INFO ]: With dead ends: 42 [2018-06-24 20:58:10,644 INFO ]: Without dead ends: 42 [2018-06-24 20:58:10,644 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:58:10,644 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 20:58:10,645 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-24 20:58:10,645 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 20:58:10,645 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-24 20:58:10,645 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-24 20:58:10,645 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:10,645 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-24 20:58:10,645 INFO ]: Interpolant automaton has 38 states. [2018-06-24 20:58:10,645 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-24 20:58:10,646 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 20:58:10,646 INFO ]: Found error trace [2018-06-24 20:58:10,646 INFO ]: trace histogram [35, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:10,646 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:10,646 INFO ]: Analyzing trace with hash -105741886, now seen corresponding path program 35 times [2018-06-24 20:58:10,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:10,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:10,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:10,646 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:10,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:10,698 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:11,687 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:11,687 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:11,687 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:11,692 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:58:11,824 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-06-24 20:58:11,825 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:11,838 INFO ]: Computing forward predicates... [2018-06-24 20:58:11,928 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:11,948 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:11,948 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-06-24 20:58:11,948 INFO ]: Interpolant automaton has 39 states [2018-06-24 20:58:11,948 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 20:58:11,949 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:58:11,949 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. [2018-06-24 20:58:12,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:12,636 INFO ]: Finished difference Result 43 states and 43 transitions. [2018-06-24 20:58:12,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:58:12,637 INFO ]: Start accepts. Automaton has 39 states. Word has length 41 [2018-06-24 20:58:12,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:12,637 INFO ]: With dead ends: 43 [2018-06-24 20:58:12,637 INFO ]: Without dead ends: 43 [2018-06-24 20:58:12,637 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:58:12,637 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:58:12,638 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-24 20:58:12,638 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 20:58:12,638 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-06-24 20:58:12,638 INFO ]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-06-24 20:58:12,638 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:12,638 INFO ]: Abstraction has 43 states and 43 transitions. [2018-06-24 20:58:12,638 INFO ]: Interpolant automaton has 39 states. [2018-06-24 20:58:12,639 INFO ]: Start isEmpty. Operand 43 states and 43 transitions. [2018-06-24 20:58:12,639 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-24 20:58:12,639 INFO ]: Found error trace [2018-06-24 20:58:12,639 INFO ]: trace histogram [36, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:12,639 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:12,639 INFO ]: Analyzing trace with hash 1016643212, now seen corresponding path program 36 times [2018-06-24 20:58:12,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:12,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:12,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:12,640 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:12,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:12,701 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:13,709 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:13,709 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:13,709 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:13,717 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:58:13,847 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-06-24 20:58:13,847 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:13,858 INFO ]: Computing forward predicates... [2018-06-24 20:58:13,973 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:14,005 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:14,005 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-06-24 20:58:14,005 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:58:14,005 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:58:14,006 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:58:14,006 INFO ]: Start difference. First operand 43 states and 43 transitions. Second operand 40 states. [2018-06-24 20:58:14,972 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:14,972 INFO ]: Finished difference Result 44 states and 44 transitions. [2018-06-24 20:58:14,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-24 20:58:14,972 INFO ]: Start accepts. Automaton has 40 states. Word has length 42 [2018-06-24 20:58:14,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:14,973 INFO ]: With dead ends: 44 [2018-06-24 20:58:14,973 INFO ]: Without dead ends: 44 [2018-06-24 20:58:14,973 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:58:14,973 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 20:58:14,974 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-24 20:58:14,975 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 20:58:14,975 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-06-24 20:58:14,975 INFO ]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-06-24 20:58:14,975 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:14,975 INFO ]: Abstraction has 44 states and 44 transitions. [2018-06-24 20:58:14,975 INFO ]: Interpolant automaton has 40 states. [2018-06-24 20:58:14,975 INFO ]: Start isEmpty. Operand 44 states and 44 transitions. [2018-06-24 20:58:14,975 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-24 20:58:14,975 INFO ]: Found error trace [2018-06-24 20:58:14,975 INFO ]: trace histogram [37, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:14,976 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:14,976 INFO ]: Analyzing trace with hash 1450842882, now seen corresponding path program 37 times [2018-06-24 20:58:14,976 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:14,976 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:14,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:14,976 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:14,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:15,017 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:16,080 INFO ]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:16,080 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:16,080 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:16,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:16,183 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:16,194 INFO ]: Computing forward predicates... [2018-06-24 20:58:16,236 INFO ]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:16,267 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:16,267 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-06-24 20:58:16,268 INFO ]: Interpolant automaton has 41 states [2018-06-24 20:58:16,268 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-24 20:58:16,268 INFO ]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:58:16,268 INFO ]: Start difference. First operand 44 states and 44 transitions. Second operand 41 states. [2018-06-24 20:58:17,651 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:17,651 INFO ]: Finished difference Result 45 states and 45 transitions. [2018-06-24 20:58:17,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-24 20:58:17,690 INFO ]: Start accepts. Automaton has 41 states. Word has length 43 [2018-06-24 20:58:17,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:17,690 INFO ]: With dead ends: 45 [2018-06-24 20:58:17,690 INFO ]: Without dead ends: 45 [2018-06-24 20:58:17,691 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:58:17,691 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 20:58:17,692 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-24 20:58:17,692 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 20:58:17,692 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-06-24 20:58:17,692 INFO ]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-06-24 20:58:17,692 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:17,692 INFO ]: Abstraction has 45 states and 45 transitions. [2018-06-24 20:58:17,692 INFO ]: Interpolant automaton has 41 states. [2018-06-24 20:58:17,692 INFO ]: Start isEmpty. Operand 45 states and 45 transitions. [2018-06-24 20:58:17,693 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-24 20:58:17,693 INFO ]: Found error trace [2018-06-24 20:58:17,693 INFO ]: trace histogram [38, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:17,693 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:17,693 INFO ]: Analyzing trace with hash 2026130764, now seen corresponding path program 38 times [2018-06-24 20:58:17,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:17,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:17,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:17,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:17,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:17,856 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:19,045 INFO ]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:19,045 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:19,045 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:19,051 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:58:19,149 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:58:19,149 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:19,159 INFO ]: Computing forward predicates... [2018-06-24 20:58:19,201 INFO ]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:19,225 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:19,225 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-06-24 20:58:19,226 INFO ]: Interpolant automaton has 42 states [2018-06-24 20:58:19,226 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-24 20:58:19,226 INFO ]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:58:19,226 INFO ]: Start difference. First operand 45 states and 45 transitions. Second operand 42 states. [2018-06-24 20:58:20,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:20,015 INFO ]: Finished difference Result 46 states and 46 transitions. [2018-06-24 20:58:20,016 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-24 20:58:20,016 INFO ]: Start accepts. Automaton has 42 states. Word has length 44 [2018-06-24 20:58:20,016 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:20,016 INFO ]: With dead ends: 46 [2018-06-24 20:58:20,016 INFO ]: Without dead ends: 46 [2018-06-24 20:58:20,016 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:58:20,017 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:58:20,018 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-06-24 20:58:20,018 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-24 20:58:20,018 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-06-24 20:58:20,018 INFO ]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-06-24 20:58:20,019 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:20,019 INFO ]: Abstraction has 46 states and 46 transitions. [2018-06-24 20:58:20,019 INFO ]: Interpolant automaton has 42 states. [2018-06-24 20:58:20,019 INFO ]: Start isEmpty. Operand 46 states and 46 transitions. [2018-06-24 20:58:20,019 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-24 20:58:20,019 INFO ]: Found error trace [2018-06-24 20:58:20,019 INFO ]: trace histogram [39, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:20,019 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:20,019 INFO ]: Analyzing trace with hash -1614781374, now seen corresponding path program 39 times [2018-06-24 20:58:20,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:20,019 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:20,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:20,020 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:20,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:20,141 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:21,326 INFO ]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:21,326 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:21,326 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:21,333 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:58:21,489 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-06-24 20:58:21,489 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:21,506 INFO ]: Computing forward predicates... [2018-06-24 20:58:21,589 INFO ]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:21,621 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:21,621 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-06-24 20:58:21,622 INFO ]: Interpolant automaton has 43 states [2018-06-24 20:58:21,622 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-24 20:58:21,622 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:58:21,622 INFO ]: Start difference. First operand 46 states and 46 transitions. Second operand 43 states. [2018-06-24 20:58:23,223 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:23,223 INFO ]: Finished difference Result 47 states and 47 transitions. [2018-06-24 20:58:23,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-24 20:58:23,225 INFO ]: Start accepts. Automaton has 43 states. Word has length 45 [2018-06-24 20:58:23,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:23,225 INFO ]: With dead ends: 47 [2018-06-24 20:58:23,225 INFO ]: Without dead ends: 47 [2018-06-24 20:58:23,226 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:58:23,226 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 20:58:23,227 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-24 20:58:23,227 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 20:58:23,228 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-06-24 20:58:23,228 INFO ]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-06-24 20:58:23,228 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:23,228 INFO ]: Abstraction has 47 states and 47 transitions. [2018-06-24 20:58:23,228 INFO ]: Interpolant automaton has 43 states. [2018-06-24 20:58:23,228 INFO ]: Start isEmpty. Operand 47 states and 47 transitions. [2018-06-24 20:58:23,228 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 20:58:23,228 INFO ]: Found error trace [2018-06-24 20:58:23,228 INFO ]: trace histogram [40, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:23,228 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:23,228 INFO ]: Analyzing trace with hash 1481059340, now seen corresponding path program 40 times [2018-06-24 20:58:23,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:23,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:23,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:23,229 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:23,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:23,280 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:24,765 INFO ]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:24,765 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:24,765 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:24,770 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:58:24,887 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:58:24,887 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:24,899 INFO ]: Computing forward predicates... [2018-06-24 20:58:24,931 INFO ]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:24,951 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:24,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-06-24 20:58:24,951 INFO ]: Interpolant automaton has 44 states [2018-06-24 20:58:24,951 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-24 20:58:24,951 INFO ]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:58:24,951 INFO ]: Start difference. First operand 47 states and 47 transitions. Second operand 44 states. [2018-06-24 20:58:25,816 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:25,816 INFO ]: Finished difference Result 48 states and 48 transitions. [2018-06-24 20:58:25,816 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-24 20:58:25,816 INFO ]: Start accepts. Automaton has 44 states. Word has length 46 [2018-06-24 20:58:25,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:25,817 INFO ]: With dead ends: 48 [2018-06-24 20:58:25,817 INFO ]: Without dead ends: 48 [2018-06-24 20:58:25,817 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:58:25,817 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 20:58:25,818 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-24 20:58:25,818 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-24 20:58:25,819 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-06-24 20:58:25,819 INFO ]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-06-24 20:58:25,819 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:25,819 INFO ]: Abstraction has 48 states and 48 transitions. [2018-06-24 20:58:25,819 INFO ]: Interpolant automaton has 44 states. [2018-06-24 20:58:25,819 INFO ]: Start isEmpty. Operand 48 states and 48 transitions. [2018-06-24 20:58:25,819 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-24 20:58:25,819 INFO ]: Found error trace [2018-06-24 20:58:25,819 INFO ]: trace histogram [41, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:25,819 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:25,819 INFO ]: Analyzing trace with hash -1332126334, now seen corresponding path program 41 times [2018-06-24 20:58:25,819 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:25,819 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:25,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:25,820 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:25,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:25,891 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:27,441 INFO ]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:27,441 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:27,441 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:27,449 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Received shutdown request... [2018-06-24 20:58:27,619 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-06-24 20:58:27,619 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:27,636 INFO ]: Computing forward predicates... [2018-06-24 20:58:27,637 INFO ]: Timeout while computing interpolants [2018-06-24 20:58:27,837 WARN ]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:27,837 WARN ]: Verification canceled [2018-06-24 20:58:27,840 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:58:27,841 WARN ]: Timeout [2018-06-24 20:58:27,841 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:58:27 BasicIcfg [2018-06-24 20:58:27,841 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:58:27,842 INFO ]: Toolchain (without parser) took 59594.12 ms. Allocated memory was 308.8 MB in the beginning and 946.9 MB in the end (delta: 638.1 MB). Free memory was 265.2 MB in the beginning and 513.1 MB in the end (delta: -247.9 MB). Peak memory consumption was 390.2 MB. Max. memory is 3.6 GB. [2018-06-24 20:58:27,843 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:58:27,844 INFO ]: ChcToBoogie took 61.93 ms. Allocated memory is still 308.8 MB. Free memory was 265.2 MB in the beginning and 263.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:58:27,844 INFO ]: Boogie Preprocessor took 35.87 ms. Allocated memory is still 308.8 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-24 20:58:27,844 INFO ]: RCFGBuilder took 277.81 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 253.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:58:27,845 INFO ]: BlockEncodingV2 took 96.35 ms. Allocated memory is still 308.8 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:58:27,845 INFO ]: TraceAbstraction took 59111.60 ms. Allocated memory was 308.8 MB in the beginning and 946.9 MB in the end (delta: 638.1 MB). Free memory was 249.2 MB in the beginning and 513.1 MB in the end (delta: -263.8 MB). Peak memory consumption was 374.2 MB. Max. memory is 3.6 GB. [2018-06-24 20:58:27,852 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.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.93 ms. Allocated memory is still 308.8 MB. Free memory was 265.2 MB in the beginning and 263.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 35.87 ms. Allocated memory is still 308.8 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. * RCFGBuilder took 277.81 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 253.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 96.35 ms. Allocated memory is still 308.8 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59111.60 ms. Allocated memory was 308.8 MB in the beginning and 946.9 MB in the end (delta: 638.1 MB). Free memory was 249.2 MB in the beginning and 513.1 MB in the end (delta: -263.8 MB). Peak memory consumption was 374.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 41, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 3 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 59.0s OverallTime, 46 OverallIterations, 41 TraceHistogramMax, 18.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 227 SDtfs, 1 SDslu, 2730 SDs, 0 SdLazy, 27453 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2035 GetRequests, 1041 SyntacticMatches, 80 SemanticMatches, 914 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 27.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 45 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 31.6s InterpolantComputationTime, 2169 NumberOfCodeBlocks, 2169 NumberOfCodeBlocksAsserted, 305 NumberOfCheckSat, 2081 ConstructedInterpolants, 0 QuantifiedInterpolants, 1329011 SizeOfPredicates, 171 NumberOfNonLiveVariables, 22671 ConjunctsInSsa, 13927 ConjunctsInUnsatCore, 88 InterpolantComputations, 3 PerfectInterpolantSequences, 6/24691 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/004-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-58-27-870.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/004-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-58-27-870.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/004-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-58-27-870.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/004-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-58-27-870.csv Completed graceful shutdown