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/s3_srvr_3.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:47:10,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:47:10,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:47:10,758 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:47:10,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:47:10,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:47:10,760 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:47:10,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:47:10,765 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:47:10,767 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:47:10,768 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:47:10,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:47:10,769 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:47:10,770 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:47:10,774 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:47:10,775 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:47:10,776 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:47:10,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:47:10,781 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:47:10,782 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:47:10,783 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:47:10,784 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:47:10,787 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:47:10,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:47:10,787 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:47:10,788 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:47:10,789 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:47:10,790 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:47:10,790 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:47:10,791 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:47:10,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:47:10,792 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:47:10,792 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:47:10,792 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:47:10,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:47:10,794 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:47:10,794 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:47:10,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:47:10,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:47:10,814 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:47:10,814 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:47:10,815 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:47:10,815 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:47:10,815 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:47:10,815 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:47:10,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:47:10,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:47:10,816 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:47:10,816 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:47:10,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:47:10,817 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:47:10,817 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:47:10,817 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:47:10,817 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:47:10,817 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:47:10,818 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:47:10,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:47:10,818 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:47:10,819 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:47:10,820 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:47:10,866 INFO ]: Repository-Root is: /tmp [2018-06-26 20:47:10,882 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:47:10,887 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:47:10,889 INFO ]: Initializing SmtParser... [2018-06-26 20:47:10,889 INFO ]: SmtParser initialized [2018-06-26 20:47:10,890 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_3.cil.smt2 [2018-06-26 20:47:10,891 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:47:10,977 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_3.cil.smt2 unknown [2018-06-26 20:47:11,484 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_3.cil.smt2 [2018-06-26 20:47:11,488 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:47:11,494 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:47:11,494 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:47:11,494 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:47:11,494 INFO ]: ChcToBoogie initialized [2018-06-26 20:47:11,497 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:47:11" (1/1) ... [2018-06-26 20:47:11,561 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:11 Unit [2018-06-26 20:47:11,561 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:47:11,562 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:47:11,562 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:47:11,562 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:47:11,592 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:11" (1/1) ... [2018-06-26 20:47:11,592 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:11" (1/1) ... [2018-06-26 20:47:11,616 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:11" (1/1) ... [2018-06-26 20:47:11,616 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:11" (1/1) ... [2018-06-26 20:47:11,639 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:11" (1/1) ... [2018-06-26 20:47:11,650 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:11" (1/1) ... [2018-06-26 20:47:11,653 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:11" (1/1) ... [2018-06-26 20:47:11,657 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:47:11,658 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:47:11,658 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:47:11,658 INFO ]: RCFGBuilder initialized [2018-06-26 20:47:11,659 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:11" (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:47:11,670 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:47:11,670 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:47:11,670 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:47:11,670 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:47:11,670 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:47:11,670 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:47:12,093 INFO ]: Using library mode [2018-06-26 20:47:12,093 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:47:12 BoogieIcfgContainer [2018-06-26 20:47:12,094 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:47:12,095 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:47:12,095 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:47:12,096 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:47:12,097 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:47:12" (1/1) ... [2018-06-26 20:47:12,116 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:47:12,117 INFO ]: Using Remove infeasible edges [2018-06-26 20:47:12,118 INFO ]: Using Maximize final states [2018-06-26 20:47:12,119 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:47:12,119 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:47:12,121 INFO ]: Using Remove sink states [2018-06-26 20:47:12,121 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:47:12,121 INFO ]: Using Use SBE [2018-06-26 20:47:13,682 INFO ]: SBE split 1 edges [2018-06-26 20:47:13,780 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:47:13,785 INFO ]: 0 new accepting states [2018-06-26 20:47:13,848 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:47:13,850 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:47:14,010 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:47:14,011 INFO ]: 0 new accepting states [2018-06-26 20:47:14,012 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:47:14,013 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:47:14,169 INFO ]: Encoded RCFG 6 locations, 884 edges [2018-06-26 20:47:14,169 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:47:14 BasicIcfg [2018-06-26 20:47:14,169 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:47:14,172 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:47:14,172 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:47:14,177 INFO ]: TraceAbstraction initialized [2018-06-26 20:47:14,177 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:47:11" (1/4) ... [2018-06-26 20:47:14,178 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1e481e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:47:14, skipping insertion in model container [2018-06-26 20:47:14,179 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:11" (2/4) ... [2018-06-26 20:47:14,179 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1e481e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:47:14, skipping insertion in model container [2018-06-26 20:47:14,179 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:47:12" (3/4) ... [2018-06-26 20:47:14,179 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1e481e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:47:14, skipping insertion in model container [2018-06-26 20:47:14,179 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:47:14" (4/4) ... [2018-06-26 20:47:14,181 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:47:14,191 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:47:14,199 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:47:14,245 INFO ]: Using default assertion order modulation [2018-06-26 20:47:14,245 INFO ]: Interprodecural is true [2018-06-26 20:47:14,245 INFO ]: Hoare is false [2018-06-26 20:47:14,245 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:47:14,245 INFO ]: Backedges is TWOTRACK [2018-06-26 20:47:14,246 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:47:14,246 INFO ]: Difference is false [2018-06-26 20:47:14,246 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:47:14,246 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:47:14,266 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:47:14,288 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:47:14,288 INFO ]: Found error trace [2018-06-26 20:47:14,289 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:47:14,289 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:14,294 INFO ]: Analyzing trace with hash 62433570, now seen corresponding path program 1 times [2018-06-26 20:47:14,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:14,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:14,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:14,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:14,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:14,393 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:14,510 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:47:14,513 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:14,514 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:14,516 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:14,531 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:14,532 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:14,534 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:47:20,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:20,453 INFO ]: Finished difference Result 7 states and 981 transitions. [2018-06-26 20:47:20,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:20,454 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:47:20,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:20,471 INFO ]: With dead ends: 7 [2018-06-26 20:47:20,471 INFO ]: Without dead ends: 7 [2018-06-26 20:47:20,472 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:47:20,493 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:47:20,526 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:47:20,527 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:47:20,530 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 981 transitions. [2018-06-26 20:47:20,531 INFO ]: Start accepts. Automaton has 7 states and 981 transitions. Word has length 5 [2018-06-26 20:47:20,534 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:20,534 INFO ]: Abstraction has 7 states and 981 transitions. [2018-06-26 20:47:20,534 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:20,534 INFO ]: Start isEmpty. Operand 7 states and 981 transitions. [2018-06-26 20:47:20,535 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:47:20,535 INFO ]: Found error trace [2018-06-26 20:47:20,535 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:47:20,535 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:20,535 INFO ]: Analyzing trace with hash 1918263915, now seen corresponding path program 1 times [2018-06-26 20:47:20,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:20,535 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:20,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:20,537 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:20,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:20,600 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:20,707 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:47:20,708 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:20,708 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:20,709 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:20,709 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:20,709 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:20,709 INFO ]: Start difference. First operand 7 states and 981 transitions. Second operand 3 states. [2018-06-26 20:47:23,432 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:23,432 INFO ]: Finished difference Result 8 states and 983 transitions. [2018-06-26 20:47:23,433 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:23,433 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:47:23,433 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:23,434 INFO ]: With dead ends: 8 [2018-06-26 20:47:23,434 INFO ]: Without dead ends: 8 [2018-06-26 20:47:23,435 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:47:23,435 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 20:47:23,444 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 20:47:23,444 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 20:47:23,446 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 983 transitions. [2018-06-26 20:47:23,446 INFO ]: Start accepts. Automaton has 8 states and 983 transitions. Word has length 6 [2018-06-26 20:47:23,446 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:23,447 INFO ]: Abstraction has 8 states and 983 transitions. [2018-06-26 20:47:23,447 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:23,447 INFO ]: Start isEmpty. Operand 8 states and 983 transitions. [2018-06-26 20:47:23,447 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:47:23,447 INFO ]: Found error trace [2018-06-26 20:47:23,447 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:47:23,447 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:23,447 INFO ]: Analyzing trace with hash 1928005572, now seen corresponding path program 1 times [2018-06-26 20:47:23,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:23,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:23,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:23,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:23,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:23,469 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:23,498 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:47:23,498 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:23,498 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:23,498 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:23,499 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:23,499 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:23,499 INFO ]: Start difference. First operand 8 states and 983 transitions. Second operand 3 states. [2018-06-26 20:47:26,363 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:26,363 INFO ]: Finished difference Result 9 states and 985 transitions. [2018-06-26 20:47:26,366 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:26,366 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:47:26,366 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:26,368 INFO ]: With dead ends: 9 [2018-06-26 20:47:26,368 INFO ]: Without dead ends: 9 [2018-06-26 20:47:26,368 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:47:26,368 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:47:26,373 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:47:26,373 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:47:26,375 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 985 transitions. [2018-06-26 20:47:26,375 INFO ]: Start accepts. Automaton has 9 states and 985 transitions. Word has length 6 [2018-06-26 20:47:26,375 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:26,375 INFO ]: Abstraction has 9 states and 985 transitions. [2018-06-26 20:47:26,375 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:26,375 INFO ]: Start isEmpty. Operand 9 states and 985 transitions. [2018-06-26 20:47:26,376 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:47:26,376 INFO ]: Found error trace [2018-06-26 20:47:26,376 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:26,376 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:26,376 INFO ]: Analyzing trace with hash 1637959943, now seen corresponding path program 1 times [2018-06-26 20:47:26,376 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:26,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:26,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:26,377 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:26,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:26,427 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:26,492 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:47:26,492 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:26,492 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:26,493 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:26,493 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:26,493 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:26,493 INFO ]: Start difference. First operand 9 states and 985 transitions. Second operand 3 states. [2018-06-26 20:47:29,119 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:29,119 INFO ]: Finished difference Result 11 states and 1025 transitions. [2018-06-26 20:47:29,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:29,121 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:47:29,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:29,123 INFO ]: With dead ends: 11 [2018-06-26 20:47:29,123 INFO ]: Without dead ends: 11 [2018-06-26 20:47:29,123 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:47:29,123 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:47:29,129 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-26 20:47:29,129 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 20:47:29,131 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1023 transitions. [2018-06-26 20:47:29,131 INFO ]: Start accepts. Automaton has 10 states and 1023 transitions. Word has length 8 [2018-06-26 20:47:29,132 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:29,132 INFO ]: Abstraction has 10 states and 1023 transitions. [2018-06-26 20:47:29,132 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:29,132 INFO ]: Start isEmpty. Operand 10 states and 1023 transitions. [2018-06-26 20:47:29,132 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:47:29,132 INFO ]: Found error trace [2018-06-26 20:47:29,132 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:29,132 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:29,133 INFO ]: Analyzing trace with hash -629492151, now seen corresponding path program 1 times [2018-06-26 20:47:29,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:29,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:29,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:29,135 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:29,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:29,197 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:29,279 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:47:29,279 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:29,280 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:29,280 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:29,280 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:29,280 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:29,280 INFO ]: Start difference. First operand 10 states and 1023 transitions. Second operand 3 states. [2018-06-26 20:47:31,678 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:31,678 INFO ]: Finished difference Result 13 states and 1526 transitions. [2018-06-26 20:47:31,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:31,682 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:47:31,682 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:31,684 INFO ]: With dead ends: 13 [2018-06-26 20:47:31,684 INFO ]: Without dead ends: 13 [2018-06-26 20:47:31,685 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:47:31,685 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:47:31,699 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 20:47:31,699 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:47:31,702 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1524 transitions. [2018-06-26 20:47:31,702 INFO ]: Start accepts. Automaton has 12 states and 1524 transitions. Word has length 9 [2018-06-26 20:47:31,702 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:31,702 INFO ]: Abstraction has 12 states and 1524 transitions. [2018-06-26 20:47:31,702 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:31,702 INFO ]: Start isEmpty. Operand 12 states and 1524 transitions. [2018-06-26 20:47:31,704 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:47:31,704 INFO ]: Found error trace [2018-06-26 20:47:31,704 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:31,704 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:31,704 INFO ]: Analyzing trace with hash -387529649, now seen corresponding path program 1 times [2018-06-26 20:47:31,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:31,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:31,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:31,705 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:31,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:31,739 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:31,793 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:47:31,793 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:31,793 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:31,793 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:31,793 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:31,793 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:31,794 INFO ]: Start difference. First operand 12 states and 1524 transitions. Second operand 3 states. [2018-06-26 20:47:33,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:33,878 INFO ]: Finished difference Result 15 states and 1812 transitions. [2018-06-26 20:47:33,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:33,879 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:47:33,879 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:33,882 INFO ]: With dead ends: 15 [2018-06-26 20:47:33,882 INFO ]: Without dead ends: 14 [2018-06-26 20:47:33,882 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:47:33,882 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 20:47:33,892 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 20:47:33,892 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 20:47:33,894 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1810 transitions. [2018-06-26 20:47:33,894 INFO ]: Start accepts. Automaton has 14 states and 1810 transitions. Word has length 9 [2018-06-26 20:47:33,894 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:33,894 INFO ]: Abstraction has 14 states and 1810 transitions. [2018-06-26 20:47:33,894 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:33,894 INFO ]: Start isEmpty. Operand 14 states and 1810 transitions. [2018-06-26 20:47:33,895 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:47:33,895 INFO ]: Found error trace [2018-06-26 20:47:33,895 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:33,895 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:33,895 INFO ]: Analyzing trace with hash -445711472, now seen corresponding path program 1 times [2018-06-26 20:47:33,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:33,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:33,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:33,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:33,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:33,928 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:34,018 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:47:34,018 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:34,018 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:34,018 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:34,018 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:34,018 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:34,018 INFO ]: Start difference. First operand 14 states and 1810 transitions. Second operand 3 states. [2018-06-26 20:47:36,422 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:36,422 INFO ]: Finished difference Result 17 states and 1876 transitions. [2018-06-26 20:47:36,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:36,425 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:47:36,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:36,428 INFO ]: With dead ends: 17 [2018-06-26 20:47:36,428 INFO ]: Without dead ends: 17 [2018-06-26 20:47:36,428 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:47:36,428 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:47:36,449 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-26 20:47:36,449 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 20:47:36,450 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1810 transitions. [2018-06-26 20:47:36,450 INFO ]: Start accepts. Automaton has 14 states and 1810 transitions. Word has length 9 [2018-06-26 20:47:36,450 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:36,450 INFO ]: Abstraction has 14 states and 1810 transitions. [2018-06-26 20:47:36,450 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:36,450 INFO ]: Start isEmpty. Operand 14 states and 1810 transitions. [2018-06-26 20:47:36,451 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:47:36,451 INFO ]: Found error trace [2018-06-26 20:47:36,452 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:36,452 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:36,452 INFO ]: Analyzing trace with hash -966577316, now seen corresponding path program 1 times [2018-06-26 20:47:36,452 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:36,452 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:36,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:36,452 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:36,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:36,481 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:36,536 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:47:36,536 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:36,536 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:36,537 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:36,537 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:36,537 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:36,537 INFO ]: Start difference. First operand 14 states and 1810 transitions. Second operand 3 states. [2018-06-26 20:47:38,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:38,817 INFO ]: Finished difference Result 17 states and 1972 transitions. [2018-06-26 20:47:38,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:38,818 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:47:38,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:38,819 INFO ]: With dead ends: 17 [2018-06-26 20:47:38,819 INFO ]: Without dead ends: 17 [2018-06-26 20:47:38,820 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:47:38,820 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:47:38,831 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-26 20:47:38,831 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 20:47:38,833 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1970 transitions. [2018-06-26 20:47:38,833 INFO ]: Start accepts. Automaton has 16 states and 1970 transitions. Word has length 9 [2018-06-26 20:47:38,834 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:38,834 INFO ]: Abstraction has 16 states and 1970 transitions. [2018-06-26 20:47:38,834 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:38,834 INFO ]: Start isEmpty. Operand 16 states and 1970 transitions. [2018-06-26 20:47:38,835 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:47:38,835 INFO ]: Found error trace [2018-06-26 20:47:38,835 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:38,835 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:38,835 INFO ]: Analyzing trace with hash 828447426, now seen corresponding path program 1 times [2018-06-26 20:47:38,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:38,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:38,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:38,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:38,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:38,876 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:38,970 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:47:38,970 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:38,970 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:38,971 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:38,971 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:38,971 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:38,971 INFO ]: Start difference. First operand 16 states and 1970 transitions. Second operand 3 states. [2018-06-26 20:47:41,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:41,266 INFO ]: Finished difference Result 19 states and 2228 transitions. [2018-06-26 20:47:41,266 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:41,266 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:47:41,266 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:41,269 INFO ]: With dead ends: 19 [2018-06-26 20:47:41,269 INFO ]: Without dead ends: 19 [2018-06-26 20:47:41,269 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:47:41,269 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 20:47:41,280 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-06-26 20:47:41,280 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 20:47:41,285 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2226 transitions. [2018-06-26 20:47:41,285 INFO ]: Start accepts. Automaton has 18 states and 2226 transitions. Word has length 10 [2018-06-26 20:47:41,285 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:41,285 INFO ]: Abstraction has 18 states and 2226 transitions. [2018-06-26 20:47:41,285 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:41,285 INFO ]: Start isEmpty. Operand 18 states and 2226 transitions. [2018-06-26 20:47:41,286 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:47:41,286 INFO ]: Found error trace [2018-06-26 20:47:41,286 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:41,286 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:41,287 INFO ]: Analyzing trace with hash 1064868802, now seen corresponding path program 1 times [2018-06-26 20:47:41,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:41,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:41,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:41,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:41,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:41,323 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:41,390 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:47:41,390 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:41,390 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:41,390 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:41,390 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:41,390 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:41,391 INFO ]: Start difference. First operand 18 states and 2226 transitions. Second operand 3 states. [2018-06-26 20:47:43,324 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:43,324 INFO ]: Finished difference Result 21 states and 2628 transitions. [2018-06-26 20:47:43,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:43,325 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:47:43,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:43,327 INFO ]: With dead ends: 21 [2018-06-26 20:47:43,327 INFO ]: Without dead ends: 21 [2018-06-26 20:47:43,327 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:47:43,327 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 20:47:43,336 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-06-26 20:47:43,336 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 20:47:43,338 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2626 transitions. [2018-06-26 20:47:43,338 INFO ]: Start accepts. Automaton has 20 states and 2626 transitions. Word has length 10 [2018-06-26 20:47:43,338 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:43,338 INFO ]: Abstraction has 20 states and 2626 transitions. [2018-06-26 20:47:43,338 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:43,338 INFO ]: Start isEmpty. Operand 20 states and 2626 transitions. [2018-06-26 20:47:43,340 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:47:43,340 INFO ]: Found error trace [2018-06-26 20:47:43,340 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:43,340 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:43,341 INFO ]: Analyzing trace with hash 836759115, now seen corresponding path program 1 times [2018-06-26 20:47:43,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:43,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:43,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:43,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:43,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:43,370 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:43,465 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:47:43,465 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:43,465 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:43,466 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:43,466 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:43,466 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:43,466 INFO ]: Start difference. First operand 20 states and 2626 transitions. Second operand 3 states. [2018-06-26 20:47:45,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:45,721 INFO ]: Finished difference Result 23 states and 2678 transitions. [2018-06-26 20:47:45,722 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:45,722 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:47:45,722 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:45,725 INFO ]: With dead ends: 23 [2018-06-26 20:47:45,725 INFO ]: Without dead ends: 22 [2018-06-26 20:47:45,725 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:47:45,725 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 20:47:45,733 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-26 20:47:45,734 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 20:47:45,736 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2676 transitions. [2018-06-26 20:47:45,736 INFO ]: Start accepts. Automaton has 22 states and 2676 transitions. Word has length 10 [2018-06-26 20:47:45,736 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:45,736 INFO ]: Abstraction has 22 states and 2676 transitions. [2018-06-26 20:47:45,736 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:45,736 INFO ]: Start isEmpty. Operand 22 states and 2676 transitions. [2018-06-26 20:47:45,738 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:47:45,738 INFO ]: Found error trace [2018-06-26 20:47:45,738 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:45,738 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:45,738 INFO ]: Analyzing trace with hash 1139674003, now seen corresponding path program 1 times [2018-06-26 20:47:45,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:45,738 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:45,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:45,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:45,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:45,765 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:45,857 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:47:45,857 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:45,858 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:45,858 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:45,858 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:45,858 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:45,858 INFO ]: Start difference. First operand 22 states and 2676 transitions. Second operand 3 states. [2018-06-26 20:47:47,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:47,963 INFO ]: Finished difference Result 25 states and 3230 transitions. [2018-06-26 20:47:47,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:47,963 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:47:47,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:47,966 INFO ]: With dead ends: 25 [2018-06-26 20:47:47,966 INFO ]: Without dead ends: 25 [2018-06-26 20:47:47,966 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:47:47,966 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 20:47:47,972 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-06-26 20:47:47,972 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 20:47:47,975 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3228 transitions. [2018-06-26 20:47:47,975 INFO ]: Start accepts. Automaton has 24 states and 3228 transitions. Word has length 10 [2018-06-26 20:47:47,975 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:47,975 INFO ]: Abstraction has 24 states and 3228 transitions. [2018-06-26 20:47:47,975 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:47,975 INFO ]: Start isEmpty. Operand 24 states and 3228 transitions. [2018-06-26 20:47:47,977 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:47:47,977 INFO ]: Found error trace [2018-06-26 20:47:47,977 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:47,978 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:47,978 INFO ]: Analyzing trace with hash 1184782741, now seen corresponding path program 1 times [2018-06-26 20:47:47,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:47,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:47,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:47,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:47,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:48,013 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:48,106 INFO ]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 20:47:48,106 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:48,106 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:48,106 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:48,106 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:48,106 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:48,106 INFO ]: Start difference. First operand 24 states and 3228 transitions. Second operand 3 states. [2018-06-26 20:47:50,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:50,848 INFO ]: Finished difference Result 41 states and 5888 transitions. [2018-06-26 20:47:50,851 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:50,851 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:47:50,851 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:50,858 INFO ]: With dead ends: 41 [2018-06-26 20:47:50,858 INFO ]: Without dead ends: 41 [2018-06-26 20:47:50,858 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:47:50,858 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 20:47:50,894 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-06-26 20:47:50,894 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 20:47:50,899 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 5886 transitions. [2018-06-26 20:47:50,900 INFO ]: Start accepts. Automaton has 40 states and 5886 transitions. Word has length 11 [2018-06-26 20:47:50,900 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:50,900 INFO ]: Abstraction has 40 states and 5886 transitions. [2018-06-26 20:47:50,900 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:50,900 INFO ]: Start isEmpty. Operand 40 states and 5886 transitions. [2018-06-26 20:47:50,902 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:47:50,902 INFO ]: Found error trace [2018-06-26 20:47:50,902 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:50,902 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:50,902 INFO ]: Analyzing trace with hash 1249429211, now seen corresponding path program 1 times [2018-06-26 20:47:50,902 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:50,902 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:50,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:50,903 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:50,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:50,932 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:51,020 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:47:51,020 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:51,020 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:51,020 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:51,020 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:51,020 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:51,020 INFO ]: Start difference. First operand 40 states and 5886 transitions. Second operand 3 states. [2018-06-26 20:47:53,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:53,569 INFO ]: Finished difference Result 73 states and 9632 transitions. [2018-06-26 20:47:53,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:53,571 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:47:53,571 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:53,580 INFO ]: With dead ends: 73 [2018-06-26 20:47:53,580 INFO ]: Without dead ends: 73 [2018-06-26 20:47:53,580 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:47:53,580 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-26 20:47:53,605 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-06-26 20:47:53,605 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-26 20:47:53,610 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 9632 transitions. [2018-06-26 20:47:53,610 INFO ]: Start accepts. Automaton has 73 states and 9632 transitions. Word has length 11 [2018-06-26 20:47:53,610 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:53,610 INFO ]: Abstraction has 73 states and 9632 transitions. [2018-06-26 20:47:53,610 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:53,610 INFO ]: Start isEmpty. Operand 73 states and 9632 transitions. [2018-06-26 20:47:53,612 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:47:53,612 INFO ]: Found error trace [2018-06-26 20:47:53,612 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:53,612 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:53,613 INFO ]: Analyzing trace with hash 1423051159, now seen corresponding path program 1 times [2018-06-26 20:47:53,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:53,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:53,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:53,613 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:53,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:53,650 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:53,765 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:47:53,765 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:53,765 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:53,765 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:53,766 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:53,766 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:53,766 INFO ]: Start difference. First operand 73 states and 9632 transitions. Second operand 3 states. [2018-06-26 20:47:55,931 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:55,931 INFO ]: Finished difference Result 81 states and 10616 transitions. [2018-06-26 20:47:55,931 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:55,931 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:47:55,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:55,937 INFO ]: With dead ends: 81 [2018-06-26 20:47:55,937 INFO ]: Without dead ends: 81 [2018-06-26 20:47:55,938 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:47:55,938 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-26 20:47:55,954 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 47. [2018-06-26 20:47:55,954 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-26 20:47:55,958 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 6226 transitions. [2018-06-26 20:47:55,958 INFO ]: Start accepts. Automaton has 47 states and 6226 transitions. Word has length 11 [2018-06-26 20:47:55,958 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:55,958 INFO ]: Abstraction has 47 states and 6226 transitions. [2018-06-26 20:47:55,958 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:55,958 INFO ]: Start isEmpty. Operand 47 states and 6226 transitions. [2018-06-26 20:47:55,960 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:47:55,960 INFO ]: Found error trace [2018-06-26 20:47:55,960 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:55,960 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:55,960 INFO ]: Analyzing trace with hash -277688557, now seen corresponding path program 1 times [2018-06-26 20:47:55,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:55,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:55,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:55,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:55,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:55,986 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:56,076 INFO ]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 20:47:56,076 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:56,076 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:56,076 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:56,076 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:56,076 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:56,076 INFO ]: Start difference. First operand 47 states and 6226 transitions. Second operand 3 states. [2018-06-26 20:47:58,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:58,863 INFO ]: Finished difference Result 53 states and 7130 transitions. [2018-06-26 20:47:58,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:58,863 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:47:58,863 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:58,867 INFO ]: With dead ends: 53 [2018-06-26 20:47:58,867 INFO ]: Without dead ends: 53 [2018-06-26 20:47:58,867 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:47:58,867 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 20:47:58,889 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-06-26 20:47:58,889 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 20:47:58,901 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 7126 transitions. [2018-06-26 20:47:58,901 INFO ]: Start accepts. Automaton has 51 states and 7126 transitions. Word has length 11 [2018-06-26 20:47:58,901 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:58,901 INFO ]: Abstraction has 51 states and 7126 transitions. [2018-06-26 20:47:58,901 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:58,901 INFO ]: Start isEmpty. Operand 51 states and 7126 transitions. [2018-06-26 20:47:58,903 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:47:58,903 INFO ]: Found error trace [2018-06-26 20:47:58,903 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:58,903 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:58,903 INFO ]: Analyzing trace with hash -747760746, now seen corresponding path program 1 times [2018-06-26 20:47:58,903 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:58,903 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:58,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:58,904 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:58,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:58,926 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:59,010 INFO ]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 20:47:59,010 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:59,010 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:59,010 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:59,010 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:59,010 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:59,010 INFO ]: Start difference. First operand 51 states and 7126 transitions. Second operand 3 states. [2018-06-26 20:48:01,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:01,266 INFO ]: Finished difference Result 57 states and 8030 transitions. [2018-06-26 20:48:01,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:01,267 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:48:01,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:01,279 INFO ]: With dead ends: 57 [2018-06-26 20:48:01,279 INFO ]: Without dead ends: 57 [2018-06-26 20:48:01,279 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:48:01,280 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-26 20:48:01,298 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-06-26 20:48:01,298 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 20:48:01,301 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 7126 transitions. [2018-06-26 20:48:01,301 INFO ]: Start accepts. Automaton has 51 states and 7126 transitions. Word has length 11 [2018-06-26 20:48:01,301 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:01,301 INFO ]: Abstraction has 51 states and 7126 transitions. [2018-06-26 20:48:01,301 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:01,301 INFO ]: Start isEmpty. Operand 51 states and 7126 transitions. [2018-06-26 20:48:01,303 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:48:01,303 INFO ]: Found error trace [2018-06-26 20:48:01,303 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:01,304 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:01,304 INFO ]: Analyzing trace with hash -251829969, now seen corresponding path program 1 times [2018-06-26 20:48:01,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:01,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:01,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:01,304 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:01,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:01,335 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:01,436 INFO ]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 20:48:01,436 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:01,436 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:01,436 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:01,436 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:01,436 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:01,436 INFO ]: Start difference. First operand 51 states and 7126 transitions. Second operand 3 states. [2018-06-26 20:48:04,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:04,215 INFO ]: Finished difference Result 89 states and 12063 transitions. [2018-06-26 20:48:04,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:04,216 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:48:04,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:04,224 INFO ]: With dead ends: 89 [2018-06-26 20:48:04,224 INFO ]: Without dead ends: 89 [2018-06-26 20:48:04,224 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:48:04,224 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-26 20:48:04,250 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 53. [2018-06-26 20:48:04,250 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-26 20:48:04,254 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 7859 transitions. [2018-06-26 20:48:04,254 INFO ]: Start accepts. Automaton has 53 states and 7859 transitions. Word has length 11 [2018-06-26 20:48:04,254 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:04,254 INFO ]: Abstraction has 53 states and 7859 transitions. [2018-06-26 20:48:04,254 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:04,254 INFO ]: Start isEmpty. Operand 53 states and 7859 transitions. [2018-06-26 20:48:04,256 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:48:04,256 INFO ]: Found error trace [2018-06-26 20:48:04,256 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:04,256 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:04,256 INFO ]: Analyzing trace with hash -1228383645, now seen corresponding path program 1 times [2018-06-26 20:48:04,256 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:04,256 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:04,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:04,257 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:04,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:04,277 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:04,359 INFO ]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:48:04,359 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:04,359 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:04,359 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:04,359 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:04,359 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:04,359 INFO ]: Start difference. First operand 53 states and 7859 transitions. Second operand 3 states. [2018-06-26 20:48:06,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:06,621 INFO ]: Finished difference Result 93 states and 13355 transitions. [2018-06-26 20:48:06,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:06,621 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:48:06,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:06,626 INFO ]: With dead ends: 93 [2018-06-26 20:48:06,626 INFO ]: Without dead ends: 93 [2018-06-26 20:48:06,626 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:48:06,626 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-26 20:48:06,647 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-06-26 20:48:06,647 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-26 20:48:06,655 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 13351 transitions. [2018-06-26 20:48:06,655 INFO ]: Start accepts. Automaton has 91 states and 13351 transitions. Word has length 11 [2018-06-26 20:48:06,655 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:06,655 INFO ]: Abstraction has 91 states and 13351 transitions. [2018-06-26 20:48:06,655 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:06,655 INFO ]: Start isEmpty. Operand 91 states and 13351 transitions. [2018-06-26 20:48:06,659 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:48:06,659 INFO ]: Found error trace [2018-06-26 20:48:06,660 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:06,660 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:06,660 INFO ]: Analyzing trace with hash -1850378426, now seen corresponding path program 1 times [2018-06-26 20:48:06,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:06,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:06,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:06,660 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:06,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:06,690 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:06,796 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:48:06,797 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:06,797 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:06,797 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:06,797 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:06,797 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:06,797 INFO ]: Start difference. First operand 91 states and 13351 transitions. Second operand 3 states. [2018-06-26 20:48:09,000 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:09,001 INFO ]: Finished difference Result 133 states and 17998 transitions. [2018-06-26 20:48:09,001 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:09,001 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:48:09,001 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:09,009 INFO ]: With dead ends: 133 [2018-06-26 20:48:09,009 INFO ]: Without dead ends: 133 [2018-06-26 20:48:09,009 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:48:09,009 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-26 20:48:09,039 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-06-26 20:48:09,039 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-26 20:48:09,051 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 17998 transitions. [2018-06-26 20:48:09,051 INFO ]: Start accepts. Automaton has 133 states and 17998 transitions. Word has length 13 [2018-06-26 20:48:09,051 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:09,051 INFO ]: Abstraction has 133 states and 17998 transitions. [2018-06-26 20:48:09,051 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:09,051 INFO ]: Start isEmpty. Operand 133 states and 17998 transitions. [2018-06-26 20:48:09,057 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:48:09,057 INFO ]: Found error trace [2018-06-26 20:48:09,057 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:09,057 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:09,057 INFO ]: Analyzing trace with hash 7457016, now seen corresponding path program 1 times [2018-06-26 20:48:09,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:09,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:09,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:09,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:09,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:09,086 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:09,168 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:48:09,169 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:09,169 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:09,169 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:09,169 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:09,169 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:09,169 INFO ]: Start difference. First operand 133 states and 17998 transitions. Second operand 3 states. [2018-06-26 20:48:11,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:11,501 INFO ]: Finished difference Result 217 states and 24504 transitions. [2018-06-26 20:48:11,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:11,502 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:48:11,502 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:11,515 INFO ]: With dead ends: 217 [2018-06-26 20:48:11,515 INFO ]: Without dead ends: 217 [2018-06-26 20:48:11,515 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:11,515 INFO ]: Start minimizeSevpa. Operand 217 states. [2018-06-26 20:48:11,553 INFO ]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-06-26 20:48:11,553 INFO ]: Start removeUnreachable. Operand 217 states. [2018-06-26 20:48:11,569 INFO ]: Finished removeUnreachable. Reduced from 217 states to 217 states and 24504 transitions. [2018-06-26 20:48:11,569 INFO ]: Start accepts. Automaton has 217 states and 24504 transitions. Word has length 13 [2018-06-26 20:48:11,569 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:11,569 INFO ]: Abstraction has 217 states and 24504 transitions. [2018-06-26 20:48:11,569 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:11,569 INFO ]: Start isEmpty. Operand 217 states and 24504 transitions. [2018-06-26 20:48:11,576 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:48:11,576 INFO ]: Found error trace [2018-06-26 20:48:11,577 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:11,577 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:11,578 INFO ]: Analyzing trace with hash 909660574, now seen corresponding path program 1 times [2018-06-26 20:48:11,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:11,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:11,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:11,578 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:11,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:11,607 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:11,706 INFO ]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 20:48:11,706 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:11,706 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:11,706 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:11,706 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:11,706 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:11,706 INFO ]: Start difference. First operand 217 states and 24504 transitions. Second operand 3 states. [2018-06-26 20:48:13,995 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:13,996 INFO ]: Finished difference Result 259 states and 27151 transitions. [2018-06-26 20:48:13,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:13,997 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:48:13,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:14,008 INFO ]: With dead ends: 259 [2018-06-26 20:48:14,008 INFO ]: Without dead ends: 259 [2018-06-26 20:48:14,008 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:48:14,008 INFO ]: Start minimizeSevpa. Operand 259 states. [2018-06-26 20:48:14,037 INFO ]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-06-26 20:48:14,037 INFO ]: Start removeUnreachable. Operand 259 states. [2018-06-26 20:48:14,048 INFO ]: Finished removeUnreachable. Reduced from 259 states to 259 states and 27151 transitions. [2018-06-26 20:48:14,048 INFO ]: Start accepts. Automaton has 259 states and 27151 transitions. Word has length 13 [2018-06-26 20:48:14,048 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:14,048 INFO ]: Abstraction has 259 states and 27151 transitions. [2018-06-26 20:48:14,048 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:14,049 INFO ]: Start isEmpty. Operand 259 states and 27151 transitions. [2018-06-26 20:48:14,057 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:48:14,057 INFO ]: Found error trace [2018-06-26 20:48:14,057 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:14,057 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:14,057 INFO ]: Analyzing trace with hash 693526869, now seen corresponding path program 1 times [2018-06-26 20:48:14,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:14,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:14,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:14,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:14,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:14,087 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:14,169 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:48:14,169 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:14,169 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:14,169 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:14,169 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:14,169 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:14,169 INFO ]: Start difference. First operand 259 states and 27151 transitions. Second operand 3 states. [2018-06-26 20:48:16,270 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:16,270 INFO ]: Finished difference Result 284 states and 28220 transitions. [2018-06-26 20:48:16,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:16,270 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:48:16,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:16,279 INFO ]: With dead ends: 284 [2018-06-26 20:48:16,279 INFO ]: Without dead ends: 284 [2018-06-26 20:48:16,279 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:48:16,279 INFO ]: Start minimizeSevpa. Operand 284 states. [2018-06-26 20:48:16,306 INFO ]: Finished minimizeSevpa. Reduced states from 284 to 283. [2018-06-26 20:48:16,306 INFO ]: Start removeUnreachable. Operand 283 states. [2018-06-26 20:48:16,318 INFO ]: Finished removeUnreachable. Reduced from 283 states to 283 states and 28218 transitions. [2018-06-26 20:48:16,318 INFO ]: Start accepts. Automaton has 283 states and 28218 transitions. Word has length 13 [2018-06-26 20:48:16,318 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:16,318 INFO ]: Abstraction has 283 states and 28218 transitions. [2018-06-26 20:48:16,318 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:16,318 INFO ]: Start isEmpty. Operand 283 states and 28218 transitions. [2018-06-26 20:48:16,322 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:48:16,322 INFO ]: Found error trace [2018-06-26 20:48:16,322 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:16,322 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:16,322 INFO ]: Analyzing trace with hash -141782794, now seen corresponding path program 1 times [2018-06-26 20:48:16,322 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:16,322 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:16,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:16,322 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:16,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:16,346 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:16,445 INFO ]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 20:48:16,445 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:16,445 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:16,445 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:16,445 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:16,445 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:16,445 INFO ]: Start difference. First operand 283 states and 28218 transitions. Second operand 3 states. [2018-06-26 20:48:19,046 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:19,046 INFO ]: Finished difference Result 559 states and 53294 transitions. [2018-06-26 20:48:19,049 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:19,049 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:48:19,049 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:19,067 INFO ]: With dead ends: 559 [2018-06-26 20:48:19,067 INFO ]: Without dead ends: 559 [2018-06-26 20:48:19,068 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:48:19,068 INFO ]: Start minimizeSevpa. Operand 559 states. [2018-06-26 20:48:19,133 INFO ]: Finished minimizeSevpa. Reduced states from 559 to 559. [2018-06-26 20:48:19,134 INFO ]: Start removeUnreachable. Operand 559 states. [2018-06-26 20:48:19,157 INFO ]: Finished removeUnreachable. Reduced from 559 states to 559 states and 53294 transitions. [2018-06-26 20:48:19,157 INFO ]: Start accepts. Automaton has 559 states and 53294 transitions. Word has length 13 [2018-06-26 20:48:19,157 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:19,157 INFO ]: Abstraction has 559 states and 53294 transitions. [2018-06-26 20:48:19,157 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:19,157 INFO ]: Start isEmpty. Operand 559 states and 53294 transitions. [2018-06-26 20:48:19,164 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 20:48:19,164 INFO ]: Found error trace [2018-06-26 20:48:19,165 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:19,165 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:19,165 INFO ]: Analyzing trace with hash 1824744534, now seen corresponding path program 1 times [2018-06-26 20:48:19,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:19,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:19,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:19,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:19,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:19,192 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:19,283 INFO ]: Checked inductivity of 55 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-26 20:48:19,283 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:19,283 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:19,283 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:19,283 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:19,283 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:19,283 INFO ]: Start difference. First operand 559 states and 53294 transitions. Second operand 3 states. Received shutdown request... [2018-06-26 20:48:19,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:19,760 WARN ]: Verification canceled [2018-06-26 20:48:19,763 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:48:19,763 WARN ]: Timeout [2018-06-26 20:48:19,764 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:48:19 BasicIcfg [2018-06-26 20:48:19,764 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:48:19,764 INFO ]: Toolchain (without parser) took 68275.57 ms. Allocated memory was 308.8 MB in the beginning and 1.2 GB in the end (delta: 913.8 MB). Free memory was 243.3 MB in the beginning and 536.0 MB in the end (delta: -292.6 MB). Peak memory consumption was 621.2 MB. Max. memory is 3.6 GB. [2018-06-26 20:48:19,765 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:48:19,769 INFO ]: ChcToBoogie took 67.51 ms. Allocated memory is still 308.8 MB. Free memory was 242.3 MB in the beginning and 239.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:48:19,769 INFO ]: Boogie Preprocessor took 95.45 ms. Allocated memory is still 308.8 MB. Free memory was 239.3 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:48:19,769 INFO ]: RCFGBuilder took 435.61 ms. Allocated memory is still 308.8 MB. Free memory was 237.3 MB in the beginning and 205.3 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:48:19,770 INFO ]: BlockEncodingV2 took 2074.15 ms. Allocated memory was 308.8 MB in the beginning and 392.7 MB in the end (delta: 83.9 MB). Free memory was 205.3 MB in the beginning and 222.4 MB in the end (delta: -17.1 MB). Peak memory consumption was 126.2 MB. Max. memory is 3.6 GB. [2018-06-26 20:48:19,770 INFO ]: TraceAbstraction took 65591.77 ms. Allocated memory was 392.7 MB in the beginning and 1.2 GB in the end (delta: 829.9 MB). Free memory was 222.4 MB in the beginning and 536.0 MB in the end (delta: -313.6 MB). Peak memory consumption was 516.4 MB. Max. memory is 3.6 GB. [2018-06-26 20:48:19,778 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, 884 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.51 ms. Allocated memory is still 308.8 MB. Free memory was 242.3 MB in the beginning and 239.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 95.45 ms. Allocated memory is still 308.8 MB. Free memory was 239.3 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 435.61 ms. Allocated memory is still 308.8 MB. Free memory was 237.3 MB in the beginning and 205.3 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2074.15 ms. Allocated memory was 308.8 MB in the beginning and 392.7 MB in the end (delta: 83.9 MB). Free memory was 205.3 MB in the beginning and 222.4 MB in the end (delta: -17.1 MB). Peak memory consumption was 126.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 65591.77 ms. Allocated memory was 392.7 MB in the beginning and 1.2 GB in the end (delta: 829.9 MB). Free memory was 222.4 MB in the beginning and 536.0 MB in the end (delta: -313.6 MB). Peak memory consumption was 516.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (559states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (22 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 65.5s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 61.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 0 SDslu, 94 SDs, 0 SdLazy, 20365 SolverSat, 15645 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=559occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 91 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 2965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 490/490 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/s3_srvr_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-48-19-790.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-48-19-790.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-48-19-790.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-48-19-790.csv Completed graceful shutdown