java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/010-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:02:04,492 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:02:04,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:02:04,509 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:02:04,509 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:02:04,510 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:02:04,511 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:02:04,513 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:02:04,515 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:02:04,516 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:02:04,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:02:04,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:02:04,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:02:04,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:02:04,523 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:02:04,524 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:02:04,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:02:04,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:02:04,540 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:02:04,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:02:04,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:02:04,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:02:04,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:02:04,544 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:02:04,549 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:02:04,550 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:02:04,551 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:02:04,551 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:02:04,552 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:02:04,552 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:02:04,557 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:02:04,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:02:04,558 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:02:04,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:02:04,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:02:04,559 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:02:04,585 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:02:04,585 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:02:04,585 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:02:04,585 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:02:04,589 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:02:04,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:02:04,590 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:02:04,590 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:02:04,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:02:04,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:02:04,590 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:02:04,591 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:02:04,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:02:04,591 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:02:04,591 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:02:04,591 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:02:04,591 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:02:04,592 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:02:04,593 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:02:04,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:02:04,593 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:02:04,594 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:02:04,595 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:02:04,648 INFO ]: Repository-Root is: /tmp [2018-06-24 21:02:04,666 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:02:04,670 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:02:04,672 INFO ]: Initializing SmtParser... [2018-06-24 21:02:04,672 INFO ]: SmtParser initialized [2018-06-24 21:02:04,673 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/010-horn.smt2 [2018-06-24 21:02:04,674 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:02:04,764 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/010-horn.smt2 unknown [2018-06-24 21:02:04,935 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/010-horn.smt2 [2018-06-24 21:02:04,944 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:02:04,953 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:02:04,953 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:02:04,953 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:02:04,954 INFO ]: ChcToBoogie initialized [2018-06-24 21:02:04,956 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:02:04" (1/1) ... [2018-06-24 21:02:05,016 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:02:05 Unit [2018-06-24 21:02:05,016 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:02:05,017 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:02:05,017 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:02:05,017 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:02:05,037 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:02:05" (1/1) ... [2018-06-24 21:02:05,038 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:02:05" (1/1) ... [2018-06-24 21:02:05,043 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:02:05" (1/1) ... [2018-06-24 21:02:05,043 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:02:05" (1/1) ... [2018-06-24 21:02:05,047 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:02:05" (1/1) ... [2018-06-24 21:02:05,049 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:02:05" (1/1) ... [2018-06-24 21:02:05,050 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:02:05" (1/1) ... [2018-06-24 21:02:05,059 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:02:05,060 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:02:05,060 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:02:05,060 INFO ]: RCFGBuilder initialized [2018-06-24 21:02:05,061 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:02:05" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:02:05,077 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:02:05,077 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:02:05,077 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:02:05,077 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:02:05,077 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:02:05,077 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:02:05,323 INFO ]: Using library mode [2018-06-24 21:02:05,324 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:02:05 BoogieIcfgContainer [2018-06-24 21:02:05,324 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:02:05,324 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:02:05,324 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:02:05,325 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:02:05,326 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:02:05" (1/1) ... [2018-06-24 21:02:05,359 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-24 21:02:05,360 INFO ]: Using Remove infeasible edges [2018-06-24 21:02:05,361 INFO ]: Using Maximize final states [2018-06-24 21:02:05,361 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:02:05,361 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:02:05,363 INFO ]: Using Remove sink states [2018-06-24 21:02:05,364 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:02:05,364 INFO ]: Using Use SBE [2018-06-24 21:02:05,380 INFO ]: SBE split 0 edges [2018-06-24 21:02:05,385 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:02:05,396 INFO ]: 0 new accepting states [2018-06-24 21:02:05,436 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 21:02:05,438 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:02:05,442 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:02:05,442 INFO ]: 0 new accepting states [2018-06-24 21:02:05,442 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:02:05,442 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:02:05,442 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-24 21:02:05,443 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:02:05 BasicIcfg [2018-06-24 21:02:05,443 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:02:05,444 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:02:05,444 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:02:05,447 INFO ]: TraceAbstraction initialized [2018-06-24 21:02:05,447 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:02:04" (1/4) ... [2018-06-24 21:02:05,448 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d2b679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:02:05, skipping insertion in model container [2018-06-24 21:02:05,448 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:02:05" (2/4) ... [2018-06-24 21:02:05,449 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d2b679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:02:05, skipping insertion in model container [2018-06-24 21:02:05,449 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:02:05" (3/4) ... [2018-06-24 21:02:05,450 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d2b679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:02:05, skipping insertion in model container [2018-06-24 21:02:05,450 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:02:05" (4/4) ... [2018-06-24 21:02:05,452 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:02:05,471 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:02:05,480 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:02:05,518 INFO ]: Using default assertion order modulation [2018-06-24 21:02:05,518 INFO ]: Interprodecural is true [2018-06-24 21:02:05,518 INFO ]: Hoare is false [2018-06-24 21:02:05,518 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:02:05,518 INFO ]: Backedges is TWOTRACK [2018-06-24 21:02:05,518 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:02:05,518 INFO ]: Difference is false [2018-06-24 21:02:05,518 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:02:05,518 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:02:05,527 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 21:02:05,537 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:02:05,537 INFO ]: Found error trace [2018-06-24 21:02:05,538 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:02:05,538 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:05,543 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-24 21:02:05,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:05,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:05,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:05,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:05,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:05,629 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:05,692 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:05,693 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:02:05,694 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:02:05,695 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:02:05,709 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:02:05,709 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:02:05,711 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 21:02:05,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:05,820 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-24 21:02:05,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:02:05,822 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:02:05,822 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:05,830 INFO ]: With dead ends: 7 [2018-06-24 21:02:05,830 INFO ]: Without dead ends: 7 [2018-06-24 21:02:05,832 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:02:05,846 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:02:05,872 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:02:05,873 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:02:05,873 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-24 21:02:05,875 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-24 21:02:05,875 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:05,875 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-24 21:02:05,875 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:02:05,875 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-24 21:02:05,875 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:02:05,875 INFO ]: Found error trace [2018-06-24 21:02:05,875 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:02:05,875 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:05,875 INFO ]: Analyzing trace with hash 1156261132, now seen corresponding path program 1 times [2018-06-24 21:02:05,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:05,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:05,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:05,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:05,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:05,907 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:06,081 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:06,081 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:06,081 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:06,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:06,156 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:06,165 INFO ]: Computing forward predicates... [2018-06-24 21:02:06,251 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:06,275 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:06,275 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 21:02:06,275 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:02:06,275 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:02:06,276 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:02:06,276 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2018-06-24 21:02:06,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:06,672 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-24 21:02:06,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:02:06,673 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:02:06,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:06,674 INFO ]: With dead ends: 10 [2018-06-24 21:02:06,674 INFO ]: Without dead ends: 10 [2018-06-24 21:02:06,675 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:02:06,675 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:02:06,676 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:02:06,676 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:02:06,676 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-24 21:02:06,677 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 6 [2018-06-24 21:02:06,677 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:06,679 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-24 21:02:06,679 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:02:06,679 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-24 21:02:06,680 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:02:06,680 INFO ]: Found error trace [2018-06-24 21:02:06,680 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:02:06,680 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:06,680 INFO ]: Analyzing trace with hash 1156350505, now seen corresponding path program 1 times [2018-06-24 21:02:06,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:06,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:06,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:06,681 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:06,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:06,710 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:06,812 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:06,812 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:06,812 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:06,825 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:06,852 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:06,853 INFO ]: Computing forward predicates... [2018-06-24 21:02:06,864 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:06,884 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:06,884 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 21:02:06,884 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:02:06,884 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:02:06,884 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:02:06,884 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 5 states. [2018-06-24 21:02:06,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:06,929 INFO ]: Finished difference Result 11 states and 21 transitions. [2018-06-24 21:02:06,929 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:02:06,930 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:02:06,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:06,930 INFO ]: With dead ends: 11 [2018-06-24 21:02:06,930 INFO ]: Without dead ends: 11 [2018-06-24 21:02:06,930 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:02:06,930 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:02:06,935 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 21:02:06,935 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:02:06,936 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2018-06-24 21:02:06,936 INFO ]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 6 [2018-06-24 21:02:06,936 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:06,936 INFO ]: Abstraction has 11 states and 21 transitions. [2018-06-24 21:02:06,936 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:02:06,936 INFO ]: Start isEmpty. Operand 11 states and 21 transitions. [2018-06-24 21:02:06,936 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:02:06,936 INFO ]: Found error trace [2018-06-24 21:02:06,936 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:06,937 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:06,937 INFO ]: Analyzing trace with hash 1486742087, now seen corresponding path program 1 times [2018-06-24 21:02:06,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:06,937 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:06,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:06,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:06,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:06,964 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:07,201 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:07,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:07,201 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:07,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:07,261 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:07,263 INFO ]: Computing forward predicates... [2018-06-24 21:02:07,292 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:07,313 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:07,313 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 21:02:07,313 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:02:07,313 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:02:07,313 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:02:07,313 INFO ]: Start difference. First operand 11 states and 21 transitions. Second operand 7 states. [2018-06-24 21:02:07,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:07,458 INFO ]: Finished difference Result 12 states and 24 transitions. [2018-06-24 21:02:07,458 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:02:07,458 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 21:02:07,458 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:07,458 INFO ]: With dead ends: 12 [2018-06-24 21:02:07,458 INFO ]: Without dead ends: 12 [2018-06-24 21:02:07,459 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:02:07,459 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:02:07,460 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 21:02:07,460 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:02:07,461 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-06-24 21:02:07,461 INFO ]: Start accepts. Automaton has 12 states and 24 transitions. Word has length 7 [2018-06-24 21:02:07,461 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:07,461 INFO ]: Abstraction has 12 states and 24 transitions. [2018-06-24 21:02:07,461 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:02:07,461 INFO ]: Start isEmpty. Operand 12 states and 24 transitions. [2018-06-24 21:02:07,461 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:02:07,461 INFO ]: Found error trace [2018-06-24 21:02:07,461 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 21:02:07,462 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:07,462 INFO ]: Analyzing trace with hash 1486831460, now seen corresponding path program 2 times [2018-06-24 21:02:07,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:07,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:07,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:07,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:07,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:07,473 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:07,539 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:07,539 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:07,539 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:07,546 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:02:07,589 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:02:07,589 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:07,591 INFO ]: Computing forward predicates... [2018-06-24 21:02:07,731 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:07,762 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:02:07,762 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-24 21:02:07,762 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:02:07,762 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:02:07,762 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:02:07,762 INFO ]: Start difference. First operand 12 states and 24 transitions. Second operand 7 states. [2018-06-24 21:02:08,245 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:08,245 INFO ]: Finished difference Result 16 states and 26 transitions. [2018-06-24 21:02:08,249 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:02:08,249 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 21:02:08,249 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:08,249 INFO ]: With dead ends: 16 [2018-06-24 21:02:08,249 INFO ]: Without dead ends: 9 [2018-06-24 21:02:08,250 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:02:08,250 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:02:08,251 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:02:08,251 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:02:08,251 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-24 21:02:08,251 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-24 21:02:08,251 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:08,251 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-24 21:02:08,251 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:02:08,251 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-24 21:02:08,251 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:02:08,251 INFO ]: Found error trace [2018-06-24 21:02:08,251 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:08,251 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:08,252 INFO ]: Analyzing trace with hash -1156020759, now seen corresponding path program 2 times [2018-06-24 21:02:08,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:08,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:08,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:08,252 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:08,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:08,269 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:08,386 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:08,386 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:08,386 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:08,396 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:02:08,415 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:02:08,415 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:08,418 INFO ]: Computing forward predicates... [2018-06-24 21:02:08,453 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:08,474 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:08,474 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 21:02:08,474 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:02:08,475 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:02:08,475 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:02:08,475 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-06-24 21:02:08,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:08,505 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-24 21:02:08,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:02:08,506 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 21:02:08,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:08,506 INFO ]: With dead ends: 10 [2018-06-24 21:02:08,506 INFO ]: Without dead ends: 10 [2018-06-24 21:02:08,506 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:02:08,506 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:02:08,508 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:02:08,508 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:02:08,508 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-24 21:02:08,508 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-24 21:02:08,508 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:08,508 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-24 21:02:08,508 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:02:08,508 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-24 21:02:08,508 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:02:08,508 INFO ]: Found error trace [2018-06-24 21:02:08,508 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:08,509 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:08,509 INFO ]: Analyzing trace with hash -1477290361, now seen corresponding path program 3 times [2018-06-24 21:02:08,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:08,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:08,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:08,509 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:08,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:08,532 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:08,757 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:08,758 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:08,758 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-24 21:02:08,767 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:02:08,790 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:02:08,790 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:08,793 INFO ]: Computing forward predicates... [2018-06-24 21:02:08,809 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:08,832 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:08,832 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 21:02:08,832 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:02:08,832 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:02:08,832 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:02:08,832 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-24 21:02:08,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:08,886 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-24 21:02:08,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:02:08,886 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 21:02:08,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:08,887 INFO ]: With dead ends: 11 [2018-06-24 21:02:08,887 INFO ]: Without dead ends: 11 [2018-06-24 21:02:08,887 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:02:08,887 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:02:08,888 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 21:02:08,888 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:02:08,888 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-24 21:02:08,888 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-24 21:02:08,889 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:08,889 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-24 21:02:08,889 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:02:08,889 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-24 21:02:08,889 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:02:08,889 INFO ]: Found error trace [2018-06-24 21:02:08,889 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:08,889 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:08,889 INFO ]: Analyzing trace with hash 1448253865, now seen corresponding path program 4 times [2018-06-24 21:02:08,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:08,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:08,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:08,890 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:08,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:08,910 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:09,456 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:09,456 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:09,456 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:09,464 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:02:09,491 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:02:09,491 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:09,494 INFO ]: Computing forward predicates... [2018-06-24 21:02:09,561 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:09,580 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:09,580 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 21:02:09,580 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:02:09,580 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:02:09,580 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:02:09,580 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-24 21:02:09,685 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:09,685 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-24 21:02:09,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:02:09,685 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 21:02:09,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:09,685 INFO ]: With dead ends: 12 [2018-06-24 21:02:09,685 INFO ]: Without dead ends: 12 [2018-06-24 21:02:09,686 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:02:09,686 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:02:09,687 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 21:02:09,687 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:02:09,687 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-24 21:02:09,687 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-24 21:02:09,687 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:09,687 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-24 21:02:09,687 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:02:09,687 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-24 21:02:09,687 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:02:09,687 INFO ]: Found error trace [2018-06-24 21:02:09,688 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:09,688 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:09,688 INFO ]: Analyzing trace with hash 1945811655, now seen corresponding path program 5 times [2018-06-24 21:02:09,688 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:09,688 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:09,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:09,688 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:09,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:09,708 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:09,960 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:09,960 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:09,960 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) [2018-06-24 21:02:09,975 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:10,038 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:02:10,038 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:10,041 INFO ]: Computing forward predicates... [2018-06-24 21:02:10,067 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:10,091 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:10,091 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 21:02:10,091 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:02:10,092 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:02:10,092 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:02:10,092 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-06-24 21:02:10,132 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:10,132 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-24 21:02:10,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:02:10,132 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 21:02:10,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:10,133 INFO ]: With dead ends: 13 [2018-06-24 21:02:10,133 INFO ]: Without dead ends: 13 [2018-06-24 21:02:10,133 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:02:10,133 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:02:10,134 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 21:02:10,134 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:02:10,134 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-24 21:02:10,134 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-24 21:02:10,134 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:10,134 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-24 21:02:10,134 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:02:10,134 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-24 21:02:10,134 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:02:10,134 INFO ]: Found error trace [2018-06-24 21:02:10,134 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:10,134 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:10,134 INFO ]: Analyzing trace with hash 190233961, now seen corresponding path program 6 times [2018-06-24 21:02:10,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:10,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:10,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:10,135 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:10,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:10,163 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:10,322 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:10,322 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:10,322 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:10,334 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:02:10,369 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 21:02:10,369 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:10,372 INFO ]: Computing forward predicates... [2018-06-24 21:02:10,398 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:10,431 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:10,431 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 21:02:10,431 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:02:10,431 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:02:10,431 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:02:10,431 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-06-24 21:02:10,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:10,481 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-24 21:02:10,481 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:02:10,481 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-24 21:02:10,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:10,481 INFO ]: With dead ends: 14 [2018-06-24 21:02:10,481 INFO ]: Without dead ends: 14 [2018-06-24 21:02:10,482 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:02:10,482 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:02:10,482 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 21:02:10,483 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:02:10,483 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-24 21:02:10,483 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-24 21:02:10,483 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:10,483 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-24 21:02:10,483 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:02:10,483 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-24 21:02:10,483 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:02:10,483 INFO ]: Found error trace [2018-06-24 21:02:10,483 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:10,483 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:10,484 INFO ]: Analyzing trace with hash 1601900295, now seen corresponding path program 7 times [2018-06-24 21:02:10,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:10,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:10,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:10,484 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:10,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:10,509 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:11,689 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:11,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:11,689 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:11,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:11,750 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:11,754 INFO ]: Computing forward predicates... [2018-06-24 21:02:11,864 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:11,897 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:11,897 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 21:02:11,897 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:02:11,897 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:02:11,897 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:02:11,897 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-06-24 21:02:12,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:12,101 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-24 21:02:12,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:02:12,101 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 21:02:12,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:12,102 INFO ]: With dead ends: 15 [2018-06-24 21:02:12,102 INFO ]: Without dead ends: 15 [2018-06-24 21:02:12,102 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:02:12,102 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:02:12,103 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 21:02:12,103 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:02:12,104 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-24 21:02:12,104 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-24 21:02:12,104 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:12,104 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-24 21:02:12,104 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:02:12,104 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-24 21:02:12,104 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:02:12,104 INFO ]: Found error trace [2018-06-24 21:02:12,104 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:12,104 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:12,104 INFO ]: Analyzing trace with hash -1881083607, now seen corresponding path program 8 times [2018-06-24 21:02:12,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:12,105 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:12,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:12,105 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:12,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:12,125 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:12,433 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:12,433 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:12,433 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:12,439 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:02:12,477 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:02:12,477 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:12,481 INFO ]: Computing forward predicates... [2018-06-24 21:02:12,507 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:12,527 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:12,527 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 21:02:12,527 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:02:12,527 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:02:12,527 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:02:12,528 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-06-24 21:02:12,643 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:12,643 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-24 21:02:12,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:02:12,644 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-24 21:02:12,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:12,644 INFO ]: With dead ends: 16 [2018-06-24 21:02:12,644 INFO ]: Without dead ends: 16 [2018-06-24 21:02:12,644 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:02:12,644 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:02:12,647 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 21:02:12,647 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:02:12,647 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-24 21:02:12,647 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-24 21:02:12,647 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:12,647 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-24 21:02:12,647 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:02:12,647 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-24 21:02:12,647 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:02:12,647 INFO ]: Found error trace [2018-06-24 21:02:12,647 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:12,647 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:12,648 INFO ]: Analyzing trace with hash 1815565127, now seen corresponding path program 9 times [2018-06-24 21:02:12,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:12,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:12,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:12,648 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:12,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:12,665 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:12,980 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:12,980 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:12,980 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:12,985 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:02:13,070 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:02:13,070 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:13,075 INFO ]: Computing forward predicates... [2018-06-24 21:02:13,101 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:13,125 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:13,125 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 21:02:13,125 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:02:13,125 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:02:13,125 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:02:13,126 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-06-24 21:02:13,213 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:13,213 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-24 21:02:13,213 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:02:13,213 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-24 21:02:13,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:13,214 INFO ]: With dead ends: 17 [2018-06-24 21:02:13,214 INFO ]: Without dead ends: 17 [2018-06-24 21:02:13,214 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:02:13,214 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:02:13,215 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 21:02:13,215 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:02:13,215 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-24 21:02:13,216 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-24 21:02:13,216 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:13,216 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-24 21:02:13,216 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:02:13,216 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-24 21:02:13,216 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:02:13,216 INFO ]: Found error trace [2018-06-24 21:02:13,216 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:13,216 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:13,216 INFO ]: Analyzing trace with hash 447558889, now seen corresponding path program 10 times [2018-06-24 21:02:13,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:13,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:13,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:13,217 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:13,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:13,242 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:13,488 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:13,488 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:13,488 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:13,506 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:02:13,558 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:02:13,558 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:13,564 INFO ]: Computing forward predicates... [2018-06-24 21:02:13,740 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:13,765 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:13,765 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-24 21:02:13,765 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:02:13,765 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:02:13,765 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:02:13,765 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2018-06-24 21:02:13,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:13,920 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-24 21:02:13,920 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:02:13,920 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-24 21:02:13,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:13,921 INFO ]: With dead ends: 18 [2018-06-24 21:02:13,921 INFO ]: Without dead ends: 18 [2018-06-24 21:02:13,921 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:02:13,921 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 21:02:13,922 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 21:02:13,922 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:02:13,923 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-24 21:02:13,923 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-24 21:02:13,923 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:13,923 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-24 21:02:13,923 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:02:13,923 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-24 21:02:13,923 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:02:13,923 INFO ]: Found error trace [2018-06-24 21:02:13,923 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:13,924 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:13,924 INFO ]: Analyzing trace with hash 989038471, now seen corresponding path program 11 times [2018-06-24 21:02:13,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:13,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:13,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:13,924 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:13,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:13,944 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:14,251 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:14,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:14,251 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:14,257 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:02:14,312 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 21:02:14,312 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:14,318 INFO ]: Computing forward predicates... [2018-06-24 21:02:14,345 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:14,376 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:14,376 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 21:02:14,376 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:02:14,376 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:02:14,376 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:02:14,377 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2018-06-24 21:02:14,488 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:14,488 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-24 21:02:14,488 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:02:14,488 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-24 21:02:14,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:14,488 INFO ]: With dead ends: 19 [2018-06-24 21:02:14,489 INFO ]: Without dead ends: 19 [2018-06-24 21:02:14,489 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:02:14,489 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 21:02:14,490 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 21:02:14,490 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:02:14,490 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-24 21:02:14,491 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-24 21:02:14,491 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:14,491 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-24 21:02:14,491 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:02:14,491 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-24 21:02:14,491 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:02:14,491 INFO ]: Found error trace [2018-06-24 21:02:14,491 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:14,491 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:14,491 INFO ]: Analyzing trace with hash 595036329, now seen corresponding path program 12 times [2018-06-24 21:02:14,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:14,491 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:14,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:14,492 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:14,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:14,514 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:15,030 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:15,030 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:15,030 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) [2018-06-24 21:02:15,046 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:15,151 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 21:02:15,151 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:15,158 INFO ]: Computing forward predicates... [2018-06-24 21:02:15,212 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:15,244 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:15,244 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-24 21:02:15,244 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:02:15,245 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:02:15,245 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:02:15,245 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2018-06-24 21:02:15,537 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:15,537 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-24 21:02:15,537 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:02:15,537 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-24 21:02:15,537 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:15,537 INFO ]: With dead ends: 20 [2018-06-24 21:02:15,537 INFO ]: Without dead ends: 20 [2018-06-24 21:02:15,538 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:02:15,538 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 21:02:15,540 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 21:02:15,540 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:02:15,540 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-24 21:02:15,540 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-24 21:02:15,540 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:15,540 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-24 21:02:15,540 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:02:15,540 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-24 21:02:15,541 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:02:15,541 INFO ]: Found error trace [2018-06-24 21:02:15,541 INFO ]: trace histogram [13, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:15,541 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:15,541 INFO ]: Analyzing trace with hash 1265871815, now seen corresponding path program 13 times [2018-06-24 21:02:15,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:15,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:15,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:15,542 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:15,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:15,575 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:16,732 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:16,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:16,732 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:16,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:16,791 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:16,797 INFO ]: Computing forward predicates... [2018-06-24 21:02:16,822 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:16,853 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:16,853 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-24 21:02:16,853 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:02:16,853 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:02:16,853 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:02:16,853 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2018-06-24 21:02:17,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:17,332 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-24 21:02:17,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:02:17,333 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-24 21:02:17,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:17,333 INFO ]: With dead ends: 21 [2018-06-24 21:02:17,333 INFO ]: Without dead ends: 21 [2018-06-24 21:02:17,333 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:02:17,333 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 21:02:17,334 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 21:02:17,334 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:02:17,335 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-24 21:02:17,335 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-24 21:02:17,335 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:17,335 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-24 21:02:17,335 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:02:17,335 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-24 21:02:17,335 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:02:17,335 INFO ]: Found error trace [2018-06-24 21:02:17,335 INFO ]: trace histogram [14, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:17,335 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:17,335 INFO ]: Analyzing trace with hash 586935401, now seen corresponding path program 14 times [2018-06-24 21:02:17,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:17,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:17,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:17,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:17,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:17,363 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:17,876 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:17,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:17,912 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:17,921 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:02:18,008 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:02:18,008 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:18,021 INFO ]: Computing forward predicates... [2018-06-24 21:02:18,167 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:18,186 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:18,186 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-24 21:02:18,186 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:02:18,187 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:02:18,187 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:02:18,187 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2018-06-24 21:02:18,415 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:18,415 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-24 21:02:18,415 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 21:02:18,415 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-24 21:02:18,415 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:18,415 INFO ]: With dead ends: 22 [2018-06-24 21:02:18,415 INFO ]: Without dead ends: 22 [2018-06-24 21:02:18,416 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:02:18,416 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:02:18,417 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 21:02:18,417 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 21:02:18,418 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-24 21:02:18,418 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-24 21:02:18,418 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:18,418 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-24 21:02:18,418 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:02:18,418 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-24 21:02:18,419 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:02:18,419 INFO ]: Found error trace [2018-06-24 21:02:18,419 INFO ]: trace histogram [15, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:18,419 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:18,419 INFO ]: Analyzing trace with hash 1014743047, now seen corresponding path program 15 times [2018-06-24 21:02:18,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:18,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:18,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:18,420 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:18,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:18,446 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:18,951 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:18,951 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:18,951 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:18,956 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:02:19,024 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 21:02:19,024 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:19,030 INFO ]: Computing forward predicates... [2018-06-24 21:02:19,069 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:19,089 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:19,089 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-24 21:02:19,089 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:02:19,089 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:02:19,090 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:02:19,090 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2018-06-24 21:02:19,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:19,299 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-24 21:02:19,300 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 21:02:19,300 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-24 21:02:19,300 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:19,300 INFO ]: With dead ends: 23 [2018-06-24 21:02:19,300 INFO ]: Without dead ends: 23 [2018-06-24 21:02:19,301 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:02:19,301 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 21:02:19,303 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 21:02:19,303 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:02:19,303 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-24 21:02:19,303 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-24 21:02:19,305 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:19,305 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-24 21:02:19,305 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:02:19,305 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-24 21:02:19,305 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:02:19,305 INFO ]: Found error trace [2018-06-24 21:02:19,305 INFO ]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:19,305 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:19,305 INFO ]: Analyzing trace with hash 1391878185, now seen corresponding path program 16 times [2018-06-24 21:02:19,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:19,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:19,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:19,306 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:19,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:19,331 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:19,773 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:19,773 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:19,773 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:19,780 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:02:19,842 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:02:19,842 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:19,849 INFO ]: Computing forward predicates... [2018-06-24 21:02:19,906 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:19,937 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:19,937 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-24 21:02:19,937 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:02:19,937 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:02:19,937 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:02:19,937 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2018-06-24 21:02:20,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:20,166 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-24 21:02:20,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 21:02:20,166 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-24 21:02:20,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:20,167 INFO ]: With dead ends: 24 [2018-06-24 21:02:20,167 INFO ]: Without dead ends: 24 [2018-06-24 21:02:20,167 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:02:20,167 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 21:02:20,168 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 21:02:20,168 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 21:02:20,169 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-24 21:02:20,169 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-24 21:02:20,169 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:20,169 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-24 21:02:20,169 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:02:20,169 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-24 21:02:20,169 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 21:02:20,169 INFO ]: Found error trace [2018-06-24 21:02:20,169 INFO ]: trace histogram [17, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:20,169 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:20,169 INFO ]: Analyzing trace with hash 198165575, now seen corresponding path program 17 times [2018-06-24 21:02:20,169 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:20,169 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:20,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:20,170 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:20,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:20,195 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:20,584 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:20,584 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:20,584 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:20,589 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:02:20,670 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 21:02:20,670 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:20,683 INFO ]: Computing forward predicates... [2018-06-24 21:02:20,704 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:20,723 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:20,723 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-24 21:02:20,723 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:02:20,723 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:02:20,723 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:02:20,724 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-06-24 21:02:20,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:20,952 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-24 21:02:20,953 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 21:02:20,953 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-24 21:02:20,953 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:20,953 INFO ]: With dead ends: 25 [2018-06-24 21:02:20,953 INFO ]: Without dead ends: 25 [2018-06-24 21:02:20,954 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:02:20,954 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 21:02:20,955 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 21:02:20,955 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 21:02:20,956 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-24 21:02:20,956 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-24 21:02:20,956 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:20,956 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-24 21:02:20,956 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:02:20,956 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-24 21:02:20,956 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:02:20,956 INFO ]: Found error trace [2018-06-24 21:02:20,956 INFO ]: trace histogram [18, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:20,957 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:20,957 INFO ]: Analyzing trace with hash 1847780329, now seen corresponding path program 18 times [2018-06-24 21:02:20,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:20,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:20,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:20,957 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:20,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:20,994 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:21,846 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:21,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:21,846 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:21,855 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:02:21,949 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-24 21:02:21,949 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:21,957 INFO ]: Computing forward predicates... [2018-06-24 21:02:21,982 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:22,016 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:22,016 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-24 21:02:22,017 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:02:22,017 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:02:22,017 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:02:22,017 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2018-06-24 21:02:22,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:22,390 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-24 21:02:22,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:02:22,392 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-24 21:02:22,392 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:22,392 INFO ]: With dead ends: 26 [2018-06-24 21:02:22,392 INFO ]: Without dead ends: 26 [2018-06-24 21:02:22,393 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:02:22,393 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 21:02:22,394 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 21:02:22,394 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 21:02:22,394 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-24 21:02:22,394 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-24 21:02:22,395 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:22,395 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-24 21:02:22,395 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:02:22,395 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-24 21:02:22,395 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 21:02:22,395 INFO ]: Found error trace [2018-06-24 21:02:22,395 INFO ]: trace histogram [19, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:22,395 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:22,395 INFO ]: Analyzing trace with hash 1446230151, now seen corresponding path program 19 times [2018-06-24 21:02:22,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:22,395 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:22,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:22,396 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:22,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:22,430 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:23,830 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:23,830 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:23,830 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:23,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:23,938 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:23,948 INFO ]: Computing forward predicates... [2018-06-24 21:02:23,996 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:24,015 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:24,016 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-24 21:02:24,016 INFO ]: Interpolant automaton has 23 states [2018-06-24 21:02:24,016 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 21:02:24,016 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:02:24,016 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-06-24 21:02:24,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:24,371 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-24 21:02:24,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 21:02:24,372 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-24 21:02:24,373 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:24,373 INFO ]: With dead ends: 27 [2018-06-24 21:02:24,373 INFO ]: Without dead ends: 27 [2018-06-24 21:02:24,373 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:02:24,373 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 21:02:24,375 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 21:02:24,375 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 21:02:24,375 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-24 21:02:24,375 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-24 21:02:24,375 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:24,375 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-24 21:02:24,375 INFO ]: Interpolant automaton has 23 states. [2018-06-24 21:02:24,375 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-24 21:02:24,376 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:02:24,376 INFO ]: Found error trace [2018-06-24 21:02:24,376 INFO ]: trace histogram [20, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:24,376 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:24,376 INFO ]: Analyzing trace with hash 1883076521, now seen corresponding path program 20 times [2018-06-24 21:02:24,376 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:24,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:24,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:24,376 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:24,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:24,406 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:24,863 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:24,863 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:24,863 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:24,869 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:02:24,949 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:02:24,949 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:24,957 INFO ]: Computing forward predicates... [2018-06-24 21:02:24,994 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:25,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:25,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-24 21:02:25,026 INFO ]: Interpolant automaton has 24 states [2018-06-24 21:02:25,026 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 21:02:25,027 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:02:25,027 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-06-24 21:02:25,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:25,433 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-24 21:02:25,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 21:02:25,434 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-24 21:02:25,537 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:25,537 INFO ]: With dead ends: 28 [2018-06-24 21:02:25,537 INFO ]: Without dead ends: 28 [2018-06-24 21:02:25,538 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:02:25,538 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 21:02:25,540 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 21:02:25,540 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 21:02:25,541 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-24 21:02:25,541 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-24 21:02:25,541 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:25,541 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-24 21:02:25,541 INFO ]: Interpolant automaton has 24 states. [2018-06-24 21:02:25,541 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-24 21:02:25,541 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:02:25,541 INFO ]: Found error trace [2018-06-24 21:02:25,541 INFO ]: trace histogram [21, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:25,541 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:25,541 INFO ]: Analyzing trace with hash -1754555193, now seen corresponding path program 21 times [2018-06-24 21:02:25,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:25,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:25,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:25,542 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:25,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:25,576 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:26,082 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:26,082 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:26,082 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:26,087 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:02:26,178 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-24 21:02:26,178 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:26,186 INFO ]: Computing forward predicates... [2018-06-24 21:02:26,251 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:26,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:26,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-24 21:02:26,283 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:02:26,283 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:02:26,283 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:02:26,284 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2018-06-24 21:02:27,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:27,039 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-24 21:02:27,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 21:02:27,039 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-24 21:02:27,039 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:27,040 INFO ]: With dead ends: 29 [2018-06-24 21:02:27,040 INFO ]: Without dead ends: 29 [2018-06-24 21:02:27,040 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:02:27,040 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:02:27,042 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 21:02:27,042 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:02:27,042 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-24 21:02:27,042 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-24 21:02:27,042 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:27,042 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-24 21:02:27,042 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:02:27,042 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-24 21:02:27,043 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 21:02:27,043 INFO ]: Found error trace [2018-06-24 21:02:27,043 INFO ]: trace histogram [22, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:27,043 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:27,043 INFO ]: Analyzing trace with hash 1442978665, now seen corresponding path program 22 times [2018-06-24 21:02:27,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:27,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:27,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:27,043 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:27,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:27,091 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:27,902 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:27,902 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:27,902 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:27,909 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:02:27,992 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:02:27,992 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:28,000 INFO ]: Computing forward predicates... [2018-06-24 21:02:28,043 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:28,062 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:28,062 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-24 21:02:28,062 INFO ]: Interpolant automaton has 26 states [2018-06-24 21:02:28,062 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 21:02:28,063 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:02:28,063 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-06-24 21:02:28,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:28,428 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-24 21:02:28,428 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 21:02:28,428 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-24 21:02:28,428 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:28,429 INFO ]: With dead ends: 30 [2018-06-24 21:02:28,429 INFO ]: Without dead ends: 30 [2018-06-24 21:02:28,429 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:02:28,429 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 21:02:28,430 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 21:02:28,430 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 21:02:28,431 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-24 21:02:28,431 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-24 21:02:28,431 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:28,431 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-24 21:02:28,431 INFO ]: Interpolant automaton has 26 states. [2018-06-24 21:02:28,431 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-24 21:02:28,434 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 21:02:28,434 INFO ]: Found error trace [2018-06-24 21:02:28,434 INFO ]: trace histogram [23, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:28,434 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:28,434 INFO ]: Analyzing trace with hash 1782280455, now seen corresponding path program 23 times [2018-06-24 21:02:28,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:28,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:28,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:28,435 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:28,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:28,474 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:29,148 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:29,148 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:29,196 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:29,203 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:02:29,326 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-24 21:02:29,326 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:29,353 INFO ]: Computing forward predicates... [2018-06-24 21:02:29,386 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:29,414 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:29,415 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-24 21:02:29,415 INFO ]: Interpolant automaton has 27 states [2018-06-24 21:02:29,415 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 21:02:29,415 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:02:29,415 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2018-06-24 21:02:29,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:29,868 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-24 21:02:29,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 21:02:29,868 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-24 21:02:29,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:29,869 INFO ]: With dead ends: 31 [2018-06-24 21:02:29,869 INFO ]: Without dead ends: 31 [2018-06-24 21:02:29,869 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:02:29,869 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 21:02:29,871 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 21:02:29,871 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 21:02:29,871 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-24 21:02:29,872 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-24 21:02:29,872 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:29,872 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-24 21:02:29,872 INFO ]: Interpolant automaton has 27 states. [2018-06-24 21:02:29,872 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-24 21:02:29,872 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 21:02:29,872 INFO ]: Found error trace [2018-06-24 21:02:29,872 INFO ]: trace histogram [24, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:29,872 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:29,872 INFO ]: Analyzing trace with hash -584265943, now seen corresponding path program 24 times [2018-06-24 21:02:29,872 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:29,872 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:29,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:29,873 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:29,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:29,912 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:30,801 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:30,801 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:30,801 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:30,807 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:02:30,960 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-24 21:02:30,960 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:30,970 INFO ]: Computing forward predicates... [2018-06-24 21:02:30,995 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:31,014 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:31,014 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-24 21:02:31,014 INFO ]: Interpolant automaton has 28 states [2018-06-24 21:02:31,014 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 21:02:31,014 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:02:31,015 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-06-24 21:02:31,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:31,603 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-24 21:02:31,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 21:02:31,606 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-24 21:02:31,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:31,606 INFO ]: With dead ends: 32 [2018-06-24 21:02:31,606 INFO ]: Without dead ends: 32 [2018-06-24 21:02:31,606 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:02:31,607 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 21:02:31,608 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 21:02:31,608 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 21:02:31,609 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-24 21:02:31,609 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-24 21:02:31,609 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:31,609 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-24 21:02:31,609 INFO ]: Interpolant automaton has 28 states. [2018-06-24 21:02:31,609 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-24 21:02:31,609 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 21:02:31,609 INFO ]: Found error trace [2018-06-24 21:02:31,609 INFO ]: trace histogram [25, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:31,609 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:31,609 INFO ]: Analyzing trace with hash -932760249, now seen corresponding path program 25 times [2018-06-24 21:02:31,610 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:31,610 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:31,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:31,610 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:31,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:31,652 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:32,468 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:32,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:32,468 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:32,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:32,571 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:32,580 INFO ]: Computing forward predicates... [2018-06-24 21:02:32,616 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:32,638 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:32,638 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-24 21:02:32,638 INFO ]: Interpolant automaton has 29 states [2018-06-24 21:02:32,638 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 21:02:32,639 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:02:32,639 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-24 21:02:33,175 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:33,175 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-24 21:02:33,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 21:02:33,177 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-24 21:02:33,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:33,177 INFO ]: With dead ends: 33 [2018-06-24 21:02:33,177 INFO ]: Without dead ends: 33 [2018-06-24 21:02:33,178 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:02:33,178 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 21:02:33,179 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 21:02:33,179 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 21:02:33,180 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-24 21:02:33,180 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-24 21:02:33,180 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:33,180 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-24 21:02:33,180 INFO ]: Interpolant automaton has 29 states. [2018-06-24 21:02:33,180 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-24 21:02:33,180 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:02:33,180 INFO ]: Found error trace [2018-06-24 21:02:33,180 INFO ]: trace histogram [26, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:33,180 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:33,181 INFO ]: Analyzing trace with hash 1148818153, now seen corresponding path program 26 times [2018-06-24 21:02:33,181 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:33,181 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:33,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:33,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:33,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:33,230 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:34,066 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:34,066 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:34,066 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:34,072 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:02:34,177 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:02:34,177 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:34,187 INFO ]: Computing forward predicates... [2018-06-24 21:02:34,233 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:34,264 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:34,264 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-24 21:02:34,265 INFO ]: Interpolant automaton has 30 states [2018-06-24 21:02:34,265 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 21:02:34,265 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:02:34,265 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2018-06-24 21:02:34,904 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:34,905 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-24 21:02:34,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 21:02:34,905 INFO ]: Start accepts. Automaton has 30 states. Word has length 32 [2018-06-24 21:02:34,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:34,906 INFO ]: With dead ends: 34 [2018-06-24 21:02:34,906 INFO ]: Without dead ends: 34 [2018-06-24 21:02:34,906 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:02:34,906 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 21:02:34,908 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 21:02:34,908 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:02:34,908 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-24 21:02:34,908 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-24 21:02:34,908 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:34,908 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-24 21:02:34,908 INFO ]: Interpolant automaton has 30 states. [2018-06-24 21:02:34,908 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-24 21:02:34,909 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 21:02:34,909 INFO ]: Found error trace [2018-06-24 21:02:34,909 INFO ]: trace histogram [27, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:34,909 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:34,909 INFO ]: Analyzing trace with hash 1253239175, now seen corresponding path program 27 times [2018-06-24 21:02:34,909 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:34,909 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:34,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:34,910 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:34,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:34,946 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:35,769 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:35,769 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:35,769 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:35,775 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:02:35,892 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-24 21:02:35,892 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:35,901 INFO ]: Computing forward predicates... [2018-06-24 21:02:35,924 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:35,944 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:35,944 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-24 21:02:35,944 INFO ]: Interpolant automaton has 31 states [2018-06-24 21:02:35,944 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 21:02:35,944 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:02:35,944 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2018-06-24 21:02:36,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:36,477 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-24 21:02:36,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 21:02:36,477 INFO ]: Start accepts. Automaton has 31 states. Word has length 33 [2018-06-24 21:02:36,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:36,478 INFO ]: With dead ends: 35 [2018-06-24 21:02:36,478 INFO ]: Without dead ends: 35 [2018-06-24 21:02:36,478 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:02:36,478 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:02:36,480 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 21:02:36,480 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 21:02:36,480 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-24 21:02:36,480 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-24 21:02:36,480 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:36,480 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-24 21:02:36,480 INFO ]: Interpolant automaton has 31 states. [2018-06-24 21:02:36,480 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-24 21:02:36,481 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 21:02:36,481 INFO ]: Found error trace [2018-06-24 21:02:36,481 INFO ]: trace histogram [28, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:36,481 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:36,481 INFO ]: Analyzing trace with hash 195323561, now seen corresponding path program 28 times [2018-06-24 21:02:36,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:36,481 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:36,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:36,482 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:36,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:36,529 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:37,343 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:37,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:37,343 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:37,348 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:02:37,465 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:02:37,465 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:37,475 INFO ]: Computing forward predicates... [2018-06-24 21:02:37,501 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:37,532 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:37,532 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-24 21:02:37,532 INFO ]: Interpolant automaton has 32 states [2018-06-24 21:02:37,532 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 21:02:37,533 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:02:37,533 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2018-06-24 21:02:38,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:38,215 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-24 21:02:38,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 21:02:38,215 INFO ]: Start accepts. Automaton has 32 states. Word has length 34 [2018-06-24 21:02:38,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:38,215 INFO ]: With dead ends: 36 [2018-06-24 21:02:38,215 INFO ]: Without dead ends: 36 [2018-06-24 21:02:38,216 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:02:38,216 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 21:02:38,217 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 21:02:38,217 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 21:02:38,217 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-24 21:02:38,217 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-24 21:02:38,217 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:38,217 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-24 21:02:38,217 INFO ]: Interpolant automaton has 32 states. [2018-06-24 21:02:38,219 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-24 21:02:38,219 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 21:02:38,219 INFO ]: Found error trace [2018-06-24 21:02:38,219 INFO ]: trace histogram [29, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:38,219 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:38,219 INFO ]: Analyzing trace with hash 1759677895, now seen corresponding path program 29 times [2018-06-24 21:02:38,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:38,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:38,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:38,220 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:38,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:38,268 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:39,089 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:39,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:39,089 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:39,094 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:02:39,385 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-24 21:02:39,385 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:39,456 INFO ]: Computing forward predicates... [2018-06-24 21:02:39,508 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:39,533 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:39,533 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-24 21:02:39,533 INFO ]: Interpolant automaton has 33 states [2018-06-24 21:02:39,533 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 21:02:39,533 INFO ]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:02:39,533 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2018-06-24 21:02:40,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:40,282 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-24 21:02:40,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 21:02:40,283 INFO ]: Start accepts. Automaton has 33 states. Word has length 35 [2018-06-24 21:02:40,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:40,283 INFO ]: With dead ends: 37 [2018-06-24 21:02:40,283 INFO ]: Without dead ends: 37 [2018-06-24 21:02:40,283 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:02:40,283 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 21:02:40,284 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 21:02:40,284 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 21:02:40,285 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-24 21:02:40,285 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-24 21:02:40,285 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:40,285 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-24 21:02:40,285 INFO ]: Interpolant automaton has 33 states. [2018-06-24 21:02:40,285 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-24 21:02:40,285 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 21:02:40,285 INFO ]: Found error trace [2018-06-24 21:02:40,285 INFO ]: trace histogram [30, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:40,285 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:40,285 INFO ]: Analyzing trace with hash -1284945303, now seen corresponding path program 30 times [2018-06-24 21:02:40,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:40,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:40,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:40,286 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:40,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:40,325 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:41,113 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:41,113 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:41,113 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:41,125 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:02:41,262 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-06-24 21:02:41,262 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:41,275 INFO ]: Computing forward predicates... [2018-06-24 21:02:41,299 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:41,318 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:41,319 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-24 21:02:41,319 INFO ]: Interpolant automaton has 34 states [2018-06-24 21:02:41,319 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 21:02:41,319 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:02:41,319 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-06-24 21:02:42,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:42,136 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-24 21:02:42,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 21:02:42,136 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-24 21:02:42,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:42,136 INFO ]: With dead ends: 38 [2018-06-24 21:02:42,136 INFO ]: Without dead ends: 38 [2018-06-24 21:02:42,137 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:02:42,137 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 21:02:42,138 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 21:02:42,138 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 21:02:42,139 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-24 21:02:42,139 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-24 21:02:42,139 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:42,139 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-24 21:02:42,139 INFO ]: Interpolant automaton has 34 states. [2018-06-24 21:02:42,139 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-24 21:02:42,139 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 21:02:42,139 INFO ]: Found error trace [2018-06-24 21:02:42,139 INFO ]: trace histogram [31, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:42,139 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:42,139 INFO ]: Analyzing trace with hash -1178983929, now seen corresponding path program 31 times [2018-06-24 21:02:42,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:42,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:42,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:42,140 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:42,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:42,184 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:44,171 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:44,171 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:44,171 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:44,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:44,309 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:44,323 INFO ]: Computing forward predicates... [2018-06-24 21:02:44,473 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:44,500 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:44,500 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-24 21:02:44,501 INFO ]: Interpolant automaton has 35 states [2018-06-24 21:02:44,501 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 21:02:44,501 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:02:44,501 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2018-06-24 21:02:45,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:45,336 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-24 21:02:45,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 21:02:45,336 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-24 21:02:45,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:45,337 INFO ]: With dead ends: 39 [2018-06-24 21:02:45,337 INFO ]: Without dead ends: 39 [2018-06-24 21:02:45,337 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:02:45,337 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 21:02:45,338 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 21:02:45,338 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 21:02:45,339 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-24 21:02:45,339 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-24 21:02:45,339 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:45,339 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-24 21:02:45,339 INFO ]: Interpolant automaton has 35 states. [2018-06-24 21:02:45,339 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-24 21:02:45,339 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 21:02:45,339 INFO ]: Found error trace [2018-06-24 21:02:45,339 INFO ]: trace histogram [32, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:45,339 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:45,339 INFO ]: Analyzing trace with hash 2105818665, now seen corresponding path program 32 times [2018-06-24 21:02:45,339 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:45,339 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:45,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:45,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:02:45,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:45,400 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:46,621 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:46,621 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:46,621 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:46,640 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:02:46,784 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:02:46,784 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:46,797 INFO ]: Computing forward predicates... [2018-06-24 21:02:46,837 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:46,870 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:46,870 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-24 21:02:46,870 INFO ]: Interpolant automaton has 36 states [2018-06-24 21:02:46,870 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 21:02:46,870 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:02:46,870 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2018-06-24 21:02:48,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:48,037 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-24 21:02:48,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 21:02:48,037 INFO ]: Start accepts. Automaton has 36 states. Word has length 38 [2018-06-24 21:02:48,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:48,038 INFO ]: With dead ends: 40 [2018-06-24 21:02:48,038 INFO ]: Without dead ends: 40 [2018-06-24 21:02:48,038 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:02:48,038 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 21:02:48,040 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 21:02:48,040 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 21:02:48,040 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-24 21:02:48,040 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-24 21:02:48,040 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:48,040 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-24 21:02:48,040 INFO ]: Interpolant automaton has 36 states. [2018-06-24 21:02:48,040 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-24 21:02:48,040 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 21:02:48,040 INFO ]: Found error trace [2018-06-24 21:02:48,040 INFO ]: trace histogram [33, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:48,041 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:48,041 INFO ]: Analyzing trace with hash 855483975, now seen corresponding path program 33 times [2018-06-24 21:02:48,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:48,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:48,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:48,041 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:48,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:48,092 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:49,504 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:49,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:49,504 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:49,509 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:02:49,696 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-24 21:02:49,696 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:49,708 INFO ]: Computing forward predicates... [2018-06-24 21:02:49,746 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:49,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:49,770 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-06-24 21:02:49,770 INFO ]: Interpolant automaton has 37 states [2018-06-24 21:02:49,770 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 21:02:49,770 INFO ]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 21:02:49,770 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2018-06-24 21:02:50,678 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:50,678 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-24 21:02:50,678 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 21:02:50,678 INFO ]: Start accepts. Automaton has 37 states. Word has length 39 [2018-06-24 21:02:50,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:50,679 INFO ]: With dead ends: 41 [2018-06-24 21:02:50,679 INFO ]: Without dead ends: 41 [2018-06-24 21:02:50,679 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 21:02:50,679 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 21:02:50,680 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 21:02:50,680 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 21:02:50,681 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-24 21:02:50,681 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-24 21:02:50,681 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:50,681 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-24 21:02:50,681 INFO ]: Interpolant automaton has 37 states. [2018-06-24 21:02:50,681 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-24 21:02:50,681 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 21:02:50,681 INFO ]: Found error trace [2018-06-24 21:02:50,681 INFO ]: trace histogram [34, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:50,681 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:50,681 INFO ]: Analyzing trace with hash 749814249, now seen corresponding path program 34 times [2018-06-24 21:02:50,681 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:50,681 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:50,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:50,682 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:50,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:50,728 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:52,796 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:52,796 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:52,796 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:52,801 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:02:52,958 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:02:52,958 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:52,986 INFO ]: Computing forward predicates... [2018-06-24 21:02:53,013 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:53,033 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:53,033 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-06-24 21:02:53,033 INFO ]: Interpolant automaton has 38 states [2018-06-24 21:02:53,033 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 21:02:53,033 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:02:53,033 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 38 states. [2018-06-24 21:02:54,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:54,174 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-24 21:02:54,174 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 21:02:54,174 INFO ]: Start accepts. Automaton has 38 states. Word has length 40 [2018-06-24 21:02:54,174 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:54,175 INFO ]: With dead ends: 42 [2018-06-24 21:02:54,175 INFO ]: Without dead ends: 42 [2018-06-24 21:02:54,175 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:02:54,175 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 21:02:54,176 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-24 21:02:54,176 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 21:02:54,176 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-24 21:02:54,176 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-24 21:02:54,176 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:54,176 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-24 21:02:54,176 INFO ]: Interpolant automaton has 38 states. [2018-06-24 21:02:54,176 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-24 21:02:54,177 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 21:02:54,177 INFO ]: Found error trace [2018-06-24 21:02:54,177 INFO ]: trace histogram [35, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:54,177 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:54,177 INFO ]: Analyzing trace with hash 1769020039, now seen corresponding path program 35 times [2018-06-24 21:02:54,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:54,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:54,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:54,177 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:54,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:54,214 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:55,700 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:55,700 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:55,700 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:55,711 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:02:56,083 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-06-24 21:02:56,083 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:56,213 INFO ]: Computing forward predicates... [2018-06-24 21:02:56,245 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:56,264 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:56,264 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-06-24 21:02:56,265 INFO ]: Interpolant automaton has 39 states [2018-06-24 21:02:56,265 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 21:02:56,265 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 21:02:56,265 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. [2018-06-24 21:02:57,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:02:57,554 INFO ]: Finished difference Result 43 states and 43 transitions. [2018-06-24 21:02:57,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 21:02:57,555 INFO ]: Start accepts. Automaton has 39 states. Word has length 41 [2018-06-24 21:02:57,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:02:57,555 INFO ]: With dead ends: 43 [2018-06-24 21:02:57,555 INFO ]: Without dead ends: 43 [2018-06-24 21:02:57,555 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 21:02:57,556 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 21:02:57,557 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-24 21:02:57,557 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 21:02:57,557 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-06-24 21:02:57,557 INFO ]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-06-24 21:02:57,557 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:02:57,557 INFO ]: Abstraction has 43 states and 43 transitions. [2018-06-24 21:02:57,557 INFO ]: Interpolant automaton has 39 states. [2018-06-24 21:02:57,557 INFO ]: Start isEmpty. Operand 43 states and 43 transitions. [2018-06-24 21:02:57,558 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-24 21:02:57,558 INFO ]: Found error trace [2018-06-24 21:02:57,558 INFO ]: trace histogram [36, 1, 1, 1, 1, 1, 1] [2018-06-24 21:02:57,558 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:02:57,558 INFO ]: Analyzing trace with hash -995338839, now seen corresponding path program 36 times [2018-06-24 21:02:57,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:02:57,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:02:57,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:57,558 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:02:57,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:02:57,611 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:58,742 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:58,742 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:02:58,742 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:02:58,748 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:02:58,925 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-06-24 21:02:58,925 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:02:58,945 INFO ]: Computing forward predicates... [2018-06-24 21:02:59,138 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:02:59,170 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:02:59,170 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-06-24 21:02:59,170 INFO ]: Interpolant automaton has 40 states [2018-06-24 21:02:59,170 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 21:02:59,170 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 21:02:59,171 INFO ]: Start difference. First operand 43 states and 43 transitions. Second operand 40 states. [2018-06-24 21:03:01,186 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:01,186 INFO ]: Finished difference Result 44 states and 44 transitions. [2018-06-24 21:03:01,186 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-24 21:03:01,186 INFO ]: Start accepts. Automaton has 40 states. Word has length 42 [2018-06-24 21:03:01,186 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:01,186 INFO ]: With dead ends: 44 [2018-06-24 21:03:01,186 INFO ]: Without dead ends: 44 [2018-06-24 21:03:01,187 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 21:03:01,187 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 21:03:01,188 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-24 21:03:01,188 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 21:03:01,189 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-06-24 21:03:01,189 INFO ]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-06-24 21:03:01,189 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:01,189 INFO ]: Abstraction has 44 states and 44 transitions. [2018-06-24 21:03:01,189 INFO ]: Interpolant automaton has 40 states. [2018-06-24 21:03:01,189 INFO ]: Start isEmpty. Operand 44 states and 44 transitions. [2018-06-24 21:03:01,189 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-24 21:03:01,189 INFO ]: Found error trace [2018-06-24 21:03:01,189 INFO ]: trace histogram [37, 1, 1, 1, 1, 1, 1] [2018-06-24 21:03:01,189 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:01,189 INFO ]: Analyzing trace with hash -791118137, now seen corresponding path program 37 times [2018-06-24 21:03:01,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:01,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:01,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:01,190 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:03:01,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:01,220 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:02,440 INFO ]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:02,440 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:03:02,440 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:03:02,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:02,645 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:02,663 INFO ]: Computing forward predicates... [2018-06-24 21:03:02,876 INFO ]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:02,910 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:03:02,910 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-06-24 21:03:02,911 INFO ]: Interpolant automaton has 41 states [2018-06-24 21:03:02,911 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-24 21:03:02,911 INFO ]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:03:02,911 INFO ]: Start difference. First operand 44 states and 44 transitions. Second operand 41 states. Received shutdown request... [2018-06-24 21:03:03,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 21:03:03,708 WARN ]: Verification canceled [2018-06-24 21:03:03,710 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:03:03,711 WARN ]: Timeout [2018-06-24 21:03:03,712 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:03:03 BasicIcfg [2018-06-24 21:03:03,712 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:03:03,712 INFO ]: Toolchain (without parser) took 58767.82 ms. Allocated memory was 309.9 MB in the beginning and 848.3 MB in the end (delta: 538.4 MB). Free memory was 266.4 MB in the beginning and 726.9 MB in the end (delta: -460.5 MB). Peak memory consumption was 78.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:03,713 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.9 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:03:03,714 INFO ]: ChcToBoogie took 63.17 ms. Allocated memory is still 309.9 MB. Free memory was 264.4 MB in the beginning and 262.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:03,714 INFO ]: Boogie Preprocessor took 42.38 ms. Allocated memory is still 309.9 MB. Free memory is still 262.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:03:03,714 INFO ]: RCFGBuilder took 264.00 ms. Allocated memory is still 309.9 MB. Free memory was 262.4 MB in the beginning and 252.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:03,715 INFO ]: BlockEncodingV2 took 118.85 ms. Allocated memory is still 309.9 MB. Free memory was 252.4 MB in the beginning and 250.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:03,715 INFO ]: TraceAbstraction took 58267.70 ms. Allocated memory was 309.9 MB in the beginning and 848.3 MB in the end (delta: 538.4 MB). Free memory was 250.4 MB in the beginning and 726.9 MB in the end (delta: -476.5 MB). Peak memory consumption was 62.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:03,720 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.9 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.17 ms. Allocated memory is still 309.9 MB. Free memory was 264.4 MB in the beginning and 262.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.38 ms. Allocated memory is still 309.9 MB. Free memory is still 262.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 264.00 ms. Allocated memory is still 309.9 MB. Free memory was 262.4 MB in the beginning and 252.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 118.85 ms. Allocated memory is still 309.9 MB. Free memory was 252.4 MB in the beginning and 250.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58267.70 ms. Allocated memory was 309.9 MB in the beginning and 848.3 MB in the end (delta: 538.4 MB). Free memory was 250.4 MB in the beginning and 726.9 MB in the end (delta: -476.5 MB). Peak memory consumption was 62.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (44states) and interpolant automaton (currently 29 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 58.2s OverallTime, 41 OverallIterations, 37 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 201 SDtfs, 2 SDslu, 2292 SDs, 0 SdLazy, 21681 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1776 GetRequests, 908 SyntacticMatches, 72 SemanticMatches, 796 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 27.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 31.5s InterpolantComputationTime, 1893 NumberOfCodeBlocks, 1893 NumberOfCodeBlocksAsserted, 277 NumberOfCheckSat, 1812 ConstructedInterpolants, 0 QuantifiedInterpolants, 1387209 SizeOfPredicates, 155 NumberOfNonLiveVariables, 26008 ConjunctsInSsa, 9246 ConjunctsInUnsatCore, 81 InterpolantComputations, 2 PerfectInterpolantSequences, 3/19768 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/010-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-03-03-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/010-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-03-03-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/010-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-03-03-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/010-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-03-03-734.csv Completed graceful shutdown