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/sally-chc-benchmarks/misc/mvs_with_timeouts3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 19:21:34,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 19:21:34,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 19:21:34,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 19:21:34,742 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 19:21:34,744 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 19:21:34,745 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 19:21:34,752 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 19:21:34,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 19:21:34,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 19:21:34,757 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 19:21:34,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 19:21:34,758 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 19:21:34,759 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 19:21:34,760 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 19:21:34,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 19:21:34,763 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 19:21:34,765 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 19:21:34,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 19:21:34,778 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 19:21:34,779 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 19:21:34,780 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 19:21:34,782 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 19:21:34,782 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 19:21:34,782 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 19:21:34,783 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 19:21:34,784 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 19:21:34,785 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 19:21:34,785 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 19:21:34,786 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 19:21:34,786 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 19:21:34,787 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 19:21:34,787 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 19:21:34,787 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 19:21:34,788 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 19:21:34,788 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 19:21:34,789 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 19:21:34,804 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 19:21:34,804 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 19:21:34,804 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 19:21:34,804 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 19:21:34,805 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 19:21:34,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 19:21:34,806 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 19:21:34,806 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 19:21:34,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 19:21:34,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 19:21:34,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 19:21:34,807 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 19:21:34,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 19:21:34,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 19:21:34,807 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 19:21:34,807 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 19:21:34,808 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 19:21:34,808 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 19:21:34,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 19:21:34,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 19:21:34,808 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 19:21:34,811 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 19:21:34,811 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 19:21:34,849 INFO ]: Repository-Root is: /tmp [2018-06-26 19:21:34,859 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 19:21:34,863 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 19:21:34,864 INFO ]: Initializing SmtParser... [2018-06-26 19:21:34,864 INFO ]: SmtParser initialized [2018-06-26 19:21:34,865 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/sally-chc-benchmarks/misc/mvs_with_timeouts3.smt2 [2018-06-26 19:21:34,869 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 19:21:34,963 INFO ]: Executing SMT file /storage/chc-comp/sally-chc-benchmarks/misc/mvs_with_timeouts3.smt2 unknown [2018-06-26 19:21:35,266 INFO ]: Succesfully executed SMT file /storage/chc-comp/sally-chc-benchmarks/misc/mvs_with_timeouts3.smt2 [2018-06-26 19:21:35,280 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 19:21:35,286 INFO ]: Walking toolchain with 5 elements. [2018-06-26 19:21:35,287 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 19:21:35,287 INFO ]: Initializing ChcToBoogie... [2018-06-26 19:21:35,287 INFO ]: ChcToBoogie initialized [2018-06-26 19:21:35,290 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 07:21:35" (1/1) ... [2018-06-26 19:21:35,347 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:21:35 Unit [2018-06-26 19:21:35,347 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 19:21:35,348 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 19:21:35,348 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 19:21:35,348 INFO ]: Boogie Preprocessor initialized [2018-06-26 19:21:35,369 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:21:35" (1/1) ... [2018-06-26 19:21:35,369 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:21:35" (1/1) ... [2018-06-26 19:21:35,379 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:21:35" (1/1) ... [2018-06-26 19:21:35,380 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:21:35" (1/1) ... [2018-06-26 19:21:35,391 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:21:35" (1/1) ... [2018-06-26 19:21:35,393 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:21:35" (1/1) ... [2018-06-26 19:21:35,394 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:21:35" (1/1) ... [2018-06-26 19:21:35,396 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 19:21:35,397 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 19:21:35,397 INFO ]: Initializing RCFGBuilder... [2018-06-26 19:21:35,397 INFO ]: RCFGBuilder initialized [2018-06-26 19:21:35,398 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:21:35" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 19:21:35,410 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 19:21:35,410 INFO ]: Found specification of procedure gotoProc [2018-06-26 19:21:35,410 INFO ]: Found implementation of procedure gotoProc [2018-06-26 19:21:35,410 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 19:21:35,410 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 19:21:35,411 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 19:21:35,705 INFO ]: Using library mode [2018-06-26 19:21:35,705 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 07:21:35 BoogieIcfgContainer [2018-06-26 19:21:35,705 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 19:21:35,711 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 19:21:35,711 INFO ]: Initializing BlockEncodingV2... [2018-06-26 19:21:35,712 INFO ]: BlockEncodingV2 initialized [2018-06-26 19:21:35,713 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 07:21:35" (1/1) ... [2018-06-26 19:21:35,737 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 19:21:35,740 INFO ]: Using Remove infeasible edges [2018-06-26 19:21:35,741 INFO ]: Using Maximize final states [2018-06-26 19:21:35,741 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 19:21:35,741 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 19:21:35,745 INFO ]: Using Remove sink states [2018-06-26 19:21:35,745 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 19:21:35,745 INFO ]: Using Use SBE [2018-06-26 19:21:35,752 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 19:21:35,828 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 19:21:36,069 INFO ]: SBE split 2 edges [2018-06-26 19:21:36,110 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 19:21:36,111 INFO ]: 0 new accepting states [2018-06-26 19:21:38,164 INFO ]: Removed 131 edges and 2 locations by large block encoding [2018-06-26 19:21:38,166 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 19:21:38,178 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 19:21:38,179 INFO ]: 0 new accepting states [2018-06-26 19:21:38,179 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 19:21:38,179 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 19:21:38,195 INFO ]: Encoded RCFG 6 locations, 280 edges [2018-06-26 19:21:38,196 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 07:21:38 BasicIcfg [2018-06-26 19:21:38,196 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 19:21:38,197 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 19:21:38,197 INFO ]: Initializing TraceAbstraction... [2018-06-26 19:21:38,200 INFO ]: TraceAbstraction initialized [2018-06-26 19:21:38,200 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 07:21:35" (1/4) ... [2018-06-26 19:21:38,201 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9ab8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 07:21:38, skipping insertion in model container [2018-06-26 19:21:38,201 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:21:35" (2/4) ... [2018-06-26 19:21:38,201 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9ab8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 07:21:38, skipping insertion in model container [2018-06-26 19:21:38,201 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 07:21:35" (3/4) ... [2018-06-26 19:21:38,201 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9ab8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 07:21:38, skipping insertion in model container [2018-06-26 19:21:38,201 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 07:21:38" (4/4) ... [2018-06-26 19:21:38,203 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 19:21:38,210 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 19:21:38,216 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 19:21:38,252 INFO ]: Using default assertion order modulation [2018-06-26 19:21:38,253 INFO ]: Interprodecural is true [2018-06-26 19:21:38,253 INFO ]: Hoare is false [2018-06-26 19:21:38,253 INFO ]: Compute interpolants for FPandBP [2018-06-26 19:21:38,253 INFO ]: Backedges is TWOTRACK [2018-06-26 19:21:38,253 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 19:21:38,253 INFO ]: Difference is false [2018-06-26 19:21:38,253 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 19:21:38,253 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 19:21:38,264 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 19:21:38,276 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 19:21:38,276 INFO ]: Found error trace [2018-06-26 19:21:38,277 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 19:21:38,277 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:38,282 INFO ]: Analyzing trace with hash 44012161, now seen corresponding path program 1 times [2018-06-26 19:21:38,284 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:38,284 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:38,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:38,324 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:38,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:38,367 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:38,469 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:38,471 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:21:38,471 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:21:38,473 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:21:38,488 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:21:38,489 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:21:38,491 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 19:21:40,071 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:40,071 INFO ]: Finished difference Result 7 states and 280 transitions. [2018-06-26 19:21:40,071 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:21:40,072 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 19:21:40,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:40,082 INFO ]: With dead ends: 7 [2018-06-26 19:21:40,082 INFO ]: Without dead ends: 6 [2018-06-26 19:21:40,084 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:21:40,103 INFO ]: Start minimizeSevpa. Operand 6 states. [2018-06-26 19:21:40,123 INFO ]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-06-26 19:21:40,124 INFO ]: Start removeUnreachable. Operand 6 states. [2018-06-26 19:21:40,125 INFO ]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2018-06-26 19:21:40,126 INFO ]: Start accepts. Automaton has 6 states and 216 transitions. Word has length 5 [2018-06-26 19:21:40,127 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:40,127 INFO ]: Abstraction has 6 states and 216 transitions. [2018-06-26 19:21:40,127 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:21:40,127 INFO ]: Start isEmpty. Operand 6 states and 216 transitions. [2018-06-26 19:21:40,127 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 19:21:40,128 INFO ]: Found error trace [2018-06-26 19:21:40,128 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 19:21:40,128 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:40,128 INFO ]: Analyzing trace with hash 46931679, now seen corresponding path program 1 times [2018-06-26 19:21:40,128 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:40,128 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:40,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:40,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:40,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:40,141 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:40,161 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:40,161 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:21:40,161 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:21:40,163 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:21:40,163 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:21:40,163 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:21:40,163 INFO ]: Start difference. First operand 6 states and 216 transitions. Second operand 3 states. [2018-06-26 19:21:40,960 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:40,960 INFO ]: Finished difference Result 7 states and 216 transitions. [2018-06-26 19:21:40,980 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:21:40,980 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 19:21:40,981 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:40,981 INFO ]: With dead ends: 7 [2018-06-26 19:21:40,981 INFO ]: Without dead ends: 6 [2018-06-26 19:21:40,982 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:21:40,982 INFO ]: Start minimizeSevpa. Operand 6 states. [2018-06-26 19:21:40,986 INFO ]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-06-26 19:21:40,986 INFO ]: Start removeUnreachable. Operand 6 states. [2018-06-26 19:21:40,987 INFO ]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2018-06-26 19:21:40,987 INFO ]: Start accepts. Automaton has 6 states and 184 transitions. Word has length 5 [2018-06-26 19:21:40,987 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:40,987 INFO ]: Abstraction has 6 states and 184 transitions. [2018-06-26 19:21:40,987 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:21:40,987 INFO ]: Start isEmpty. Operand 6 states and 184 transitions. [2018-06-26 19:21:40,988 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 19:21:40,988 INFO ]: Found error trace [2018-06-26 19:21:40,988 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 19:21:40,988 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:40,988 INFO ]: Analyzing trace with hash 45025055, now seen corresponding path program 1 times [2018-06-26 19:21:40,988 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:40,988 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:40,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:40,989 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:40,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:41,002 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:41,038 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:41,038 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:21:41,038 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:21:41,038 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:21:41,038 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:21:41,039 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:21:41,039 INFO ]: Start difference. First operand 6 states and 184 transitions. Second operand 3 states. [2018-06-26 19:21:41,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:41,694 INFO ]: Finished difference Result 7 states and 184 transitions. [2018-06-26 19:21:41,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:21:41,695 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 19:21:41,695 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:41,695 INFO ]: With dead ends: 7 [2018-06-26 19:21:41,695 INFO ]: Without dead ends: 6 [2018-06-26 19:21:41,695 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:21:41,695 INFO ]: Start minimizeSevpa. Operand 6 states. [2018-06-26 19:21:41,698 INFO ]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-06-26 19:21:41,699 INFO ]: Start removeUnreachable. Operand 6 states. [2018-06-26 19:21:41,699 INFO ]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2018-06-26 19:21:41,699 INFO ]: Start accepts. Automaton has 6 states and 168 transitions. Word has length 5 [2018-06-26 19:21:41,699 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:41,699 INFO ]: Abstraction has 6 states and 168 transitions. [2018-06-26 19:21:41,699 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:21:41,699 INFO ]: Start isEmpty. Operand 6 states and 168 transitions. [2018-06-26 19:21:41,700 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 19:21:41,700 INFO ]: Found error trace [2018-06-26 19:21:41,700 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 19:21:41,700 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:41,700 INFO ]: Analyzing trace with hash 46961470, now seen corresponding path program 1 times [2018-06-26 19:21:41,700 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:41,700 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:41,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:41,701 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:41,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:41,722 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:41,739 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:41,739 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:21:41,739 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:21:41,739 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:21:41,739 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:21:41,739 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:21:41,739 INFO ]: Start difference. First operand 6 states and 168 transitions. Second operand 3 states. [2018-06-26 19:21:42,460 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:42,460 INFO ]: Finished difference Result 7 states and 168 transitions. [2018-06-26 19:21:42,460 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:21:42,460 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 19:21:42,460 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:42,460 INFO ]: With dead ends: 7 [2018-06-26 19:21:42,461 INFO ]: Without dead ends: 6 [2018-06-26 19:21:42,461 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:21:42,461 INFO ]: Start minimizeSevpa. Operand 6 states. [2018-06-26 19:21:42,463 INFO ]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-06-26 19:21:42,463 INFO ]: Start removeUnreachable. Operand 6 states. [2018-06-26 19:21:42,468 INFO ]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2018-06-26 19:21:42,468 INFO ]: Start accepts. Automaton has 6 states and 160 transitions. Word has length 5 [2018-06-26 19:21:42,468 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:42,468 INFO ]: Abstraction has 6 states and 160 transitions. [2018-06-26 19:21:42,468 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:21:42,468 INFO ]: Start isEmpty. Operand 6 states and 160 transitions. [2018-06-26 19:21:42,468 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 19:21:42,468 INFO ]: Found error trace [2018-06-26 19:21:42,468 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 19:21:42,468 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:42,469 INFO ]: Analyzing trace with hash 44131325, now seen corresponding path program 1 times [2018-06-26 19:21:42,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:42,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:42,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:42,469 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:42,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:42,490 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:42,591 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:42,591 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:21:42,591 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:21:42,591 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:21:42,591 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:21:42,591 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:21:42,591 INFO ]: Start difference. First operand 6 states and 160 transitions. Second operand 3 states. [2018-06-26 19:21:43,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:43,514 INFO ]: Finished difference Result 7 states and 308 transitions. [2018-06-26 19:21:43,514 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:21:43,514 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 19:21:43,514 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:43,515 INFO ]: With dead ends: 7 [2018-06-26 19:21:43,515 INFO ]: Without dead ends: 7 [2018-06-26 19:21:43,515 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:21:43,515 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 19:21:43,518 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 19:21:43,518 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 19:21:43,519 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 308 transitions. [2018-06-26 19:21:43,519 INFO ]: Start accepts. Automaton has 7 states and 308 transitions. Word has length 5 [2018-06-26 19:21:43,519 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:43,519 INFO ]: Abstraction has 7 states and 308 transitions. [2018-06-26 19:21:43,519 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:21:43,519 INFO ]: Start isEmpty. Operand 7 states and 308 transitions. [2018-06-26 19:21:43,519 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:21:43,519 INFO ]: Found error trace [2018-06-26 19:21:43,519 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:21:43,519 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:43,520 INFO ]: Analyzing trace with hash 1363783252, now seen corresponding path program 1 times [2018-06-26 19:21:43,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:43,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:43,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:43,520 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:43,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:43,539 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:43,650 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:43,650 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:21:43,650 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:21:43,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:43,709 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:43,718 INFO ]: Computing forward predicates... [2018-06-26 19:21:44,510 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:44,531 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:21:44,531 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 19:21:44,531 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:21:44,531 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:21:44,532 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:21:44,532 INFO ]: Start difference. First operand 7 states and 308 transitions. Second operand 5 states. [2018-06-26 19:21:46,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:46,137 INFO ]: Finished difference Result 10 states and 728 transitions. [2018-06-26 19:21:46,158 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:21:46,158 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 19:21:46,158 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:46,159 INFO ]: With dead ends: 10 [2018-06-26 19:21:46,159 INFO ]: Without dead ends: 10 [2018-06-26 19:21:46,160 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-26 19:21:46,160 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 19:21:46,165 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 19:21:46,165 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 19:21:46,167 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 728 transitions. [2018-06-26 19:21:46,167 INFO ]: Start accepts. Automaton has 10 states and 728 transitions. Word has length 6 [2018-06-26 19:21:46,167 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:46,167 INFO ]: Abstraction has 10 states and 728 transitions. [2018-06-26 19:21:46,167 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:21:46,167 INFO ]: Start isEmpty. Operand 10 states and 728 transitions. [2018-06-26 19:21:46,168 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:21:46,168 INFO ]: Found error trace [2018-06-26 19:21:46,168 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:21:46,168 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:46,168 INFO ]: Analyzing trace with hash 1363842834, now seen corresponding path program 1 times [2018-06-26 19:21:46,168 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:46,168 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:46,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:46,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:46,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:46,193 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:46,252 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:46,252 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:21:46,252 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:21:46,258 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:46,283 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:46,285 INFO ]: Computing forward predicates... [2018-06-26 19:21:46,551 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:46,570 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:21:46,570 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 19:21:46,570 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:21:46,571 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:21:46,571 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:21:46,571 INFO ]: Start difference. First operand 10 states and 728 transitions. Second operand 5 states. [2018-06-26 19:21:48,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:48,108 INFO ]: Finished difference Result 13 states and 1140 transitions. [2018-06-26 19:21:48,108 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:21:48,108 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 19:21:48,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:48,109 INFO ]: With dead ends: 13 [2018-06-26 19:21:48,109 INFO ]: Without dead ends: 13 [2018-06-26 19:21:48,110 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:21:48,110 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 19:21:48,116 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 19:21:48,116 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 19:21:48,118 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1140 transitions. [2018-06-26 19:21:48,118 INFO ]: Start accepts. Automaton has 13 states and 1140 transitions. Word has length 6 [2018-06-26 19:21:48,118 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:48,118 INFO ]: Abstraction has 13 states and 1140 transitions. [2018-06-26 19:21:48,118 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:21:48,119 INFO ]: Start isEmpty. Operand 13 states and 1140 transitions. [2018-06-26 19:21:48,119 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:21:48,119 INFO ]: Found error trace [2018-06-26 19:21:48,119 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:21:48,119 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:48,120 INFO ]: Analyzing trace with hash 1363961998, now seen corresponding path program 1 times [2018-06-26 19:21:48,120 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:48,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:48,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:48,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:48,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:48,148 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:48,214 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:48,215 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:21:48,215 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:21:48,221 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:48,248 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:48,250 INFO ]: Computing forward predicates... [2018-06-26 19:21:49,336 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:49,367 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 19:21:49,367 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-06-26 19:21:49,368 INFO ]: Interpolant automaton has 4 states [2018-06-26 19:21:49,368 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 19:21:49,368 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 19:21:49,368 INFO ]: Start difference. First operand 13 states and 1140 transitions. Second operand 4 states. [2018-06-26 19:21:50,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:50,258 INFO ]: Finished difference Result 14 states and 1256 transitions. [2018-06-26 19:21:50,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:21:50,259 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 19:21:50,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:50,261 INFO ]: With dead ends: 14 [2018-06-26 19:21:50,261 INFO ]: Without dead ends: 14 [2018-06-26 19:21:50,261 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 19:21:50,261 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 19:21:50,268 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 19:21:50,268 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 19:21:50,269 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1256 transitions. [2018-06-26 19:21:50,269 INFO ]: Start accepts. Automaton has 14 states and 1256 transitions. Word has length 6 [2018-06-26 19:21:50,270 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:50,270 INFO ]: Abstraction has 14 states and 1256 transitions. [2018-06-26 19:21:50,270 INFO ]: Interpolant automaton has 4 states. [2018-06-26 19:21:50,270 INFO ]: Start isEmpty. Operand 14 states and 1256 transitions. [2018-06-26 19:21:50,271 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:21:50,271 INFO ]: Found error trace [2018-06-26 19:21:50,271 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:21:50,271 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:50,271 INFO ]: Analyzing trace with hash 1364140744, now seen corresponding path program 1 times [2018-06-26 19:21:50,271 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:50,271 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:50,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:50,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:50,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:50,282 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:50,317 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:50,317 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:21:50,317 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:21:50,323 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:50,364 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:50,366 INFO ]: Computing forward predicates... [2018-06-26 19:21:50,816 WARN ]: Spent 282.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-06-26 19:21:50,818 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:50,838 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:21:50,838 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 19:21:50,838 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:21:50,838 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:21:50,838 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:21:50,839 INFO ]: Start difference. First operand 14 states and 1256 transitions. Second operand 5 states. [2018-06-26 19:21:52,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:52,003 INFO ]: Finished difference Result 16 states and 1536 transitions. [2018-06-26 19:21:52,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:21:52,006 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 19:21:52,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:52,008 INFO ]: With dead ends: 16 [2018-06-26 19:21:52,008 INFO ]: Without dead ends: 16 [2018-06-26 19:21:52,009 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:21:52,009 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 19:21:52,016 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 19:21:52,016 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 19:21:52,018 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1536 transitions. [2018-06-26 19:21:52,018 INFO ]: Start accepts. Automaton has 16 states and 1536 transitions. Word has length 6 [2018-06-26 19:21:52,018 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:52,018 INFO ]: Abstraction has 16 states and 1536 transitions. [2018-06-26 19:21:52,018 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:21:52,018 INFO ]: Start isEmpty. Operand 16 states and 1536 transitions. [2018-06-26 19:21:52,021 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:21:52,021 INFO ]: Found error trace [2018-06-26 19:21:52,021 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:21:52,021 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:52,022 INFO ]: Analyzing trace with hash 1364170535, now seen corresponding path program 1 times [2018-06-26 19:21:52,022 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:52,022 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:52,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:52,022 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:52,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:52,044 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:52,102 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:52,102 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:21:52,102 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:21:52,107 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:52,144 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:52,146 INFO ]: Computing forward predicates... [2018-06-26 19:21:52,221 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:52,240 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:21:52,240 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 19:21:52,240 INFO ]: Interpolant automaton has 6 states [2018-06-26 19:21:52,240 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 19:21:52,240 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 19:21:52,240 INFO ]: Start difference. First operand 16 states and 1536 transitions. Second operand 6 states. [2018-06-26 19:21:53,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:53,725 INFO ]: Finished difference Result 20 states and 2088 transitions. [2018-06-26 19:21:53,725 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:21:53,726 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-26 19:21:53,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:53,729 INFO ]: With dead ends: 20 [2018-06-26 19:21:53,729 INFO ]: Without dead ends: 20 [2018-06-26 19:21:53,729 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 19:21:53,729 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 19:21:53,737 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 19:21:53,737 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 19:21:53,739 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2088 transitions. [2018-06-26 19:21:53,739 INFO ]: Start accepts. Automaton has 20 states and 2088 transitions. Word has length 6 [2018-06-26 19:21:53,739 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:53,739 INFO ]: Abstraction has 20 states and 2088 transitions. [2018-06-26 19:21:53,739 INFO ]: Interpolant automaton has 6 states. [2018-06-26 19:21:53,739 INFO ]: Start isEmpty. Operand 20 states and 2088 transitions. [2018-06-26 19:21:53,740 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:21:53,740 INFO ]: Found error trace [2018-06-26 19:21:53,740 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:21:53,741 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:53,744 INFO ]: Analyzing trace with hash 1364468445, now seen corresponding path program 1 times [2018-06-26 19:21:53,744 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:53,744 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:53,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:53,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:53,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:53,758 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:53,819 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:53,819 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:21:53,819 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:21:53,825 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:53,848 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:53,849 INFO ]: Computing forward predicates... [2018-06-26 19:21:53,981 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:54,000 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:21:54,000 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 19:21:54,000 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:21:54,001 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:21:54,001 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:21:54,001 INFO ]: Start difference. First operand 20 states and 2088 transitions. Second operand 5 states. [2018-06-26 19:21:55,240 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:55,240 INFO ]: Finished difference Result 24 states and 2648 transitions. [2018-06-26 19:21:55,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:21:55,240 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 19:21:55,240 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:55,243 INFO ]: With dead ends: 24 [2018-06-26 19:21:55,243 INFO ]: Without dead ends: 24 [2018-06-26 19:21:55,243 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-26 19:21:55,243 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 19:21:55,260 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-06-26 19:21:55,260 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 19:21:55,262 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2516 transitions. [2018-06-26 19:21:55,262 INFO ]: Start accepts. Automaton has 23 states and 2516 transitions. Word has length 6 [2018-06-26 19:21:55,262 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:55,262 INFO ]: Abstraction has 23 states and 2516 transitions. [2018-06-26 19:21:55,262 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:21:55,262 INFO ]: Start isEmpty. Operand 23 states and 2516 transitions. [2018-06-26 19:21:55,264 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:21:55,264 INFO ]: Found error trace [2018-06-26 19:21:55,264 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:21:55,264 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:55,264 INFO ]: Analyzing trace with hash 1364587609, now seen corresponding path program 1 times [2018-06-26 19:21:55,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:55,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:55,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:55,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:55,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:55,274 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:55,316 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:55,316 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:21:55,316 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:21:55,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:55,370 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:55,372 INFO ]: Computing forward predicates... [2018-06-26 19:21:55,458 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:55,476 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:21:55,477 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 19:21:55,477 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:21:55,477 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:21:55,477 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:21:55,477 INFO ]: Start difference. First operand 23 states and 2516 transitions. Second operand 5 states. [2018-06-26 19:21:56,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:56,657 INFO ]: Finished difference Result 27 states and 3076 transitions. [2018-06-26 19:21:56,657 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:21:56,657 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 19:21:56,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:56,660 INFO ]: With dead ends: 27 [2018-06-26 19:21:56,660 INFO ]: Without dead ends: 27 [2018-06-26 19:21:56,661 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-26 19:21:56,661 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 19:21:56,697 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-26 19:21:56,697 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 19:21:56,699 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 3076 transitions. [2018-06-26 19:21:56,699 INFO ]: Start accepts. Automaton has 27 states and 3076 transitions. Word has length 6 [2018-06-26 19:21:56,699 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:56,699 INFO ]: Abstraction has 27 states and 3076 transitions. [2018-06-26 19:21:56,699 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:21:56,700 INFO ]: Start isEmpty. Operand 27 states and 3076 transitions. [2018-06-26 19:21:56,702 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:21:56,702 INFO ]: Found error trace [2018-06-26 19:21:56,702 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:21:56,702 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:56,702 INFO ]: Analyzing trace with hash 1360416869, now seen corresponding path program 1 times [2018-06-26 19:21:56,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:56,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:56,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:56,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:56,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:56,717 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:56,801 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:56,801 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:21:56,801 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:21:56,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:56,830 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:56,831 INFO ]: Computing forward predicates... [2018-06-26 19:21:56,927 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:56,954 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:21:56,954 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 19:21:56,954 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:21:56,954 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:21:56,954 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:21:56,955 INFO ]: Start difference. First operand 27 states and 3076 transitions. Second operand 5 states. [2018-06-26 19:21:58,020 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:58,020 INFO ]: Finished difference Result 30 states and 3504 transitions. [2018-06-26 19:21:58,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:21:58,021 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 19:21:58,021 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:58,023 INFO ]: With dead ends: 30 [2018-06-26 19:21:58,023 INFO ]: Without dead ends: 30 [2018-06-26 19:21:58,023 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:21:58,023 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 19:21:58,032 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-26 19:21:58,033 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 19:21:58,035 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3208 transitions. [2018-06-26 19:21:58,035 INFO ]: Start accepts. Automaton has 28 states and 3208 transitions. Word has length 6 [2018-06-26 19:21:58,035 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:58,035 INFO ]: Abstraction has 28 states and 3208 transitions. [2018-06-26 19:21:58,035 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:21:58,035 INFO ]: Start isEmpty. Operand 28 states and 3208 transitions. [2018-06-26 19:21:58,036 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:21:58,036 INFO ]: Found error trace [2018-06-26 19:21:58,036 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:21:58,037 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:58,037 INFO ]: Analyzing trace with hash 1378559588, now seen corresponding path program 1 times [2018-06-26 19:21:58,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:58,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:58,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:58,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:58,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:58,048 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:58,119 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:58,119 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:21:58,119 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:21:58,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:58,149 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:58,151 INFO ]: Computing forward predicates... [2018-06-26 19:21:58,292 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:58,312 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:21:58,312 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 19:21:58,312 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:21:58,312 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:21:58,312 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:21:58,312 INFO ]: Start difference. First operand 28 states and 3208 transitions. Second operand 5 states. [2018-06-26 19:21:59,872 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:21:59,872 INFO ]: Finished difference Result 30 states and 3480 transitions. [2018-06-26 19:21:59,872 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:21:59,872 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 19:21:59,872 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:21:59,875 INFO ]: With dead ends: 30 [2018-06-26 19:21:59,875 INFO ]: Without dead ends: 30 [2018-06-26 19:21:59,875 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:21:59,875 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 19:21:59,886 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-26 19:21:59,886 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 19:21:59,889 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3200 transitions. [2018-06-26 19:21:59,889 INFO ]: Start accepts. Automaton has 28 states and 3200 transitions. Word has length 6 [2018-06-26 19:21:59,889 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:21:59,889 INFO ]: Abstraction has 28 states and 3200 transitions. [2018-06-26 19:21:59,889 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:21:59,889 INFO ]: Start isEmpty. Operand 28 states and 3200 transitions. [2018-06-26 19:21:59,890 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:21:59,890 INFO ]: Found error trace [2018-06-26 19:21:59,890 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:21:59,890 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:21:59,890 INFO ]: Analyzing trace with hash 1378619170, now seen corresponding path program 1 times [2018-06-26 19:21:59,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:21:59,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:21:59,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:59,891 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:59,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:21:59,898 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:21:59,970 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:21:59,970 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:21:59,970 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:21:59,977 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:21:59,998 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:00,000 INFO ]: Computing forward predicates... [2018-06-26 19:22:00,654 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:00,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:22:00,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 19:22:00,674 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:22:00,674 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:22:00,674 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:22:00,674 INFO ]: Start difference. First operand 28 states and 3200 transitions. Second operand 5 states. [2018-06-26 19:22:02,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:02,101 INFO ]: Finished difference Result 31 states and 3612 transitions. [2018-06-26 19:22:02,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:22:02,104 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 19:22:02,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:02,107 INFO ]: With dead ends: 31 [2018-06-26 19:22:02,107 INFO ]: Without dead ends: 31 [2018-06-26 19:22:02,108 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-26 19:22:02,108 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 19:22:02,120 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-06-26 19:22:02,120 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 19:22:02,123 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3200 transitions. [2018-06-26 19:22:02,123 INFO ]: Start accepts. Automaton has 28 states and 3200 transitions. Word has length 6 [2018-06-26 19:22:02,123 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:02,123 INFO ]: Abstraction has 28 states and 3200 transitions. [2018-06-26 19:22:02,123 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:22:02,123 INFO ]: Start isEmpty. Operand 28 states and 3200 transitions. [2018-06-26 19:22:02,126 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:22:02,126 INFO ]: Found error trace [2018-06-26 19:22:02,126 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:22:02,126 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:02,126 INFO ]: Analyzing trace with hash 1378738334, now seen corresponding path program 1 times [2018-06-26 19:22:02,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:02,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:02,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:02,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:02,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:02,144 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:02,192 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:02,192 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:02,192 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:02,198 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:02,222 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:02,223 INFO ]: Computing forward predicates... [2018-06-26 19:22:02,590 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:02,614 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 19:22:02,614 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-06-26 19:22:02,614 INFO ]: Interpolant automaton has 4 states [2018-06-26 19:22:02,614 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 19:22:02,614 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 19:22:02,615 INFO ]: Start difference. First operand 28 states and 3200 transitions. Second operand 4 states. [2018-06-26 19:22:03,334 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:03,334 INFO ]: Finished difference Result 29 states and 3316 transitions. [2018-06-26 19:22:03,335 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:22:03,335 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 19:22:03,335 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:03,337 INFO ]: With dead ends: 29 [2018-06-26 19:22:03,337 INFO ]: Without dead ends: 29 [2018-06-26 19:22:03,337 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 19:22:03,337 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 19:22:03,343 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 19:22:03,343 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 19:22:03,345 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3316 transitions. [2018-06-26 19:22:03,345 INFO ]: Start accepts. Automaton has 29 states and 3316 transitions. Word has length 6 [2018-06-26 19:22:03,345 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:03,345 INFO ]: Abstraction has 29 states and 3316 transitions. [2018-06-26 19:22:03,345 INFO ]: Interpolant automaton has 4 states. [2018-06-26 19:22:03,345 INFO ]: Start isEmpty. Operand 29 states and 3316 transitions. [2018-06-26 19:22:03,346 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:22:03,346 INFO ]: Found error trace [2018-06-26 19:22:03,347 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:22:03,347 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:03,347 INFO ]: Analyzing trace with hash 1378917080, now seen corresponding path program 1 times [2018-06-26 19:22:03,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:03,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:03,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:03,347 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:03,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:03,356 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:03,552 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:03,552 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:03,552 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:03,558 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:03,579 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:03,581 INFO ]: Computing forward predicates... [2018-06-26 19:22:04,037 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:04,056 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:22:04,056 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 19:22:04,056 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:22:04,056 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:22:04,056 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:22:04,056 INFO ]: Start difference. First operand 29 states and 3316 transitions. Second operand 5 states. [2018-06-26 19:22:05,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:05,441 INFO ]: Finished difference Result 31 states and 3596 transitions. [2018-06-26 19:22:05,443 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:22:05,443 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 19:22:05,443 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:05,445 INFO ]: With dead ends: 31 [2018-06-26 19:22:05,445 INFO ]: Without dead ends: 31 [2018-06-26 19:22:05,445 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:22:05,445 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 19:22:05,452 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-26 19:22:05,452 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 19:22:05,633 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3316 transitions. [2018-06-26 19:22:05,633 INFO ]: Start accepts. Automaton has 29 states and 3316 transitions. Word has length 6 [2018-06-26 19:22:05,633 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:05,633 INFO ]: Abstraction has 29 states and 3316 transitions. [2018-06-26 19:22:05,633 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:22:05,633 INFO ]: Start isEmpty. Operand 29 states and 3316 transitions. [2018-06-26 19:22:05,634 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:22:05,634 INFO ]: Found error trace [2018-06-26 19:22:05,634 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:22:05,634 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:05,634 INFO ]: Analyzing trace with hash 1378946871, now seen corresponding path program 1 times [2018-06-26 19:22:05,634 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:05,634 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:05,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:05,635 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:05,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:05,642 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:05,896 WARN ]: Spent 197.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-06-26 19:22:05,902 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:05,903 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:05,903 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:05,908 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:05,929 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:05,930 INFO ]: Computing forward predicates... [2018-06-26 19:22:06,070 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:06,101 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:22:06,101 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 19:22:06,101 INFO ]: Interpolant automaton has 6 states [2018-06-26 19:22:06,101 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 19:22:06,101 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 19:22:06,102 INFO ]: Start difference. First operand 29 states and 3316 transitions. Second operand 6 states. [2018-06-26 19:22:07,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:07,606 INFO ]: Finished difference Result 33 states and 3868 transitions. [2018-06-26 19:22:07,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:22:07,607 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-26 19:22:07,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:07,609 INFO ]: With dead ends: 33 [2018-06-26 19:22:07,609 INFO ]: Without dead ends: 33 [2018-06-26 19:22:07,609 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 19:22:07,609 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 19:22:07,617 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-26 19:22:07,617 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 19:22:07,619 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3316 transitions. [2018-06-26 19:22:07,619 INFO ]: Start accepts. Automaton has 29 states and 3316 transitions. Word has length 6 [2018-06-26 19:22:07,619 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:07,619 INFO ]: Abstraction has 29 states and 3316 transitions. [2018-06-26 19:22:07,619 INFO ]: Interpolant automaton has 6 states. [2018-06-26 19:22:07,619 INFO ]: Start isEmpty. Operand 29 states and 3316 transitions. [2018-06-26 19:22:07,620 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:22:07,620 INFO ]: Found error trace [2018-06-26 19:22:07,620 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:22:07,620 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:07,620 INFO ]: Analyzing trace with hash 1379244781, now seen corresponding path program 1 times [2018-06-26 19:22:07,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:07,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:07,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:07,620 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:07,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:07,627 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:07,834 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:07,834 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:07,834 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) [2018-06-26 19:22:07,846 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:07,886 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:07,888 INFO ]: Computing forward predicates... [2018-06-26 19:22:08,367 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:08,386 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:22:08,386 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 19:22:08,386 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:22:08,387 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:22:08,387 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:22:08,387 INFO ]: Start difference. First operand 29 states and 3316 transitions. Second operand 5 states. [2018-06-26 19:22:09,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:09,778 INFO ]: Finished difference Result 33 states and 3876 transitions. [2018-06-26 19:22:09,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:22:09,778 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 19:22:09,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:09,780 INFO ]: With dead ends: 33 [2018-06-26 19:22:09,780 INFO ]: Without dead ends: 33 [2018-06-26 19:22:09,780 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:22:09,781 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 19:22:09,788 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-26 19:22:09,788 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 19:22:09,789 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3316 transitions. [2018-06-26 19:22:09,789 INFO ]: Start accepts. Automaton has 29 states and 3316 transitions. Word has length 6 [2018-06-26 19:22:09,789 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:09,789 INFO ]: Abstraction has 29 states and 3316 transitions. [2018-06-26 19:22:09,789 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:22:09,789 INFO ]: Start isEmpty. Operand 29 states and 3316 transitions. [2018-06-26 19:22:09,790 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:22:09,790 INFO ]: Found error trace [2018-06-26 19:22:09,790 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:22:09,790 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:09,790 INFO ]: Analyzing trace with hash 1379363945, now seen corresponding path program 1 times [2018-06-26 19:22:09,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:09,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:09,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:09,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:09,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:09,800 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:09,842 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:09,842 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:09,842 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:09,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:09,870 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:09,872 INFO ]: Computing forward predicates... [2018-06-26 19:22:10,553 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:10,572 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:22:10,572 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 19:22:10,572 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:22:10,572 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:22:10,572 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:22:10,573 INFO ]: Start difference. First operand 29 states and 3316 transitions. Second operand 5 states. [2018-06-26 19:22:11,945 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:11,945 INFO ]: Finished difference Result 33 states and 3876 transitions. [2018-06-26 19:22:11,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:22:11,945 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 19:22:11,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:11,947 INFO ]: With dead ends: 33 [2018-06-26 19:22:11,947 INFO ]: Without dead ends: 33 [2018-06-26 19:22:11,948 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:22:11,948 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 19:22:11,957 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-26 19:22:11,958 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 19:22:11,965 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3316 transitions. [2018-06-26 19:22:11,965 INFO ]: Start accepts. Automaton has 29 states and 3316 transitions. Word has length 6 [2018-06-26 19:22:11,965 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:11,965 INFO ]: Abstraction has 29 states and 3316 transitions. [2018-06-26 19:22:11,965 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:22:11,965 INFO ]: Start isEmpty. Operand 29 states and 3316 transitions. [2018-06-26 19:22:11,966 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:22:11,966 INFO ]: Found error trace [2018-06-26 19:22:11,966 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:22:11,966 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:11,966 INFO ]: Analyzing trace with hash 1375193205, now seen corresponding path program 1 times [2018-06-26 19:22:11,966 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:11,966 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:11,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:11,967 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:11,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:11,976 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:12,056 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:12,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:12,056 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:12,062 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:12,087 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:12,089 INFO ]: Computing forward predicates... [2018-06-26 19:22:13,502 WARN ]: Spent 387.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-06-26 19:22:13,503 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:13,526 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:22:13,526 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 19:22:13,527 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:22:13,527 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:22:13,527 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:22:13,527 INFO ]: Start difference. First operand 29 states and 3316 transitions. Second operand 5 states. [2018-06-26 19:22:14,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:14,877 INFO ]: Finished difference Result 33 states and 3884 transitions. [2018-06-26 19:22:14,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:22:14,877 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 19:22:14,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:14,880 INFO ]: With dead ends: 33 [2018-06-26 19:22:14,880 INFO ]: Without dead ends: 33 [2018-06-26 19:22:14,880 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:22:14,880 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 19:22:14,892 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-26 19:22:14,892 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 19:22:14,894 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 3060 transitions. [2018-06-26 19:22:14,895 INFO ]: Start accepts. Automaton has 27 states and 3060 transitions. Word has length 6 [2018-06-26 19:22:14,895 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:14,895 INFO ]: Abstraction has 27 states and 3060 transitions. [2018-06-26 19:22:14,895 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:22:14,895 INFO ]: Start isEmpty. Operand 27 states and 3060 transitions. [2018-06-26 19:22:14,900 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 19:22:14,900 INFO ]: Found error trace [2018-06-26 19:22:14,900 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:22:14,900 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:14,900 INFO ]: Analyzing trace with hash -676709762, now seen corresponding path program 1 times [2018-06-26 19:22:14,900 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:14,900 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:14,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:14,901 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:14,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:14,922 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:15,215 WARN ]: Spent 203.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-06-26 19:22:15,490 WARN ]: Spent 224.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2018-06-26 19:22:15,728 WARN ]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-26 19:22:15,729 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:15,729 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:15,729 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) [2018-06-26 19:22:15,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:15,794 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:15,796 INFO ]: Computing forward predicates... [2018-06-26 19:22:15,847 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:15,867 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 19:22:15,867 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-26 19:22:15,867 INFO ]: Interpolant automaton has 6 states [2018-06-26 19:22:15,867 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 19:22:15,867 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 19:22:15,867 INFO ]: Start difference. First operand 27 states and 3060 transitions. Second operand 6 states. [2018-06-26 19:22:18,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:18,124 INFO ]: Finished difference Result 58 states and 7078 transitions. [2018-06-26 19:22:18,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 19:22:18,126 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 19:22:18,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:18,134 INFO ]: With dead ends: 58 [2018-06-26 19:22:18,134 INFO ]: Without dead ends: 58 [2018-06-26 19:22:18,134 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-26 19:22:18,134 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 19:22:18,151 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-06-26 19:22:18,151 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-26 19:22:18,158 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 7077 transitions. [2018-06-26 19:22:18,158 INFO ]: Start accepts. Automaton has 57 states and 7077 transitions. Word has length 7 [2018-06-26 19:22:18,158 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:18,159 INFO ]: Abstraction has 57 states and 7077 transitions. [2018-06-26 19:22:18,159 INFO ]: Interpolant automaton has 6 states. [2018-06-26 19:22:18,159 INFO ]: Start isEmpty. Operand 57 states and 7077 transitions. [2018-06-26 19:22:18,161 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 19:22:18,161 INFO ]: Found error trace [2018-06-26 19:22:18,161 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:22:18,161 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:18,161 INFO ]: Analyzing trace with hash -676501225, now seen corresponding path program 1 times [2018-06-26 19:22:18,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:18,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:18,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:18,163 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:18,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:18,174 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:18,218 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:18,219 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:22:18,219 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:22:18,219 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:22:18,219 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:22:18,219 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:22:18,219 INFO ]: Start difference. First operand 57 states and 7077 transitions. Second operand 3 states. [2018-06-26 19:22:18,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:18,726 INFO ]: Finished difference Result 64 states and 6900 transitions. [2018-06-26 19:22:18,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:22:18,727 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 19:22:18,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:18,731 INFO ]: With dead ends: 64 [2018-06-26 19:22:18,731 INFO ]: Without dead ends: 64 [2018-06-26 19:22:18,731 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:22:18,731 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-26 19:22:18,744 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-06-26 19:22:18,744 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-26 19:22:18,748 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 6899 transitions. [2018-06-26 19:22:18,748 INFO ]: Start accepts. Automaton has 63 states and 6899 transitions. Word has length 7 [2018-06-26 19:22:18,748 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:18,748 INFO ]: Abstraction has 63 states and 6899 transitions. [2018-06-26 19:22:18,748 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:22:18,748 INFO ]: Start isEmpty. Operand 63 states and 6899 transitions. [2018-06-26 19:22:18,750 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 19:22:18,750 INFO ]: Found error trace [2018-06-26 19:22:18,750 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:22:18,751 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:18,751 INFO ]: Analyzing trace with hash -675994778, now seen corresponding path program 1 times [2018-06-26 19:22:18,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:18,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:18,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:18,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:18,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:18,758 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:18,817 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:18,817 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:22:18,817 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:22:18,817 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:22:18,817 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:22:18,817 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:22:18,817 INFO ]: Start difference. First operand 63 states and 6899 transitions. Second operand 3 states. [2018-06-26 19:22:19,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:19,398 INFO ]: Finished difference Result 68 states and 4368 transitions. [2018-06-26 19:22:19,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:22:19,398 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 19:22:19,399 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:19,409 INFO ]: With dead ends: 68 [2018-06-26 19:22:19,409 INFO ]: Without dead ends: 68 [2018-06-26 19:22:19,409 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:22:19,409 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-26 19:22:19,420 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 51. [2018-06-26 19:22:19,420 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 19:22:19,423 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 4079 transitions. [2018-06-26 19:22:19,423 INFO ]: Start accepts. Automaton has 51 states and 4079 transitions. Word has length 7 [2018-06-26 19:22:19,423 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:19,423 INFO ]: Abstraction has 51 states and 4079 transitions. [2018-06-26 19:22:19,423 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:22:19,423 INFO ]: Start isEmpty. Operand 51 states and 4079 transitions. [2018-06-26 19:22:19,425 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 19:22:19,425 INFO ]: Found error trace [2018-06-26 19:22:19,425 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:22:19,425 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:19,425 INFO ]: Analyzing trace with hash -674862720, now seen corresponding path program 1 times [2018-06-26 19:22:19,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:19,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:19,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:19,426 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:19,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:19,438 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:19,640 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:19,640 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:19,640 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:19,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:19,696 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:19,698 INFO ]: Computing forward predicates... [2018-06-26 19:22:19,974 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:19,993 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:22:19,993 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 19:22:19,993 INFO ]: Interpolant automaton has 8 states [2018-06-26 19:22:19,994 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 19:22:19,994 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-26 19:22:19,994 INFO ]: Start difference. First operand 51 states and 4079 transitions. Second operand 8 states. [2018-06-26 19:22:21,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:21,832 INFO ]: Finished difference Result 61 states and 4883 transitions. [2018-06-26 19:22:21,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:22:21,832 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-26 19:22:21,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:21,834 INFO ]: With dead ends: 61 [2018-06-26 19:22:21,834 INFO ]: Without dead ends: 61 [2018-06-26 19:22:21,834 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-26 19:22:21,834 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-26 19:22:21,840 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-06-26 19:22:21,840 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-26 19:22:21,842 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 4847 transitions. [2018-06-26 19:22:21,842 INFO ]: Start accepts. Automaton has 59 states and 4847 transitions. Word has length 7 [2018-06-26 19:22:21,842 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:21,842 INFO ]: Abstraction has 59 states and 4847 transitions. [2018-06-26 19:22:21,842 INFO ]: Interpolant automaton has 8 states. [2018-06-26 19:22:21,842 INFO ]: Start isEmpty. Operand 59 states and 4847 transitions. [2018-06-26 19:22:21,843 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 19:22:21,843 INFO ]: Found error trace [2018-06-26 19:22:21,843 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:22:21,843 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:21,843 INFO ]: Analyzing trace with hash -664703989, now seen corresponding path program 1 times [2018-06-26 19:22:21,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:21,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:21,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:21,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:21,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:21,853 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:22,228 WARN ]: Spent 325.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 14 [2018-06-26 19:22:22,735 WARN ]: Spent 311.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-06-26 19:22:22,735 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:22,735 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:22,735 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:22,748 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:22,782 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:22,783 INFO ]: Computing forward predicates... [2018-06-26 19:22:22,854 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:22,873 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:22:22,873 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 19:22:22,873 INFO ]: Interpolant automaton has 8 states [2018-06-26 19:22:22,873 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 19:22:22,873 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-26 19:22:22,873 INFO ]: Start difference. First operand 59 states and 4847 transitions. Second operand 8 states. [2018-06-26 19:22:25,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:25,458 INFO ]: Finished difference Result 83 states and 7175 transitions. [2018-06-26 19:22:25,458 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 19:22:25,458 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-26 19:22:25,458 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:25,461 INFO ]: With dead ends: 83 [2018-06-26 19:22:25,461 INFO ]: Without dead ends: 83 [2018-06-26 19:22:25,461 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-26 19:22:25,461 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-26 19:22:25,472 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-06-26 19:22:25,472 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-26 19:22:25,476 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 7175 transitions. [2018-06-26 19:22:25,477 INFO ]: Start accepts. Automaton has 83 states and 7175 transitions. Word has length 7 [2018-06-26 19:22:25,477 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:25,477 INFO ]: Abstraction has 83 states and 7175 transitions. [2018-06-26 19:22:25,477 INFO ]: Interpolant automaton has 8 states. [2018-06-26 19:22:25,477 INFO ]: Start isEmpty. Operand 83 states and 7175 transitions. [2018-06-26 19:22:25,480 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 19:22:25,480 INFO ]: Found error trace [2018-06-26 19:22:25,480 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:22:25,480 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:25,480 INFO ]: Analyzing trace with hash -664316706, now seen corresponding path program 1 times [2018-06-26 19:22:25,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:25,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:25,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:25,481 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:25,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:25,493 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:25,549 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:25,549 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:22:25,549 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:22:25,549 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:22:25,549 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:22:25,549 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:22:25,549 INFO ]: Start difference. First operand 83 states and 7175 transitions. Second operand 3 states. [2018-06-26 19:22:26,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:26,031 INFO ]: Finished difference Result 114 states and 6644 transitions. [2018-06-26 19:22:26,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:22:26,031 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 19:22:26,032 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:26,035 INFO ]: With dead ends: 114 [2018-06-26 19:22:26,035 INFO ]: Without dead ends: 114 [2018-06-26 19:22:26,035 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:22:26,035 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-26 19:22:26,042 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 87. [2018-06-26 19:22:26,042 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-26 19:22:26,045 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 6167 transitions. [2018-06-26 19:22:26,045 INFO ]: Start accepts. Automaton has 87 states and 6167 transitions. Word has length 7 [2018-06-26 19:22:26,045 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:26,045 INFO ]: Abstraction has 87 states and 6167 transitions. [2018-06-26 19:22:26,045 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:22:26,045 INFO ]: Start isEmpty. Operand 87 states and 6167 transitions. [2018-06-26 19:22:26,047 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 19:22:26,047 INFO ]: Found error trace [2018-06-26 19:22:26,047 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:22:26,047 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:26,047 INFO ]: Analyzing trace with hash -655409197, now seen corresponding path program 1 times [2018-06-26 19:22:26,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:26,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:26,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:26,048 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:26,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:26,061 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:26,347 WARN ]: Spent 236.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-06-26 19:22:26,600 WARN ]: Spent 208.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-06-26 19:22:26,738 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:26,738 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:26,738 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:26,743 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:26,772 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:26,773 INFO ]: Computing forward predicates... [2018-06-26 19:22:26,778 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:26,797 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 19:22:26,797 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-26 19:22:26,797 INFO ]: Interpolant automaton has 6 states [2018-06-26 19:22:26,797 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 19:22:26,797 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 19:22:26,798 INFO ]: Start difference. First operand 87 states and 6167 transitions. Second operand 6 states. [2018-06-26 19:22:28,435 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:28,435 INFO ]: Finished difference Result 152 states and 10788 transitions. [2018-06-26 19:22:28,435 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 19:22:28,436 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 19:22:28,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:28,439 INFO ]: With dead ends: 152 [2018-06-26 19:22:28,439 INFO ]: Without dead ends: 152 [2018-06-26 19:22:28,440 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-26 19:22:28,440 INFO ]: Start minimizeSevpa. Operand 152 states. [2018-06-26 19:22:28,451 INFO ]: Finished minimizeSevpa. Reduced states from 152 to 143. [2018-06-26 19:22:28,451 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-26 19:22:28,455 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 10475 transitions. [2018-06-26 19:22:28,455 INFO ]: Start accepts. Automaton has 143 states and 10475 transitions. Word has length 7 [2018-06-26 19:22:28,455 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:28,455 INFO ]: Abstraction has 143 states and 10475 transitions. [2018-06-26 19:22:28,455 INFO ]: Interpolant automaton has 6 states. [2018-06-26 19:22:28,455 INFO ]: Start isEmpty. Operand 143 states and 10475 transitions. [2018-06-26 19:22:28,457 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 19:22:28,457 INFO ]: Found error trace [2018-06-26 19:22:28,457 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:22:28,457 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:28,457 INFO ]: Analyzing trace with hash -651774695, now seen corresponding path program 1 times [2018-06-26 19:22:28,457 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:28,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:28,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:28,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:28,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:28,471 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:28,652 WARN ]: Spent 116.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-26 19:22:28,725 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:28,725 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:28,725 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:28,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:28,766 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:28,768 INFO ]: Computing forward predicates... [2018-06-26 19:22:28,839 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:28,868 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:22:28,868 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 19:22:28,868 INFO ]: Interpolant automaton has 8 states [2018-06-26 19:22:28,868 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 19:22:28,868 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-26 19:22:28,868 INFO ]: Start difference. First operand 143 states and 10475 transitions. Second operand 8 states. [2018-06-26 19:22:30,711 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:30,711 INFO ]: Finished difference Result 173 states and 12975 transitions. [2018-06-26 19:22:30,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 19:22:30,712 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-26 19:22:30,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:30,717 INFO ]: With dead ends: 173 [2018-06-26 19:22:30,717 INFO ]: Without dead ends: 173 [2018-06-26 19:22:30,720 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-26 19:22:30,720 INFO ]: Start minimizeSevpa. Operand 173 states. [2018-06-26 19:22:30,741 INFO ]: Finished minimizeSevpa. Reduced states from 173 to 161. [2018-06-26 19:22:30,741 INFO ]: Start removeUnreachable. Operand 161 states. [2018-06-26 19:22:30,749 INFO ]: Finished removeUnreachable. Reduced from 161 states to 161 states and 12015 transitions. [2018-06-26 19:22:30,749 INFO ]: Start accepts. Automaton has 161 states and 12015 transitions. Word has length 7 [2018-06-26 19:22:30,749 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:30,749 INFO ]: Abstraction has 161 states and 12015 transitions. [2018-06-26 19:22:30,749 INFO ]: Interpolant automaton has 8 states. [2018-06-26 19:22:30,749 INFO ]: Start isEmpty. Operand 161 states and 12015 transitions. [2018-06-26 19:22:30,751 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 19:22:30,751 INFO ]: Found error trace [2018-06-26 19:22:30,751 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:22:30,751 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:30,752 INFO ]: Analyzing trace with hash -651685322, now seen corresponding path program 1 times [2018-06-26 19:22:30,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:30,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:30,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:30,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:30,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:30,757 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:30,807 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:30,807 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:22:30,807 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:22:30,807 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:22:30,807 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:22:30,807 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:22:30,807 INFO ]: Start difference. First operand 161 states and 12015 transitions. Second operand 3 states. [2018-06-26 19:22:31,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:31,353 INFO ]: Finished difference Result 156 states and 8632 transitions. [2018-06-26 19:22:31,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:22:31,353 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 19:22:31,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:31,358 INFO ]: With dead ends: 156 [2018-06-26 19:22:31,358 INFO ]: Without dead ends: 156 [2018-06-26 19:22:31,358 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:22:31,358 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-26 19:22:31,375 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 131. [2018-06-26 19:22:31,375 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-26 19:22:31,380 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 8195 transitions. [2018-06-26 19:22:31,380 INFO ]: Start accepts. Automaton has 131 states and 8195 transitions. Word has length 7 [2018-06-26 19:22:31,381 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:31,381 INFO ]: Abstraction has 131 states and 8195 transitions. [2018-06-26 19:22:31,381 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:22:31,381 INFO ]: Start isEmpty. Operand 131 states and 8195 transitions. [2018-06-26 19:22:31,382 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 19:22:31,382 INFO ]: Found error trace [2018-06-26 19:22:31,382 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:22:31,383 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:31,383 INFO ]: Analyzing trace with hash -781037844, now seen corresponding path program 1 times [2018-06-26 19:22:31,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:31,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:31,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:31,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:31,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:31,388 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:31,443 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:31,443 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:22:31,443 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:22:31,443 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:22:31,443 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:22:31,443 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:22:31,443 INFO ]: Start difference. First operand 131 states and 8195 transitions. Second operand 3 states. [2018-06-26 19:22:32,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:32,031 INFO ]: Finished difference Result 160 states and 8246 transitions. [2018-06-26 19:22:32,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:22:32,031 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 19:22:32,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:32,034 INFO ]: With dead ends: 160 [2018-06-26 19:22:32,034 INFO ]: Without dead ends: 160 [2018-06-26 19:22:32,034 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:22:32,034 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-26 19:22:32,061 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 133. [2018-06-26 19:22:32,061 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-26 19:22:32,064 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 7839 transitions. [2018-06-26 19:22:32,064 INFO ]: Start accepts. Automaton has 133 states and 7839 transitions. Word has length 7 [2018-06-26 19:22:32,064 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:32,064 INFO ]: Abstraction has 133 states and 7839 transitions. [2018-06-26 19:22:32,064 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:22:32,064 INFO ]: Start isEmpty. Operand 133 states and 7839 transitions. [2018-06-26 19:22:32,065 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 19:22:32,065 INFO ]: Found error trace [2018-06-26 19:22:32,065 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:22:32,065 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:32,066 INFO ]: Analyzing trace with hash -218583764, now seen corresponding path program 1 times [2018-06-26 19:22:32,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:32,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:32,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:32,067 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:32,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:32,082 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:32,384 WARN ]: Spent 237.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-06-26 19:22:32,453 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:32,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:32,453 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:32,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:32,506 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:32,508 INFO ]: Computing forward predicates... [2018-06-26 19:22:32,933 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:32,956 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:22:32,956 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 19:22:32,956 INFO ]: Interpolant automaton has 8 states [2018-06-26 19:22:32,956 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 19:22:32,956 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-26 19:22:32,956 INFO ]: Start difference. First operand 133 states and 7839 transitions. Second operand 8 states. [2018-06-26 19:22:34,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:22:34,458 INFO ]: Finished difference Result 141 states and 8159 transitions. [2018-06-26 19:22:34,458 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 19:22:34,458 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-26 19:22:34,458 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:22:34,461 INFO ]: With dead ends: 141 [2018-06-26 19:22:34,461 INFO ]: Without dead ends: 141 [2018-06-26 19:22:34,461 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-26 19:22:34,461 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-26 19:22:34,473 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 133. [2018-06-26 19:22:34,474 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-26 19:22:34,479 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 7839 transitions. [2018-06-26 19:22:34,479 INFO ]: Start accepts. Automaton has 133 states and 7839 transitions. Word has length 7 [2018-06-26 19:22:34,479 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:22:34,479 INFO ]: Abstraction has 133 states and 7839 transitions. [2018-06-26 19:22:34,479 INFO ]: Interpolant automaton has 8 states. [2018-06-26 19:22:34,479 INFO ]: Start isEmpty. Operand 133 states and 7839 transitions. [2018-06-26 19:22:34,481 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 19:22:34,481 INFO ]: Found error trace [2018-06-26 19:22:34,481 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:22:34,481 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:22:34,481 INFO ]: Analyzing trace with hash -216796304, now seen corresponding path program 1 times [2018-06-26 19:22:34,482 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:22:34,482 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:22:34,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:34,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:34,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:22:34,492 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:34,647 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:22:34,648 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:22:34,693 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:34,699 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:22:34,734 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:22:34,735 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-26 19:22:35,205 WARN ]: Removed 2 from assertion stack [2018-06-26 19:22:35,205 INFO ]: Timeout while computing interpolants [2018-06-26 19:22:35,406 WARN ]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:22:35,406 WARN ]: Verification canceled [2018-06-26 19:22:35,408 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 19:22:35,408 WARN ]: Timeout [2018-06-26 19:22:35,408 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 07:22:35 BasicIcfg [2018-06-26 19:22:35,408 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 19:22:35,409 INFO ]: Toolchain (without parser) took 60128.68 ms. Allocated memory was 305.1 MB in the beginning and 1.2 GB in the end (delta: 881.3 MB). Free memory was 258.6 MB in the beginning and 1.0 GB in the end (delta: -786.7 MB). Peak memory consumption was 94.6 MB. Max. memory is 3.6 GB. [2018-06-26 19:22:35,410 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 19:22:35,410 INFO ]: ChcToBoogie took 61.22 ms. Allocated memory is still 305.1 MB. Free memory was 257.6 MB in the beginning and 255.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 19:22:35,410 INFO ]: Boogie Preprocessor took 48.12 ms. Allocated memory is still 305.1 MB. Free memory was 255.6 MB in the beginning and 254.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 19:22:35,411 INFO ]: RCFGBuilder took 308.47 ms. Allocated memory is still 305.1 MB. Free memory was 253.6 MB in the beginning and 241.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-26 19:22:35,412 INFO ]: BlockEncodingV2 took 2484.58 ms. Allocated memory was 305.1 MB in the beginning and 364.4 MB in the end (delta: 59.2 MB). Free memory was 241.6 MB in the beginning and 321.6 MB in the end (delta: -79.9 MB). Peak memory consumption was 93.9 MB. Max. memory is 3.6 GB. [2018-06-26 19:22:35,412 INFO ]: TraceAbstraction took 57211.64 ms. Allocated memory was 364.4 MB in the beginning and 1.2 GB in the end (delta: 822.1 MB). Free memory was 319.1 MB in the beginning and 1.0 GB in the end (delta: -726.2 MB). Peak memory consumption was 95.9 MB. Max. memory is 3.6 GB. [2018-06-26 19:22:35,414 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 280 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.22 ms. Allocated memory is still 305.1 MB. Free memory was 257.6 MB in the beginning and 255.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.12 ms. Allocated memory is still 305.1 MB. Free memory was 255.6 MB in the beginning and 254.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 308.47 ms. Allocated memory is still 305.1 MB. Free memory was 253.6 MB in the beginning and 241.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2484.58 ms. Allocated memory was 305.1 MB in the beginning and 364.4 MB in the end (delta: 59.2 MB). Free memory was 241.6 MB in the beginning and 321.6 MB in the end (delta: -79.9 MB). Peak memory consumption was 93.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57211.64 ms. Allocated memory was 364.4 MB in the beginning and 1.2 GB in the end (delta: 822.1 MB). Free memory was 319.1 MB in the beginning and 1.0 GB in the end (delta: -726.2 MB). Peak memory consumption was 95.9 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 8 with TraceHistMax 1, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 12. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 57.1s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 40.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 593 SDtfs, 7 SDslu, 247 SDs, 0 SdLazy, 35571 SolverSat, 7192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=29, 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.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 157 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 6477 SizeOfPredicates, 62 NumberOfNonLiveVariables, 5215 ConjunctsInSsa, 473 ConjunctsInUnsatCore, 54 InterpolantComputations, 14 PerfectInterpolantSequences, 23/83 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/mvs_with_timeouts3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_19-22-35-430.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mvs_with_timeouts3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_19-22-35-430.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mvs_with_timeouts3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_19-22-35-430.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mvs_with_timeouts3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_19-22-35-430.csv Completed graceful shutdown