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/vmt-chc-benchmarks/cav12/mem_slave_tlm.5.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:34:29,460 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:34:29,463 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:34:29,477 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:34:29,478 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:34:29,479 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:34:29,480 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:34:29,484 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:34:29,485 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:34:29,487 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:34:29,488 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:34:29,488 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:34:29,489 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:34:29,491 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:34:29,493 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:34:29,493 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:34:29,494 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:34:29,504 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:34:29,506 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:34:29,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:34:29,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:34:29,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:34:29,515 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:34:29,515 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:34:29,515 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:34:29,516 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:34:29,517 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:34:29,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:34:29,518 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:34:29,519 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:34:29,519 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:34:29,520 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:34:29,520 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:34:29,520 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:34:29,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:34:29,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:34:29,522 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:34:29,546 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:34:29,546 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:34:29,546 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:34:29,547 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:34:29,548 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:34:29,548 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:34:29,548 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:34:29,548 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:34:29,548 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:34:29,548 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:34:29,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:34:29,549 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:34:29,549 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:34:29,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:34:29,549 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:34:29,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:34:29,550 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:34:29,550 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:34:29,550 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:34:29,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:34:29,550 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:34:29,552 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:34:29,552 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:34:29,597 INFO ]: Repository-Root is: /tmp [2018-06-26 20:34:29,617 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:34:29,624 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:34:29,626 INFO ]: Initializing SmtParser... [2018-06-26 20:34:29,626 INFO ]: SmtParser initialized [2018-06-26 20:34:29,626 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.5.smt2 [2018-06-26 20:34:29,628 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 20:34:29,714 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.5.smt2 unknown [2018-06-26 20:34:30,686 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.5.smt2 [2018-06-26 20:34:30,691 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:34:30,698 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:34:30,699 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:34:30,699 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:34:30,699 INFO ]: ChcToBoogie initialized [2018-06-26 20:34:30,702 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:34:30" (1/1) ... [2018-06-26 20:34:30,792 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:34:30 Unit [2018-06-26 20:34:30,792 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:34:30,795 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:34:30,795 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:34:30,795 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:34:30,818 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:34:30" (1/1) ... [2018-06-26 20:34:30,818 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:34:30" (1/1) ... [2018-06-26 20:34:30,838 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:34:30" (1/1) ... [2018-06-26 20:34:30,838 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:34:30" (1/1) ... [2018-06-26 20:34:30,861 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:34:30" (1/1) ... [2018-06-26 20:34:30,863 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:34:30" (1/1) ... [2018-06-26 20:34:30,870 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:34:30" (1/1) ... [2018-06-26 20:34:30,878 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:34:30,879 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:34:30,879 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:34:30,879 INFO ]: RCFGBuilder initialized [2018-06-26 20:34:30,880 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:34:30" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 20:34:30,894 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:34:30,894 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:34:30,894 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:34:30,894 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:34:30,894 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:34:30,894 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:34:31,582 INFO ]: Using library mode [2018-06-26 20:34:31,582 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:34:31 BoogieIcfgContainer [2018-06-26 20:34:31,582 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:34:31,583 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:34:31,583 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:34:31,584 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:34:31,584 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:34:31" (1/1) ... [2018-06-26 20:34:31,608 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:34:31,609 INFO ]: Using Remove infeasible edges [2018-06-26 20:34:31,610 INFO ]: Using Maximize final states [2018-06-26 20:34:31,610 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:34:31,610 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:34:31,614 INFO ]: Using Remove sink states [2018-06-26 20:34:31,615 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:34:31,615 INFO ]: Using Use SBE [2018-06-26 20:34:31,666 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 20:34:32,282 INFO ]: SBE split 1 edges [2018-06-26 20:34:32,293 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:34:32,295 INFO ]: 0 new accepting states [2018-06-26 20:34:32,353 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:34:32,355 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:34:32,365 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:34:32,366 INFO ]: 0 new accepting states [2018-06-26 20:34:32,366 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:34:32,366 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:34:32,374 INFO ]: Encoded RCFG 6 locations, 117 edges [2018-06-26 20:34:32,374 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:34:32 BasicIcfg [2018-06-26 20:34:32,374 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:34:32,376 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:34:32,376 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:34:32,381 INFO ]: TraceAbstraction initialized [2018-06-26 20:34:32,381 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:34:30" (1/4) ... [2018-06-26 20:34:32,382 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1256bea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:34:32, skipping insertion in model container [2018-06-26 20:34:32,382 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:34:30" (2/4) ... [2018-06-26 20:34:32,382 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1256bea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:34:32, skipping insertion in model container [2018-06-26 20:34:32,382 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:34:31" (3/4) ... [2018-06-26 20:34:32,382 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1256bea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:34:32, skipping insertion in model container [2018-06-26 20:34:32,382 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:34:32" (4/4) ... [2018-06-26 20:34:32,385 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:34:32,396 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:34:32,404 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:34:32,451 INFO ]: Using default assertion order modulation [2018-06-26 20:34:32,451 INFO ]: Interprodecural is true [2018-06-26 20:34:32,451 INFO ]: Hoare is false [2018-06-26 20:34:32,452 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:34:32,452 INFO ]: Backedges is TWOTRACK [2018-06-26 20:34:32,452 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:34:32,452 INFO ]: Difference is false [2018-06-26 20:34:32,452 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:34:32,452 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:34:32,466 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:34:32,481 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:34:32,481 INFO ]: Found error trace [2018-06-26 20:34:32,482 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:34:32,483 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:32,487 INFO ]: Analyzing trace with hash 38846786, now seen corresponding path program 1 times [2018-06-26 20:34:32,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:32,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:32,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:32,534 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:32,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:32,623 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:32,766 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:34:32,768 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:32,768 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:32,770 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:32,789 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:32,789 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:32,791 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:34:34,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:34,682 INFO ]: Finished difference Result 7 states and 180 transitions. [2018-06-26 20:34:34,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:34,683 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:34:34,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:34,692 INFO ]: With dead ends: 7 [2018-06-26 20:34:34,692 INFO ]: Without dead ends: 7 [2018-06-26 20:34:34,694 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:34,712 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:34:34,740 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:34:34,741 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:34:34,743 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2018-06-26 20:34:34,744 INFO ]: Start accepts. Automaton has 7 states and 180 transitions. Word has length 5 [2018-06-26 20:34:34,745 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:34,745 INFO ]: Abstraction has 7 states and 180 transitions. [2018-06-26 20:34:34,745 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:34,745 INFO ]: Start isEmpty. Operand 7 states and 180 transitions. [2018-06-26 20:34:34,747 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:34:34,747 INFO ]: Found error trace [2018-06-26 20:34:34,747 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:34:34,747 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:34,747 INFO ]: Analyzing trace with hash 1201232024, now seen corresponding path program 1 times [2018-06-26 20:34:34,747 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:34,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:34,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:34,748 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:34,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:34,819 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:34,886 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:34:34,886 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:34,886 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:34,887 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:34,888 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:34,888 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:34,888 INFO ]: Start difference. First operand 7 states and 180 transitions. Second operand 3 states. [2018-06-26 20:34:35,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:35,827 INFO ]: Finished difference Result 9 states and 297 transitions. [2018-06-26 20:34:35,852 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:35,852 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:34:35,853 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:35,854 INFO ]: With dead ends: 9 [2018-06-26 20:34:35,854 INFO ]: Without dead ends: 9 [2018-06-26 20:34:35,855 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:35,855 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:34:35,860 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:34:35,860 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:34:35,861 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 297 transitions. [2018-06-26 20:34:35,861 INFO ]: Start accepts. Automaton has 9 states and 297 transitions. Word has length 6 [2018-06-26 20:34:35,862 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:35,862 INFO ]: Abstraction has 9 states and 297 transitions. [2018-06-26 20:34:35,862 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:35,862 INFO ]: Start isEmpty. Operand 9 states and 297 transitions. [2018-06-26 20:34:35,862 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:34:35,862 INFO ]: Found error trace [2018-06-26 20:34:35,862 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:34:35,862 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:35,862 INFO ]: Analyzing trace with hash 1202900320, now seen corresponding path program 1 times [2018-06-26 20:34:35,862 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:35,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:35,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:35,863 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:35,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:35,896 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:35,974 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:34:35,975 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:35,975 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:35,975 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:35,975 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:35,975 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:35,975 INFO ]: Start difference. First operand 9 states and 297 transitions. Second operand 3 states. [2018-06-26 20:34:36,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:36,655 INFO ]: Finished difference Result 13 states and 369 transitions. [2018-06-26 20:34:36,655 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:36,655 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:34:36,655 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:36,657 INFO ]: With dead ends: 13 [2018-06-26 20:34:36,657 INFO ]: Without dead ends: 13 [2018-06-26 20:34:36,657 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:36,657 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:34:36,661 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:34:36,661 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:34:36,663 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 369 transitions. [2018-06-26 20:34:36,663 INFO ]: Start accepts. Automaton has 13 states and 369 transitions. Word has length 6 [2018-06-26 20:34:36,663 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:36,663 INFO ]: Abstraction has 13 states and 369 transitions. [2018-06-26 20:34:36,663 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:36,663 INFO ]: Start isEmpty. Operand 13 states and 369 transitions. [2018-06-26 20:34:36,663 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:34:36,663 INFO ]: Found error trace [2018-06-26 20:34:36,663 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:36,663 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:36,664 INFO ]: Analyzing trace with hash -1419561053, now seen corresponding path program 1 times [2018-06-26 20:34:36,664 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:36,664 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:36,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:36,665 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:36,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:36,703 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:36,777 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:34:36,777 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:36,777 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:36,777 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:36,777 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:36,777 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:36,777 INFO ]: Start difference. First operand 13 states and 369 transitions. Second operand 3 states. [2018-06-26 20:34:37,475 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:37,475 INFO ]: Finished difference Result 20 states and 628 transitions. [2018-06-26 20:34:37,475 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:37,475 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:34:37,475 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:37,477 INFO ]: With dead ends: 20 [2018-06-26 20:34:37,477 INFO ]: Without dead ends: 20 [2018-06-26 20:34:37,477 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:37,477 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 20:34:37,482 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 20:34:37,483 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 20:34:37,484 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 628 transitions. [2018-06-26 20:34:37,485 INFO ]: Start accepts. Automaton has 20 states and 628 transitions. Word has length 7 [2018-06-26 20:34:37,485 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:37,485 INFO ]: Abstraction has 20 states and 628 transitions. [2018-06-26 20:34:37,485 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:37,485 INFO ]: Start isEmpty. Operand 20 states and 628 transitions. [2018-06-26 20:34:37,485 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:34:37,485 INFO ]: Found error trace [2018-06-26 20:34:37,486 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:37,486 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:37,486 INFO ]: Analyzing trace with hash -1367843877, now seen corresponding path program 1 times [2018-06-26 20:34:37,486 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:37,486 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:37,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:37,487 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:37,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:37,510 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:37,553 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:34:37,554 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:37,554 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:37,554 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:37,554 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:37,554 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:37,554 INFO ]: Start difference. First operand 20 states and 628 transitions. Second operand 3 states. [2018-06-26 20:34:38,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:38,090 INFO ]: Finished difference Result 20 states and 372 transitions. [2018-06-26 20:34:38,090 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:38,090 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:34:38,090 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:38,091 INFO ]: With dead ends: 20 [2018-06-26 20:34:38,091 INFO ]: Without dead ends: 20 [2018-06-26 20:34:38,092 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:38,092 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 20:34:38,096 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 20:34:38,096 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 20:34:38,097 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 372 transitions. [2018-06-26 20:34:38,097 INFO ]: Start accepts. Automaton has 20 states and 372 transitions. Word has length 7 [2018-06-26 20:34:38,097 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:38,097 INFO ]: Abstraction has 20 states and 372 transitions. [2018-06-26 20:34:38,097 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:38,097 INFO ]: Start isEmpty. Operand 20 states and 372 transitions. [2018-06-26 20:34:38,097 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:34:38,098 INFO ]: Found error trace [2018-06-26 20:34:38,098 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:38,098 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:38,098 INFO ]: Analyzing trace with hash 790044747, now seen corresponding path program 1 times [2018-06-26 20:34:38,098 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:38,098 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:38,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:38,099 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:38,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:38,124 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:38,168 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:34:38,168 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:38,168 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:38,168 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:38,169 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:38,169 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:38,169 INFO ]: Start difference. First operand 20 states and 372 transitions. Second operand 3 states. [2018-06-26 20:34:38,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:38,846 INFO ]: Finished difference Result 31 states and 527 transitions. [2018-06-26 20:34:38,847 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:38,847 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:34:38,847 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:38,848 INFO ]: With dead ends: 31 [2018-06-26 20:34:38,848 INFO ]: Without dead ends: 31 [2018-06-26 20:34:38,848 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:38,848 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:34:38,853 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 20:34:38,853 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 20:34:38,854 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 527 transitions. [2018-06-26 20:34:38,854 INFO ]: Start accepts. Automaton has 31 states and 527 transitions. Word has length 8 [2018-06-26 20:34:38,855 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:38,855 INFO ]: Abstraction has 31 states and 527 transitions. [2018-06-26 20:34:38,855 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:38,855 INFO ]: Start isEmpty. Operand 31 states and 527 transitions. [2018-06-26 20:34:38,855 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:34:38,855 INFO ]: Found error trace [2018-06-26 20:34:38,855 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:38,855 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:38,856 INFO ]: Analyzing trace with hash 639540615, now seen corresponding path program 1 times [2018-06-26 20:34:38,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:38,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:38,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:38,857 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:38,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:38,894 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:38,937 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:34:38,937 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:38,937 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:38,937 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:38,937 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:38,937 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:38,937 INFO ]: Start difference. First operand 31 states and 527 transitions. Second operand 3 states. [2018-06-26 20:34:39,552 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:39,552 INFO ]: Finished difference Result 31 states and 343 transitions. [2018-06-26 20:34:39,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:39,553 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:34:39,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:39,554 INFO ]: With dead ends: 31 [2018-06-26 20:34:39,554 INFO ]: Without dead ends: 31 [2018-06-26 20:34:39,554 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:39,554 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:34:39,558 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 20:34:39,558 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 20:34:39,560 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 343 transitions. [2018-06-26 20:34:39,560 INFO ]: Start accepts. Automaton has 31 states and 343 transitions. Word has length 8 [2018-06-26 20:34:39,560 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:39,560 INFO ]: Abstraction has 31 states and 343 transitions. [2018-06-26 20:34:39,560 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:39,560 INFO ]: Start isEmpty. Operand 31 states and 343 transitions. [2018-06-26 20:34:39,561 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:34:39,561 INFO ]: Found error trace [2018-06-26 20:34:39,561 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:39,561 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:39,561 INFO ]: Analyzing trace with hash 896999775, now seen corresponding path program 1 times [2018-06-26 20:34:39,561 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:39,561 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:39,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:39,562 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:39,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:39,589 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:39,664 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:34:39,664 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:39,664 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:39,664 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:39,664 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:39,664 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:39,665 INFO ]: Start difference. First operand 31 states and 343 transitions. Second operand 3 states. [2018-06-26 20:34:40,940 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:40,940 INFO ]: Finished difference Result 31 states and 223 transitions. [2018-06-26 20:34:40,940 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:40,940 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:34:40,940 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:40,941 INFO ]: With dead ends: 31 [2018-06-26 20:34:40,941 INFO ]: Without dead ends: 31 [2018-06-26 20:34:40,941 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:40,941 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:34:40,944 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 20:34:40,944 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 20:34:40,945 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 223 transitions. [2018-06-26 20:34:40,945 INFO ]: Start accepts. Automaton has 31 states and 223 transitions. Word has length 9 [2018-06-26 20:34:40,945 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:40,945 INFO ]: Abstraction has 31 states and 223 transitions. [2018-06-26 20:34:40,945 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:40,945 INFO ]: Start isEmpty. Operand 31 states and 223 transitions. [2018-06-26 20:34:40,946 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:34:40,946 INFO ]: Found error trace [2018-06-26 20:34:40,946 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:40,946 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:40,946 INFO ]: Analyzing trace with hash 508759891, now seen corresponding path program 1 times [2018-06-26 20:34:40,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:40,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:40,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:40,947 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:40,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:40,988 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:41,180 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-06-26 20:34:41,181 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:34:41,181 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:41,181 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:41,181 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:41,181 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:41,181 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:41,181 INFO ]: Start difference. First operand 31 states and 223 transitions. Second operand 3 states. [2018-06-26 20:34:42,000 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:42,000 INFO ]: Finished difference Result 55 states and 426 transitions. [2018-06-26 20:34:42,001 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:42,001 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:34:42,001 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:42,002 INFO ]: With dead ends: 55 [2018-06-26 20:34:42,002 INFO ]: Without dead ends: 55 [2018-06-26 20:34:42,003 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:42,003 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-26 20:34:42,008 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-26 20:34:42,011 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-26 20:34:42,012 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 426 transitions. [2018-06-26 20:34:42,012 INFO ]: Start accepts. Automaton has 55 states and 426 transitions. Word has length 10 [2018-06-26 20:34:42,012 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:42,012 INFO ]: Abstraction has 55 states and 426 transitions. [2018-06-26 20:34:42,012 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:42,012 INFO ]: Start isEmpty. Operand 55 states and 426 transitions. [2018-06-26 20:34:42,013 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:34:42,013 INFO ]: Found error trace [2018-06-26 20:34:42,013 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:42,013 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:42,013 INFO ]: Analyzing trace with hash -1640202017, now seen corresponding path program 1 times [2018-06-26 20:34:42,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:42,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:42,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:42,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:42,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:42,050 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:42,121 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:34:42,122 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:42,122 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:42,122 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:42,122 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:42,122 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:42,122 INFO ]: Start difference. First operand 55 states and 426 transitions. Second operand 3 states. [2018-06-26 20:34:42,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:42,839 INFO ]: Finished difference Result 55 states and 288 transitions. [2018-06-26 20:34:42,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:42,839 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:34:42,839 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:42,840 INFO ]: With dead ends: 55 [2018-06-26 20:34:42,840 INFO ]: Without dead ends: 55 [2018-06-26 20:34:42,840 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:42,840 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-26 20:34:42,845 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-06-26 20:34:42,845 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-26 20:34:42,846 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 282 transitions. [2018-06-26 20:34:42,846 INFO ]: Start accepts. Automaton has 54 states and 282 transitions. Word has length 10 [2018-06-26 20:34:42,846 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:42,846 INFO ]: Abstraction has 54 states and 282 transitions. [2018-06-26 20:34:42,846 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:42,846 INFO ]: Start isEmpty. Operand 54 states and 282 transitions. [2018-06-26 20:34:42,847 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:34:42,847 INFO ]: Found error trace [2018-06-26 20:34:42,847 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:42,847 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:42,847 INFO ]: Analyzing trace with hash 1382156419, now seen corresponding path program 1 times [2018-06-26 20:34:42,847 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:42,847 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:42,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:42,848 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:42,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:42,884 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:42,954 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:34:42,954 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:42,954 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:42,954 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:42,954 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:42,954 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:42,954 INFO ]: Start difference. First operand 54 states and 282 transitions. Second operand 3 states. [2018-06-26 20:34:44,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:44,023 INFO ]: Finished difference Result 101 states and 463 transitions. [2018-06-26 20:34:44,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:44,024 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:34:44,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:44,025 INFO ]: With dead ends: 101 [2018-06-26 20:34:44,025 INFO ]: Without dead ends: 101 [2018-06-26 20:34:44,025 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:44,025 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-26 20:34:44,039 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-06-26 20:34:44,039 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-26 20:34:44,040 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 461 transitions. [2018-06-26 20:34:44,040 INFO ]: Start accepts. Automaton has 100 states and 461 transitions. Word has length 11 [2018-06-26 20:34:44,041 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:44,041 INFO ]: Abstraction has 100 states and 461 transitions. [2018-06-26 20:34:44,041 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:44,041 INFO ]: Start isEmpty. Operand 100 states and 461 transitions. [2018-06-26 20:34:44,044 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:34:44,044 INFO ]: Found error trace [2018-06-26 20:34:44,044 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:44,044 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:44,044 INFO ]: Analyzing trace with hash 1271683694, now seen corresponding path program 1 times [2018-06-26 20:34:44,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:44,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:44,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:44,045 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:44,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:44,083 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:44,228 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:34:44,228 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:44,228 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:44,228 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:44,228 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:44,228 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:44,228 INFO ]: Start difference. First operand 100 states and 461 transitions. Second operand 3 states. [2018-06-26 20:34:45,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:45,051 INFO ]: Finished difference Result 184 states and 754 transitions. [2018-06-26 20:34:45,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:45,051 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:34:45,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:45,053 INFO ]: With dead ends: 184 [2018-06-26 20:34:45,053 INFO ]: Without dead ends: 176 [2018-06-26 20:34:45,053 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:45,053 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-26 20:34:45,063 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-06-26 20:34:45,063 INFO ]: Start removeUnreachable. Operand 175 states. [2018-06-26 20:34:45,065 INFO ]: Finished removeUnreachable. Reduced from 175 states to 175 states and 740 transitions. [2018-06-26 20:34:45,065 INFO ]: Start accepts. Automaton has 175 states and 740 transitions. Word has length 12 [2018-06-26 20:34:45,065 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:45,065 INFO ]: Abstraction has 175 states and 740 transitions. [2018-06-26 20:34:45,065 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:45,066 INFO ]: Start isEmpty. Operand 175 states and 740 transitions. [2018-06-26 20:34:45,067 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:34:45,067 INFO ]: Found error trace [2018-06-26 20:34:45,067 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:45,067 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:45,067 INFO ]: Analyzing trace with hash -1332929220, now seen corresponding path program 1 times [2018-06-26 20:34:45,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:45,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:45,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:45,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:45,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:45,108 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:45,210 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 20:34:45,210 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:45,210 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:45,210 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:45,210 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:45,210 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:45,210 INFO ]: Start difference. First operand 175 states and 740 transitions. Second operand 3 states. [2018-06-26 20:34:45,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:45,965 INFO ]: Finished difference Result 330 states and 1386 transitions. [2018-06-26 20:34:45,965 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:45,965 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:34:45,965 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:45,968 INFO ]: With dead ends: 330 [2018-06-26 20:34:45,968 INFO ]: Without dead ends: 330 [2018-06-26 20:34:45,968 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:45,969 INFO ]: Start minimizeSevpa. Operand 330 states. [2018-06-26 20:34:46,001 INFO ]: Finished minimizeSevpa. Reduced states from 330 to 290. [2018-06-26 20:34:46,001 INFO ]: Start removeUnreachable. Operand 290 states. [2018-06-26 20:34:46,009 INFO ]: Finished removeUnreachable. Reduced from 290 states to 290 states and 1282 transitions. [2018-06-26 20:34:46,009 INFO ]: Start accepts. Automaton has 290 states and 1282 transitions. Word has length 13 [2018-06-26 20:34:46,010 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:46,010 INFO ]: Abstraction has 290 states and 1282 transitions. [2018-06-26 20:34:46,010 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:46,010 INFO ]: Start isEmpty. Operand 290 states and 1282 transitions. [2018-06-26 20:34:46,012 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:34:46,012 INFO ]: Found error trace [2018-06-26 20:34:46,012 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:46,012 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:46,012 INFO ]: Analyzing trace with hash -444997049, now seen corresponding path program 1 times [2018-06-26 20:34:46,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:46,012 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:46,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:46,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:46,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:46,056 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:46,156 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:34:46,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:46,157 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:46,157 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:46,157 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:46,157 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:46,157 INFO ]: Start difference. First operand 290 states and 1282 transitions. Second operand 3 states. [2018-06-26 20:34:46,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:46,539 INFO ]: Finished difference Result 208 states and 680 transitions. [2018-06-26 20:34:46,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:46,539 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:34:46,539 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:46,541 INFO ]: With dead ends: 208 [2018-06-26 20:34:46,541 INFO ]: Without dead ends: 201 [2018-06-26 20:34:46,541 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:46,541 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-26 20:34:46,551 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-06-26 20:34:46,551 INFO ]: Start removeUnreachable. Operand 201 states. [2018-06-26 20:34:46,552 INFO ]: Finished removeUnreachable. Reduced from 201 states to 201 states and 669 transitions. [2018-06-26 20:34:46,553 INFO ]: Start accepts. Automaton has 201 states and 669 transitions. Word has length 13 [2018-06-26 20:34:46,553 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:46,553 INFO ]: Abstraction has 201 states and 669 transitions. [2018-06-26 20:34:46,553 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:46,553 INFO ]: Start isEmpty. Operand 201 states and 669 transitions. [2018-06-26 20:34:46,554 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:34:46,554 INFO ]: Found error trace [2018-06-26 20:34:46,554 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:46,554 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:46,554 INFO ]: Analyzing trace with hash 179259950, now seen corresponding path program 1 times [2018-06-26 20:34:46,554 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:46,554 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:46,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:46,555 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:46,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:46,603 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:46,724 INFO ]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 20:34:46,724 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:46,724 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:46,724 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:46,724 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:46,724 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:46,725 INFO ]: Start difference. First operand 201 states and 669 transitions. Second operand 3 states. [2018-06-26 20:34:48,562 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:48,562 INFO ]: Finished difference Result 202 states and 666 transitions. [2018-06-26 20:34:48,562 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:48,562 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 20:34:48,562 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:48,563 INFO ]: With dead ends: 202 [2018-06-26 20:34:48,563 INFO ]: Without dead ends: 202 [2018-06-26 20:34:48,564 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:48,564 INFO ]: Start minimizeSevpa. Operand 202 states. [2018-06-26 20:34:48,573 INFO ]: Finished minimizeSevpa. Reduced states from 202 to 198. [2018-06-26 20:34:48,573 INFO ]: Start removeUnreachable. Operand 198 states. [2018-06-26 20:34:48,575 INFO ]: Finished removeUnreachable. Reduced from 198 states to 198 states and 650 transitions. [2018-06-26 20:34:48,575 INFO ]: Start accepts. Automaton has 198 states and 650 transitions. Word has length 14 [2018-06-26 20:34:48,575 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:48,575 INFO ]: Abstraction has 198 states and 650 transitions. [2018-06-26 20:34:48,575 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:48,575 INFO ]: Start isEmpty. Operand 198 states and 650 transitions. [2018-06-26 20:34:48,576 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:34:48,576 INFO ]: Found error trace [2018-06-26 20:34:48,576 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:48,576 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:48,576 INFO ]: Analyzing trace with hash -1693602695, now seen corresponding path program 1 times [2018-06-26 20:34:48,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:48,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:48,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:48,578 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:48,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:48,621 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:48,752 INFO ]: Checked inductivity of 78 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 20:34:48,752 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:48,752 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:48,752 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:48,752 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:48,752 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:48,752 INFO ]: Start difference. First operand 198 states and 650 transitions. Second operand 3 states. [2018-06-26 20:34:49,502 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:49,502 INFO ]: Finished difference Result 298 states and 850 transitions. [2018-06-26 20:34:49,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:49,503 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:34:49,503 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:49,505 INFO ]: With dead ends: 298 [2018-06-26 20:34:49,505 INFO ]: Without dead ends: 298 [2018-06-26 20:34:49,505 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:49,506 INFO ]: Start minimizeSevpa. Operand 298 states. [2018-06-26 20:34:49,515 INFO ]: Finished minimizeSevpa. Reduced states from 298 to 275. [2018-06-26 20:34:49,515 INFO ]: Start removeUnreachable. Operand 275 states. [2018-06-26 20:34:49,517 INFO ]: Finished removeUnreachable. Reduced from 275 states to 275 states and 808 transitions. [2018-06-26 20:34:49,517 INFO ]: Start accepts. Automaton has 275 states and 808 transitions. Word has length 17 [2018-06-26 20:34:49,517 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:49,517 INFO ]: Abstraction has 275 states and 808 transitions. [2018-06-26 20:34:49,517 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:49,517 INFO ]: Start isEmpty. Operand 275 states and 808 transitions. [2018-06-26 20:34:49,518 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:34:49,518 INFO ]: Found error trace [2018-06-26 20:34:49,518 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:49,519 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:49,519 INFO ]: Analyzing trace with hash -1934976925, now seen corresponding path program 1 times [2018-06-26 20:34:49,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:49,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:49,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:49,519 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:49,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:49,561 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:49,662 INFO ]: Checked inductivity of 78 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 20:34:49,662 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:49,662 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:49,662 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:49,663 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:49,663 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:49,663 INFO ]: Start difference. First operand 275 states and 808 transitions. Second operand 3 states. [2018-06-26 20:34:50,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:50,655 INFO ]: Finished difference Result 482 states and 1220 transitions. [2018-06-26 20:34:50,655 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:50,655 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:34:50,655 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:50,657 INFO ]: With dead ends: 482 [2018-06-26 20:34:50,658 INFO ]: Without dead ends: 471 [2018-06-26 20:34:50,658 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:50,658 INFO ]: Start minimizeSevpa. Operand 471 states. [2018-06-26 20:34:50,673 INFO ]: Finished minimizeSevpa. Reduced states from 471 to 471. [2018-06-26 20:34:50,673 INFO ]: Start removeUnreachable. Operand 471 states. [2018-06-26 20:34:50,675 INFO ]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1209 transitions. [2018-06-26 20:34:50,676 INFO ]: Start accepts. Automaton has 471 states and 1209 transitions. Word has length 17 [2018-06-26 20:34:50,677 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:50,677 INFO ]: Abstraction has 471 states and 1209 transitions. [2018-06-26 20:34:50,677 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:50,678 INFO ]: Start isEmpty. Operand 471 states and 1209 transitions. [2018-06-26 20:34:50,679 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:34:50,679 INFO ]: Found error trace [2018-06-26 20:34:50,679 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:50,679 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:50,680 INFO ]: Analyzing trace with hash -1554103683, now seen corresponding path program 1 times [2018-06-26 20:34:50,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:50,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:50,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:50,680 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:50,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:50,721 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:50,866 INFO ]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-26 20:34:50,866 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:50,866 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:50,867 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:50,867 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:50,867 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:50,867 INFO ]: Start difference. First operand 471 states and 1209 transitions. Second operand 3 states. [2018-06-26 20:34:51,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:51,397 INFO ]: Finished difference Result 623 states and 1600 transitions. [2018-06-26 20:34:51,397 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:51,397 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:34:51,397 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:51,400 INFO ]: With dead ends: 623 [2018-06-26 20:34:51,400 INFO ]: Without dead ends: 623 [2018-06-26 20:34:51,400 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:51,401 INFO ]: Start minimizeSevpa. Operand 623 states. [2018-06-26 20:34:51,422 INFO ]: Finished minimizeSevpa. Reduced states from 623 to 617. [2018-06-26 20:34:51,422 INFO ]: Start removeUnreachable. Operand 617 states. [2018-06-26 20:34:51,426 INFO ]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1591 transitions. [2018-06-26 20:34:51,426 INFO ]: Start accepts. Automaton has 617 states and 1591 transitions. Word has length 17 [2018-06-26 20:34:51,426 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:51,426 INFO ]: Abstraction has 617 states and 1591 transitions. [2018-06-26 20:34:51,426 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:51,427 INFO ]: Start isEmpty. Operand 617 states and 1591 transitions. [2018-06-26 20:34:51,429 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:34:51,429 INFO ]: Found error trace [2018-06-26 20:34:51,429 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:51,429 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:51,429 INFO ]: Analyzing trace with hash -862495452, now seen corresponding path program 1 times [2018-06-26 20:34:51,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:51,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:51,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:51,430 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:51,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:51,517 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:51,815 INFO ]: Checked inductivity of 91 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-26 20:34:51,815 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:34:51,815 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:34:51,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:52,430 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:52,468 INFO ]: Computing forward predicates... [2018-06-26 20:34:52,554 INFO ]: Checked inductivity of 91 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-26 20:34:52,578 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:34:52,578 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 20:34:52,579 INFO ]: Interpolant automaton has 5 states [2018-06-26 20:34:52,579 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 20:34:52,579 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 20:34:52,579 INFO ]: Start difference. First operand 617 states and 1591 transitions. Second operand 5 states. [2018-06-26 20:34:54,058 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:54,058 INFO ]: Finished difference Result 885 states and 2178 transitions. [2018-06-26 20:34:54,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 20:34:54,065 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-26 20:34:54,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:54,076 INFO ]: With dead ends: 885 [2018-06-26 20:34:54,076 INFO ]: Without dead ends: 885 [2018-06-26 20:34:54,076 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:34:54,076 INFO ]: Start minimizeSevpa. Operand 885 states. [2018-06-26 20:34:54,108 INFO ]: Finished minimizeSevpa. Reduced states from 885 to 839. [2018-06-26 20:34:54,108 INFO ]: Start removeUnreachable. Operand 839 states. [2018-06-26 20:34:54,112 INFO ]: Finished removeUnreachable. Reduced from 839 states to 839 states and 2090 transitions. [2018-06-26 20:34:54,112 INFO ]: Start accepts. Automaton has 839 states and 2090 transitions. Word has length 18 [2018-06-26 20:34:54,112 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:54,112 INFO ]: Abstraction has 839 states and 2090 transitions. [2018-06-26 20:34:54,112 INFO ]: Interpolant automaton has 5 states. [2018-06-26 20:34:54,112 INFO ]: Start isEmpty. Operand 839 states and 2090 transitions. [2018-06-26 20:34:54,114 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:34:54,114 INFO ]: Found error trace [2018-06-26 20:34:54,114 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:54,114 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:54,114 INFO ]: Analyzing trace with hash 1770570577, now seen corresponding path program 1 times [2018-06-26 20:34:54,114 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:54,114 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:54,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:54,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:54,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:54,167 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:54,277 INFO ]: Checked inductivity of 91 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-26 20:34:54,277 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:54,277 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:54,277 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:54,277 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:54,277 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:54,277 INFO ]: Start difference. First operand 839 states and 2090 transitions. Second operand 3 states. [2018-06-26 20:34:55,406 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:55,406 INFO ]: Finished difference Result 1445 states and 3293 transitions. [2018-06-26 20:34:55,406 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:55,406 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 20:34:55,406 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:55,410 INFO ]: With dead ends: 1445 [2018-06-26 20:34:55,410 INFO ]: Without dead ends: 900 [2018-06-26 20:34:55,410 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:55,411 INFO ]: Start minimizeSevpa. Operand 900 states. [2018-06-26 20:34:55,436 INFO ]: Finished minimizeSevpa. Reduced states from 900 to 651. [2018-06-26 20:34:55,436 INFO ]: Start removeUnreachable. Operand 651 states. [2018-06-26 20:34:55,439 INFO ]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1682 transitions. [2018-06-26 20:34:55,439 INFO ]: Start accepts. Automaton has 651 states and 1682 transitions. Word has length 18 [2018-06-26 20:34:55,439 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:55,439 INFO ]: Abstraction has 651 states and 1682 transitions. [2018-06-26 20:34:55,439 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:55,439 INFO ]: Start isEmpty. Operand 651 states and 1682 transitions. [2018-06-26 20:34:55,441 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 20:34:55,441 INFO ]: Found error trace [2018-06-26 20:34:55,442 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:55,442 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:55,442 INFO ]: Analyzing trace with hash -776794919, now seen corresponding path program 1 times [2018-06-26 20:34:55,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:55,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:55,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:55,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:55,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:55,517 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:55,666 INFO ]: Checked inductivity of 190 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-26 20:34:55,667 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:55,667 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:55,667 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:55,667 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:55,667 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:55,667 INFO ]: Start difference. First operand 651 states and 1682 transitions. Second operand 3 states. [2018-06-26 20:34:56,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:56,677 INFO ]: Finished difference Result 783 states and 1758 transitions. [2018-06-26 20:34:56,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:56,698 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-26 20:34:56,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:56,700 INFO ]: With dead ends: 783 [2018-06-26 20:34:56,700 INFO ]: Without dead ends: 640 [2018-06-26 20:34:56,700 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:56,701 INFO ]: Start minimizeSevpa. Operand 640 states. [2018-06-26 20:34:56,715 INFO ]: Finished minimizeSevpa. Reduced states from 640 to 542. [2018-06-26 20:34:56,716 INFO ]: Start removeUnreachable. Operand 542 states. [2018-06-26 20:34:56,718 INFO ]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1325 transitions. [2018-06-26 20:34:56,718 INFO ]: Start accepts. Automaton has 542 states and 1325 transitions. Word has length 24 [2018-06-26 20:34:56,718 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:56,718 INFO ]: Abstraction has 542 states and 1325 transitions. [2018-06-26 20:34:56,718 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:56,718 INFO ]: Start isEmpty. Operand 542 states and 1325 transitions. [2018-06-26 20:34:56,720 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 20:34:56,720 INFO ]: Found error trace [2018-06-26 20:34:56,720 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:56,720 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:56,720 INFO ]: Analyzing trace with hash -1404977087, now seen corresponding path program 1 times [2018-06-26 20:34:56,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:56,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:56,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:56,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:56,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:56,782 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:56,921 INFO ]: Checked inductivity of 190 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-26 20:34:56,921 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:56,921 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:56,921 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:56,921 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:56,921 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:56,921 INFO ]: Start difference. First operand 542 states and 1325 transitions. Second operand 3 states. [2018-06-26 20:34:58,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:58,913 INFO ]: Finished difference Result 564 states and 1341 transitions. [2018-06-26 20:34:58,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:58,914 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-26 20:34:58,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:58,916 INFO ]: With dead ends: 564 [2018-06-26 20:34:58,916 INFO ]: Without dead ends: 527 [2018-06-26 20:34:58,916 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:58,917 INFO ]: Start minimizeSevpa. Operand 527 states. [2018-06-26 20:34:58,928 INFO ]: Finished minimizeSevpa. Reduced states from 527 to 463. [2018-06-26 20:34:58,928 INFO ]: Start removeUnreachable. Operand 463 states. [2018-06-26 20:34:58,930 INFO ]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1196 transitions. [2018-06-26 20:34:58,930 INFO ]: Start accepts. Automaton has 463 states and 1196 transitions. Word has length 24 [2018-06-26 20:34:58,930 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:58,930 INFO ]: Abstraction has 463 states and 1196 transitions. [2018-06-26 20:34:58,930 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:58,930 INFO ]: Start isEmpty. Operand 463 states and 1196 transitions. [2018-06-26 20:34:58,932 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 20:34:58,932 INFO ]: Found error trace [2018-06-26 20:34:58,932 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:58,932 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:58,932 INFO ]: Analyzing trace with hash -917666594, now seen corresponding path program 1 times [2018-06-26 20:34:58,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:58,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:58,933 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:58,933 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:58,933 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:58,982 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:59,204 WARN ]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-26 20:34:59,272 INFO ]: Checked inductivity of 190 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-26 20:34:59,272 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:59,272 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:59,272 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:59,272 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:59,272 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:59,272 INFO ]: Start difference. First operand 463 states and 1196 transitions. Second operand 3 states. [2018-06-26 20:34:59,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:59,846 INFO ]: Finished difference Result 639 states and 1603 transitions. [2018-06-26 20:34:59,847 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:59,847 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-26 20:34:59,847 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:59,849 INFO ]: With dead ends: 639 [2018-06-26 20:34:59,849 INFO ]: Without dead ends: 639 [2018-06-26 20:34:59,849 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:59,850 INFO ]: Start minimizeSevpa. Operand 639 states. [2018-06-26 20:34:59,862 INFO ]: Finished minimizeSevpa. Reduced states from 639 to 581. [2018-06-26 20:34:59,862 INFO ]: Start removeUnreachable. Operand 581 states. [2018-06-26 20:34:59,864 INFO ]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1511 transitions. [2018-06-26 20:34:59,864 INFO ]: Start accepts. Automaton has 581 states and 1511 transitions. Word has length 24 [2018-06-26 20:34:59,864 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:59,864 INFO ]: Abstraction has 581 states and 1511 transitions. [2018-06-26 20:34:59,864 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:59,864 INFO ]: Start isEmpty. Operand 581 states and 1511 transitions. [2018-06-26 20:34:59,868 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 20:34:59,868 INFO ]: Found error trace [2018-06-26 20:34:59,868 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:59,868 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:59,868 INFO ]: Analyzing trace with hash 57468995, now seen corresponding path program 1 times [2018-06-26 20:34:59,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:59,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:59,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:59,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:59,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:59,949 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:00,087 INFO ]: Checked inductivity of 325 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-06-26 20:35:00,087 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:35:00,087 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:35:00,087 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:35:00,088 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:35:00,088 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:35:00,088 INFO ]: Start difference. First operand 581 states and 1511 transitions. Second operand 3 states. [2018-06-26 20:35:00,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:35:00,735 INFO ]: Finished difference Result 616 states and 1578 transitions. [2018-06-26 20:35:00,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:35:00,735 INFO ]: Start accepts. Automaton has 3 states. Word has length 30 [2018-06-26 20:35:00,736 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:35:00,737 INFO ]: With dead ends: 616 [2018-06-26 20:35:00,737 INFO ]: Without dead ends: 596 [2018-06-26 20:35:00,738 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:35:00,738 INFO ]: Start minimizeSevpa. Operand 596 states. [2018-06-26 20:35:00,749 INFO ]: Finished minimizeSevpa. Reduced states from 596 to 580. [2018-06-26 20:35:00,749 INFO ]: Start removeUnreachable. Operand 580 states. [2018-06-26 20:35:00,751 INFO ]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1457 transitions. [2018-06-26 20:35:00,751 INFO ]: Start accepts. Automaton has 580 states and 1457 transitions. Word has length 30 [2018-06-26 20:35:00,751 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:35:00,751 INFO ]: Abstraction has 580 states and 1457 transitions. [2018-06-26 20:35:00,751 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:35:00,751 INFO ]: Start isEmpty. Operand 580 states and 1457 transitions. [2018-06-26 20:35:00,753 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 20:35:00,753 INFO ]: Found error trace [2018-06-26 20:35:00,753 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:35:00,753 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:35:00,753 INFO ]: Analyzing trace with hash -1210378071, now seen corresponding path program 1 times [2018-06-26 20:35:00,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:35:00,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:35:00,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:00,754 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:35:00,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:00,837 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:00,986 INFO ]: Checked inductivity of 435 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-06-26 20:35:00,986 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:35:00,986 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:35:00,986 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:35:00,986 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:35:00,986 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:35:00,986 INFO ]: Start difference. First operand 580 states and 1457 transitions. Second operand 3 states. [2018-06-26 20:35:01,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:35:01,946 INFO ]: Finished difference Result 737 states and 1732 transitions. [2018-06-26 20:35:01,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:35:01,974 INFO ]: Start accepts. Automaton has 3 states. Word has length 34 [2018-06-26 20:35:01,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:35:01,976 INFO ]: With dead ends: 737 [2018-06-26 20:35:01,976 INFO ]: Without dead ends: 716 [2018-06-26 20:35:01,976 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:35:01,976 INFO ]: Start minimizeSevpa. Operand 716 states. [2018-06-26 20:35:01,986 INFO ]: Finished minimizeSevpa. Reduced states from 716 to 586. [2018-06-26 20:35:01,986 INFO ]: Start removeUnreachable. Operand 586 states. [2018-06-26 20:35:01,988 INFO ]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1460 transitions. [2018-06-26 20:35:01,988 INFO ]: Start accepts. Automaton has 586 states and 1460 transitions. Word has length 34 [2018-06-26 20:35:01,988 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:35:01,988 INFO ]: Abstraction has 586 states and 1460 transitions. [2018-06-26 20:35:01,988 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:35:01,988 INFO ]: Start isEmpty. Operand 586 states and 1460 transitions. [2018-06-26 20:35:01,990 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 20:35:01,990 INFO ]: Found error trace [2018-06-26 20:35:01,990 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:35:01,990 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:35:01,990 INFO ]: Analyzing trace with hash 1310282113, now seen corresponding path program 1 times [2018-06-26 20:35:01,990 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:35:01,990 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:35:01,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:01,991 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:35:01,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:02,152 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:02,386 INFO ]: Checked inductivity of 435 backedges. 248 proven. 12 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-26 20:35:02,387 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:35:02,387 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) [2018-06-26 20:35:02,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:35:03,452 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:03,497 INFO ]: Computing forward predicates... [2018-06-26 20:35:03,536 INFO ]: Checked inductivity of 435 backedges. 248 proven. 12 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-26 20:35:03,574 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:35:03,574 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 20:35:03,574 INFO ]: Interpolant automaton has 4 states [2018-06-26 20:35:03,574 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 20:35:03,574 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:35:03,575 INFO ]: Start difference. First operand 586 states and 1460 transitions. Second operand 4 states. [2018-06-26 20:35:04,156 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:35:04,156 INFO ]: Finished difference Result 925 states and 2156 transitions. [2018-06-26 20:35:04,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 20:35:04,156 INFO ]: Start accepts. Automaton has 4 states. Word has length 34 [2018-06-26 20:35:04,156 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:35:04,159 INFO ]: With dead ends: 925 [2018-06-26 20:35:04,159 INFO ]: Without dead ends: 919 [2018-06-26 20:35:04,159 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:35:04,159 INFO ]: Start minimizeSevpa. Operand 919 states. [2018-06-26 20:35:04,172 INFO ]: Finished minimizeSevpa. Reduced states from 919 to 626. [2018-06-26 20:35:04,172 INFO ]: Start removeUnreachable. Operand 626 states. [2018-06-26 20:35:04,174 INFO ]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1557 transitions. [2018-06-26 20:35:04,175 INFO ]: Start accepts. Automaton has 626 states and 1557 transitions. Word has length 34 [2018-06-26 20:35:04,175 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:35:04,175 INFO ]: Abstraction has 626 states and 1557 transitions. [2018-06-26 20:35:04,175 INFO ]: Interpolant automaton has 4 states. [2018-06-26 20:35:04,175 INFO ]: Start isEmpty. Operand 626 states and 1557 transitions. [2018-06-26 20:35:04,176 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 20:35:04,176 INFO ]: Found error trace [2018-06-26 20:35:04,177 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:35:04,177 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:35:04,177 INFO ]: Analyzing trace with hash -1194287328, now seen corresponding path program 1 times [2018-06-26 20:35:04,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:35:04,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:35:04,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:04,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:35:04,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:04,278 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:05,647 INFO ]: Checked inductivity of 435 backedges. 152 proven. 233 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-26 20:35:05,647 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:35:05,647 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) [2018-06-26 20:35:05,661 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:35:06,898 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:06,939 INFO ]: Computing forward predicates... [2018-06-26 20:35:07,046 INFO ]: Checked inductivity of 435 backedges. 131 proven. 213 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-26 20:35:07,074 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:35:07,114 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2018-06-26 20:35:07,115 INFO ]: Interpolant automaton has 10 states [2018-06-26 20:35:07,115 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 20:35:07,115 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 20:35:07,115 INFO ]: Start difference. First operand 626 states and 1557 transitions. Second operand 10 states. [2018-06-26 20:35:09,548 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:35:09,548 INFO ]: Finished difference Result 1575 states and 3591 transitions. [2018-06-26 20:35:09,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 20:35:09,549 INFO ]: Start accepts. Automaton has 10 states. Word has length 34 [2018-06-26 20:35:09,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:35:09,553 INFO ]: With dead ends: 1575 [2018-06-26 20:35:09,553 INFO ]: Without dead ends: 1565 [2018-06-26 20:35:09,553 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 14 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-06-26 20:35:09,553 INFO ]: Start minimizeSevpa. Operand 1565 states. [2018-06-26 20:35:09,573 INFO ]: Finished minimizeSevpa. Reduced states from 1565 to 986. [2018-06-26 20:35:09,573 INFO ]: Start removeUnreachable. Operand 986 states. [2018-06-26 20:35:09,576 INFO ]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2497 transitions. [2018-06-26 20:35:09,576 INFO ]: Start accepts. Automaton has 986 states and 2497 transitions. Word has length 34 [2018-06-26 20:35:09,576 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:35:09,576 INFO ]: Abstraction has 986 states and 2497 transitions. [2018-06-26 20:35:09,576 INFO ]: Interpolant automaton has 10 states. [2018-06-26 20:35:09,576 INFO ]: Start isEmpty. Operand 986 states and 2497 transitions. [2018-06-26 20:35:09,578 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 20:35:09,578 INFO ]: Found error trace [2018-06-26 20:35:09,578 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:35:09,578 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:35:09,578 INFO ]: Analyzing trace with hash -1730220170, now seen corresponding path program 1 times [2018-06-26 20:35:09,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:35:09,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:35:09,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:09,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:35:09,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:09,636 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:09,838 INFO ]: Checked inductivity of 528 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-06-26 20:35:09,838 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:35:09,838 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:35:09,838 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:35:09,838 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:35:09,838 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:35:09,838 INFO ]: Start difference. First operand 986 states and 2497 transitions. Second operand 3 states. [2018-06-26 20:35:10,387 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:35:10,387 INFO ]: Finished difference Result 1004 states and 2291 transitions. [2018-06-26 20:35:10,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:35:10,388 INFO ]: Start accepts. Automaton has 3 states. Word has length 37 [2018-06-26 20:35:10,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:35:10,390 INFO ]: With dead ends: 1004 [2018-06-26 20:35:10,390 INFO ]: Without dead ends: 996 [2018-06-26 20:35:10,390 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:35:10,390 INFO ]: Start minimizeSevpa. Operand 996 states. [2018-06-26 20:35:10,402 INFO ]: Finished minimizeSevpa. Reduced states from 996 to 901. [2018-06-26 20:35:10,402 INFO ]: Start removeUnreachable. Operand 901 states. [2018-06-26 20:35:10,405 INFO ]: Finished removeUnreachable. Reduced from 901 states to 901 states and 2079 transitions. [2018-06-26 20:35:10,405 INFO ]: Start accepts. Automaton has 901 states and 2079 transitions. Word has length 37 [2018-06-26 20:35:10,406 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:35:10,406 INFO ]: Abstraction has 901 states and 2079 transitions. [2018-06-26 20:35:10,406 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:35:10,406 INFO ]: Start isEmpty. Operand 901 states and 2079 transitions. [2018-06-26 20:35:10,408 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 20:35:10,408 INFO ]: Found error trace [2018-06-26 20:35:10,408 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:35:10,408 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:35:10,408 INFO ]: Analyzing trace with hash -240363254, now seen corresponding path program 1 times [2018-06-26 20:35:10,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:35:10,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:35:10,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:10,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:35:10,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:10,496 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:10,638 INFO ]: Checked inductivity of 703 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-06-26 20:35:10,638 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:35:10,638 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:35:10,638 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:35:10,639 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:35:10,639 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:35:10,639 INFO ]: Start difference. First operand 901 states and 2079 transitions. Second operand 3 states. [2018-06-26 20:35:11,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:35:11,436 INFO ]: Finished difference Result 979 states and 2137 transitions. [2018-06-26 20:35:11,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:35:11,436 INFO ]: Start accepts. Automaton has 3 states. Word has length 42 [2018-06-26 20:35:11,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:35:11,439 INFO ]: With dead ends: 979 [2018-06-26 20:35:11,439 INFO ]: Without dead ends: 943 [2018-06-26 20:35:11,439 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:35:11,439 INFO ]: Start minimizeSevpa. Operand 943 states. [2018-06-26 20:35:11,451 INFO ]: Finished minimizeSevpa. Reduced states from 943 to 875. [2018-06-26 20:35:11,451 INFO ]: Start removeUnreachable. Operand 875 states. [2018-06-26 20:35:11,454 INFO ]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1982 transitions. [2018-06-26 20:35:11,454 INFO ]: Start accepts. Automaton has 875 states and 1982 transitions. Word has length 42 [2018-06-26 20:35:11,454 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:35:11,454 INFO ]: Abstraction has 875 states and 1982 transitions. [2018-06-26 20:35:11,454 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:35:11,454 INFO ]: Start isEmpty. Operand 875 states and 1982 transitions. [2018-06-26 20:35:11,456 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-26 20:35:11,456 INFO ]: Found error trace [2018-06-26 20:35:11,456 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:35:11,456 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:35:11,456 INFO ]: Analyzing trace with hash -80626499, now seen corresponding path program 1 times [2018-06-26 20:35:11,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:35:11,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:35:11,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:11,456 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:35:11,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:11,510 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:11,624 INFO ]: Checked inductivity of 780 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-06-26 20:35:11,625 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:35:11,625 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:35:11,625 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:35:11,625 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:35:11,625 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:35:11,625 INFO ]: Start difference. First operand 875 states and 1982 transitions. Second operand 3 states. [2018-06-26 20:35:12,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:35:12,202 INFO ]: Finished difference Result 1103 states and 2450 transitions. [2018-06-26 20:35:12,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:35:12,202 INFO ]: Start accepts. Automaton has 3 states. Word has length 44 [2018-06-26 20:35:12,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:35:12,206 INFO ]: With dead ends: 1103 [2018-06-26 20:35:12,206 INFO ]: Without dead ends: 996 [2018-06-26 20:35:12,206 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:35:12,207 INFO ]: Start minimizeSevpa. Operand 996 states. [2018-06-26 20:35:12,216 INFO ]: Finished minimizeSevpa. Reduced states from 996 to 896. [2018-06-26 20:35:12,216 INFO ]: Start removeUnreachable. Operand 896 states. [2018-06-26 20:35:12,219 INFO ]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1962 transitions. [2018-06-26 20:35:12,219 INFO ]: Start accepts. Automaton has 896 states and 1962 transitions. Word has length 44 [2018-06-26 20:35:12,219 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:35:12,219 INFO ]: Abstraction has 896 states and 1962 transitions. [2018-06-26 20:35:12,219 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:35:12,219 INFO ]: Start isEmpty. Operand 896 states and 1962 transitions. [2018-06-26 20:35:12,220 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-26 20:35:12,220 INFO ]: Found error trace [2018-06-26 20:35:12,220 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:35:12,221 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:35:12,221 INFO ]: Analyzing trace with hash -557164882, now seen corresponding path program 1 times [2018-06-26 20:35:12,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:35:12,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:35:12,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:12,221 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:35:12,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:12,327 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:12,531 INFO ]: Checked inductivity of 820 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-06-26 20:35:12,531 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:35:12,531 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:35:12,531 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:35:12,531 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:35:12,531 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:35:12,531 INFO ]: Start difference. First operand 896 states and 1962 transitions. Second operand 3 states. [2018-06-26 20:35:12,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:35:12,989 INFO ]: Finished difference Result 1118 states and 2301 transitions. [2018-06-26 20:35:12,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:35:12,990 INFO ]: Start accepts. Automaton has 3 states. Word has length 45 [2018-06-26 20:35:12,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:35:12,993 INFO ]: With dead ends: 1118 [2018-06-26 20:35:12,993 INFO ]: Without dead ends: 1109 [2018-06-26 20:35:12,994 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:35:12,994 INFO ]: Start minimizeSevpa. Operand 1109 states. [2018-06-26 20:35:13,001 INFO ]: Finished minimizeSevpa. Reduced states from 1109 to 876. [2018-06-26 20:35:13,001 INFO ]: Start removeUnreachable. Operand 876 states. [2018-06-26 20:35:13,002 INFO ]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1913 transitions. [2018-06-26 20:35:13,002 INFO ]: Start accepts. Automaton has 876 states and 1913 transitions. Word has length 45 [2018-06-26 20:35:13,002 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:35:13,002 INFO ]: Abstraction has 876 states and 1913 transitions. [2018-06-26 20:35:13,002 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:35:13,002 INFO ]: Start isEmpty. Operand 876 states and 1913 transitions. [2018-06-26 20:35:13,004 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 20:35:13,004 INFO ]: Found error trace [2018-06-26 20:35:13,005 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:35:13,005 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:35:13,005 INFO ]: Analyzing trace with hash -15485587, now seen corresponding path program 1 times [2018-06-26 20:35:13,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:35:13,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:35:13,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:13,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:35:13,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:13,142 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:14,019 INFO ]: Checked inductivity of 1035 backedges. 571 proven. 214 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-06-26 20:35:14,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:35:14,019 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:35:14,025 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:35:15,627 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:15,695 INFO ]: Computing forward predicates... [2018-06-26 20:35:16,090 INFO ]: Checked inductivity of 1035 backedges. 631 proven. 154 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-06-26 20:35:16,119 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:35:16,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-26 20:35:16,120 INFO ]: Interpolant automaton has 13 states [2018-06-26 20:35:16,120 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 20:35:16,120 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-26 20:35:16,120 INFO ]: Start difference. First operand 876 states and 1913 transitions. Second operand 13 states. [2018-06-26 20:35:18,468 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:35:18,468 INFO ]: Finished difference Result 1813 states and 3484 transitions. [2018-06-26 20:35:18,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 20:35:18,468 INFO ]: Start accepts. Automaton has 13 states. Word has length 50 [2018-06-26 20:35:18,468 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:35:18,472 INFO ]: With dead ends: 1813 [2018-06-26 20:35:18,472 INFO ]: Without dead ends: 1813 [2018-06-26 20:35:18,473 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-06-26 20:35:18,474 INFO ]: Start minimizeSevpa. Operand 1813 states. [2018-06-26 20:35:18,487 INFO ]: Finished minimizeSevpa. Reduced states from 1813 to 919. [2018-06-26 20:35:18,487 INFO ]: Start removeUnreachable. Operand 919 states. [2018-06-26 20:35:18,489 INFO ]: Finished removeUnreachable. Reduced from 919 states to 919 states and 2015 transitions. [2018-06-26 20:35:18,489 INFO ]: Start accepts. Automaton has 919 states and 2015 transitions. Word has length 50 [2018-06-26 20:35:18,489 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:35:18,489 INFO ]: Abstraction has 919 states and 2015 transitions. [2018-06-26 20:35:18,489 INFO ]: Interpolant automaton has 13 states. [2018-06-26 20:35:18,489 INFO ]: Start isEmpty. Operand 919 states and 2015 transitions. [2018-06-26 20:35:18,491 INFO ]: Finished isEmpty. Found accepting run of length 67 [2018-06-26 20:35:18,491 INFO ]: Found error trace [2018-06-26 20:35:18,491 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:35:18,491 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:35:18,491 INFO ]: Analyzing trace with hash -824935892, now seen corresponding path program 1 times [2018-06-26 20:35:18,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:35:18,491 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:35:18,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:18,492 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:35:18,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:18,688 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:19,720 INFO ]: Checked inductivity of 1891 backedges. 975 proven. 214 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-06-26 20:35:19,720 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:35:19,720 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:35:19,726 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:35:21,806 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:21,888 INFO ]: Computing forward predicates... [2018-06-26 20:35:21,974 INFO ]: Checked inductivity of 1891 backedges. 1031 proven. 154 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2018-06-26 20:35:22,008 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:35:22,008 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2018-06-26 20:35:22,008 INFO ]: Interpolant automaton has 14 states [2018-06-26 20:35:22,008 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 20:35:22,008 INFO ]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-26 20:35:22,008 INFO ]: Start difference. First operand 919 states and 2015 transitions. Second operand 14 states. [2018-06-26 20:35:25,106 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:35:25,106 INFO ]: Finished difference Result 1892 states and 3638 transitions. [2018-06-26 20:35:25,107 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 20:35:25,107 INFO ]: Start accepts. Automaton has 14 states. Word has length 66 [2018-06-26 20:35:25,107 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:35:25,112 INFO ]: With dead ends: 1892 [2018-06-26 20:35:25,112 INFO ]: Without dead ends: 1892 [2018-06-26 20:35:25,113 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2018-06-26 20:35:25,113 INFO ]: Start minimizeSevpa. Operand 1892 states. [2018-06-26 20:35:25,126 INFO ]: Finished minimizeSevpa. Reduced states from 1892 to 962. [2018-06-26 20:35:25,126 INFO ]: Start removeUnreachable. Operand 962 states. [2018-06-26 20:35:25,127 INFO ]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2117 transitions. [2018-06-26 20:35:25,127 INFO ]: Start accepts. Automaton has 962 states and 2117 transitions. Word has length 66 [2018-06-26 20:35:25,127 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:35:25,127 INFO ]: Abstraction has 962 states and 2117 transitions. [2018-06-26 20:35:25,127 INFO ]: Interpolant automaton has 14 states. [2018-06-26 20:35:25,127 INFO ]: Start isEmpty. Operand 962 states and 2117 transitions. [2018-06-26 20:35:25,129 INFO ]: Finished isEmpty. Found accepting run of length 83 [2018-06-26 20:35:25,129 INFO ]: Found error trace [2018-06-26 20:35:25,129 INFO ]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:35:25,129 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:35:25,129 INFO ]: Analyzing trace with hash 1564872532, now seen corresponding path program 1 times [2018-06-26 20:35:25,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:35:25,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:35:25,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:25,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:35:25,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:35:25,328 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:26,166 INFO ]: Checked inductivity of 3003 backedges. 1371 proven. 214 refuted. 0 times theorem prover too weak. 1418 trivial. 0 not checked. [2018-06-26 20:35:26,166 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:35:26,166 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:35:26,172 INFO ]: Keeping assertion order NOT_INCREMENTALLY Received shutdown request... [2018-06-26 20:35:28,942 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:35:29,065 INFO ]: Computing forward predicates... [2018-06-26 20:35:29,066 INFO ]: Timeout while computing interpolants [2018-06-26 20:35:29,267 WARN ]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:35:29,267 WARN ]: Verification canceled [2018-06-26 20:35:29,269 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:35:29,271 WARN ]: Timeout [2018-06-26 20:35:29,271 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:35:29 BasicIcfg [2018-06-26 20:35:29,271 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:35:29,272 INFO ]: Toolchain (without parser) took 58579.93 ms. Allocated memory was 326.1 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 296.8 MB in the beginning and 612.6 MB in the end (delta: -315.8 MB). Peak memory consumption was 809.9 MB. Max. memory is 3.6 GB. [2018-06-26 20:35:29,273 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.6 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:35:29,273 INFO ]: ChcToBoogie took 93.53 ms. Allocated memory is still 326.1 MB. Free memory was 296.8 MB in the beginning and 294.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 3.6 GB. [2018-06-26 20:35:29,273 INFO ]: Boogie Preprocessor took 83.13 ms. Allocated memory is still 326.1 MB. Free memory was 294.4 MB in the beginning and 289.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 3.6 GB. [2018-06-26 20:35:29,273 INFO ]: RCFGBuilder took 703.49 ms. Allocated memory is still 326.1 MB. Free memory was 289.6 MB in the beginning and 214.3 MB in the end (delta: 75.2 MB). Peak memory consumption was 75.2 MB. Max. memory is 3.6 GB. [2018-06-26 20:35:29,274 INFO ]: BlockEncodingV2 took 791.57 ms. Allocated memory was 326.1 MB in the beginning and 383.3 MB in the end (delta: 57.1 MB). Free memory was 214.3 MB in the beginning and 239.4 MB in the end (delta: -25.0 MB). Peak memory consumption was 55.4 MB. Max. memory is 3.6 GB. [2018-06-26 20:35:29,278 INFO ]: TraceAbstraction took 56894.57 ms. Allocated memory was 383.3 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 239.4 MB in the beginning and 612.6 MB in the end (delta: -373.2 MB). Peak memory consumption was 695.3 MB. Max. memory is 3.6 GB. [2018-06-26 20:35:29,280 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 117 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 303.6 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 93.53 ms. Allocated memory is still 326.1 MB. Free memory was 296.8 MB in the beginning and 294.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 83.13 ms. Allocated memory is still 326.1 MB. Free memory was 294.4 MB in the beginning and 289.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 3.6 GB. * RCFGBuilder took 703.49 ms. Allocated memory is still 326.1 MB. Free memory was 289.6 MB in the beginning and 214.3 MB in the end (delta: 75.2 MB). Peak memory consumption was 75.2 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 791.57 ms. Allocated memory was 326.1 MB in the beginning and 383.3 MB in the end (delta: 57.1 MB). Free memory was 214.3 MB in the beginning and 239.4 MB in the end (delta: -25.0 MB). Peak memory consumption was 55.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56894.57 ms. Allocated memory was 383.3 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 239.4 MB in the beginning and 612.6 MB in the end (delta: -373.2 MB). Peak memory consumption was 695.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 3 quantified variables from 4 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 56.8s OverallTime, 34 OverallIterations, 5 TraceHistogramMax, 34.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 161 SDtfs, 4 SDslu, 222 SDs, 0 SdLazy, 14942 SolverSat, 3669 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 341 SyntacticMatches, 45 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=986occurred in iteration=27, 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.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 3929 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 2.7s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 916 NumberOfCodeBlocks, 916 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 878 ConstructedInterpolants, 0 QuantifiedInterpolants, 66366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 51409 ConjunctsInSsa, 443 ConjunctsInUnsatCore, 38 InterpolantComputations, 28 PerfectInterpolantSequences, 11240/12486 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/mem_slave_tlm.5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-35-29-299.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-35-29-299.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-35-29-299.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-35-29-299.csv Completed graceful shutdown