java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 23:52:50,733 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 23:52:50,735 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 23:52:50,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 23:52:50,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 23:52:50,753 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 23:52:50,754 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 23:52:50,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 23:52:50,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 23:52:50,759 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 23:52:50,759 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 23:52:50,760 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 23:52:50,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 23:52:50,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 23:52:50,765 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 23:52:50,765 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 23:52:50,767 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 23:52:50,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 23:52:50,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 23:52:50,778 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 23:52:50,779 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 23:52:50,784 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 23:52:50,784 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 23:52:50,784 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 23:52:50,785 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 23:52:50,786 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 23:52:50,786 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 23:52:50,788 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 23:52:50,789 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 23:52:50,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 23:52:50,790 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 23:52:50,791 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 23:52:50,791 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 23:52:50,791 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 23:52:50,796 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 23:52:50,796 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 23:52:50,819 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 23:52:50,819 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 23:52:50,819 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 23:52:50,819 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 23:52:50,820 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 23:52:50,820 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 23:52:50,821 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 23:52:50,821 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 23:52:50,821 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 23:52:50,821 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 23:52:50,821 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 23:52:50,822 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 23:52:50,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:52:50,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 23:52:50,822 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 23:52:50,822 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 23:52:50,822 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 23:52:50,823 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 23:52:50,823 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 23:52:50,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 23:52:50,823 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 23:52:50,824 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 23:52:50,825 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 23:52:50,869 INFO ]: Repository-Root is: /tmp [2018-06-24 23:52:50,882 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 23:52:50,885 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 23:52:50,890 INFO ]: Initializing SmtParser... [2018-06-24 23:52:50,890 INFO ]: SmtParser initialized [2018-06-24 23:52:50,891 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.2.smt2 [2018-06-24 23:52:50,892 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 23:52:50,981 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.2.smt2 unknown [2018-06-24 23:52:51,934 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.2.smt2 [2018-06-24 23:52:51,940 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 23:52:51,951 INFO ]: Walking toolchain with 5 elements. [2018-06-24 23:52:51,952 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 23:52:51,952 INFO ]: Initializing ChcToBoogie... [2018-06-24 23:52:51,952 INFO ]: ChcToBoogie initialized [2018-06-24 23:52:51,955 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:52:51" (1/1) ... [2018-06-24 23:52:52,059 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:52 Unit [2018-06-24 23:52:52,060 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 23:52:52,060 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 23:52:52,060 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 23:52:52,060 INFO ]: Boogie Preprocessor initialized [2018-06-24 23:52:52,081 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:52" (1/1) ... [2018-06-24 23:52:52,081 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:52" (1/1) ... [2018-06-24 23:52:52,097 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:52" (1/1) ... [2018-06-24 23:52:52,097 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:52" (1/1) ... [2018-06-24 23:52:52,130 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:52" (1/1) ... [2018-06-24 23:52:52,132 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:52" (1/1) ... [2018-06-24 23:52:52,145 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:52" (1/1) ... [2018-06-24 23:52:52,152 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 23:52:52,152 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 23:52:52,152 INFO ]: Initializing RCFGBuilder... [2018-06-24 23:52:52,152 INFO ]: RCFGBuilder initialized [2018-06-24 23:52:52,153 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:52" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 23:52:52,168 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 23:52:52,168 INFO ]: Found specification of procedure gotoProc [2018-06-24 23:52:52,168 INFO ]: Found implementation of procedure gotoProc [2018-06-24 23:52:52,168 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 23:52:52,168 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 23:52:52,168 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:52:52,783 INFO ]: Using library mode [2018-06-24 23:52:52,785 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:52:52 BoogieIcfgContainer [2018-06-24 23:52:52,785 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 23:52:52,786 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 23:52:52,786 INFO ]: Initializing BlockEncodingV2... [2018-06-24 23:52:52,786 INFO ]: BlockEncodingV2 initialized [2018-06-24 23:52:52,787 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:52:52" (1/1) ... [2018-06-24 23:52:52,806 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-24 23:52:52,808 INFO ]: Using Remove infeasible edges [2018-06-24 23:52:52,808 INFO ]: Using Maximize final states [2018-06-24 23:52:52,809 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 23:52:52,809 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 23:52:52,811 INFO ]: Using Remove sink states [2018-06-24 23:52:52,814 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 23:52:52,814 INFO ]: Using Use SBE [2018-06-24 23:52:52,873 WARN ]: expecting exponential blowup for input size 6 [2018-06-24 23:52:56,552 INFO ]: SBE split 1 edges [2018-06-24 23:52:56,562 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 23:52:56,565 INFO ]: 0 new accepting states [2018-06-24 23:52:56,620 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 23:52:56,622 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:52:56,632 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 23:52:56,632 INFO ]: 0 new accepting states [2018-06-24 23:52:56,633 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 23:52:56,633 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:52:56,638 INFO ]: Encoded RCFG 6 locations, 99 edges [2018-06-24 23:52:56,639 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:52:56 BasicIcfg [2018-06-24 23:52:56,639 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 23:52:56,640 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 23:52:56,640 INFO ]: Initializing TraceAbstraction... [2018-06-24 23:52:56,643 INFO ]: TraceAbstraction initialized [2018-06-24 23:52:56,644 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:52:51" (1/4) ... [2018-06-24 23:52:56,646 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697a6860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 11:52:56, skipping insertion in model container [2018-06-24 23:52:56,646 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:52" (2/4) ... [2018-06-24 23:52:56,646 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697a6860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 11:52:56, skipping insertion in model container [2018-06-24 23:52:56,646 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:52:52" (3/4) ... [2018-06-24 23:52:56,646 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697a6860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:52:56, skipping insertion in model container [2018-06-24 23:52:56,646 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:52:56" (4/4) ... [2018-06-24 23:52:56,648 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 23:52:56,657 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 23:52:56,666 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 23:52:56,720 INFO ]: Using default assertion order modulation [2018-06-24 23:52:56,720 INFO ]: Interprodecural is true [2018-06-24 23:52:56,720 INFO ]: Hoare is false [2018-06-24 23:52:56,720 INFO ]: Compute interpolants for FPandBP [2018-06-24 23:52:56,720 INFO ]: Backedges is TWOTRACK [2018-06-24 23:52:56,720 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 23:52:56,720 INFO ]: Difference is false [2018-06-24 23:52:56,720 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 23:52:56,720 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 23:52:56,733 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 23:52:56,748 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 23:52:56,749 INFO ]: Found error trace [2018-06-24 23:52:56,749 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 23:52:56,750 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:56,755 INFO ]: Analyzing trace with hash 38293250, now seen corresponding path program 1 times [2018-06-24 23:52:56,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:56,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:56,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:56,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:56,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:56,929 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:57,061 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:52:57,065 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:57,065 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:57,067 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:57,083 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:57,083 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:57,086 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 23:52:58,765 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:58,766 INFO ]: Finished difference Result 7 states and 142 transitions. [2018-06-24 23:52:58,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:58,768 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 23:52:58,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:58,786 INFO ]: With dead ends: 7 [2018-06-24 23:52:58,786 INFO ]: Without dead ends: 7 [2018-06-24 23:52:58,788 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:58,805 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 23:52:58,823 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 23:52:58,824 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 23:52:58,825 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2018-06-24 23:52:58,826 INFO ]: Start accepts. Automaton has 7 states and 142 transitions. Word has length 5 [2018-06-24 23:52:58,827 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:58,827 INFO ]: Abstraction has 7 states and 142 transitions. [2018-06-24 23:52:58,827 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:58,827 INFO ]: Start isEmpty. Operand 7 states and 142 transitions. [2018-06-24 23:52:58,827 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:52:58,827 INFO ]: Found error trace [2018-06-24 23:52:58,827 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:52:58,827 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:58,828 INFO ]: Analyzing trace with hash 1186051107, now seen corresponding path program 1 times [2018-06-24 23:52:58,828 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:58,828 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:58,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:58,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:58,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:58,873 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:58,970 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:52:58,970 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:58,970 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:58,971 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:58,972 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:58,972 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:58,972 INFO ]: Start difference. First operand 7 states and 142 transitions. Second operand 3 states. [2018-06-24 23:52:59,854 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:59,854 INFO ]: Finished difference Result 9 states and 199 transitions. [2018-06-24 23:52:59,855 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:59,855 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:52:59,855 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:59,856 INFO ]: With dead ends: 9 [2018-06-24 23:52:59,856 INFO ]: Without dead ends: 9 [2018-06-24 23:52:59,857 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:59,857 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 23:52:59,864 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 23:52:59,865 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 23:52:59,865 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2018-06-24 23:52:59,866 INFO ]: Start accepts. Automaton has 9 states and 199 transitions. Word has length 6 [2018-06-24 23:52:59,866 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:59,866 INFO ]: Abstraction has 9 states and 199 transitions. [2018-06-24 23:52:59,866 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:59,866 INFO ]: Start isEmpty. Operand 9 states and 199 transitions. [2018-06-24 23:52:59,866 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:52:59,866 INFO ]: Found error trace [2018-06-24 23:52:59,866 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:52:59,866 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:59,867 INFO ]: Analyzing trace with hash 1186200062, now seen corresponding path program 1 times [2018-06-24 23:52:59,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:59,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:59,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:59,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:59,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:59,904 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:59,983 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:52:59,983 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:59,983 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:59,984 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:59,984 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:59,984 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:59,984 INFO ]: Start difference. First operand 9 states and 199 transitions. Second operand 3 states. [2018-06-24 23:53:00,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:00,607 INFO ]: Finished difference Result 13 states and 304 transitions. [2018-06-24 23:53:00,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:00,607 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:53:00,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:00,609 INFO ]: With dead ends: 13 [2018-06-24 23:53:00,609 INFO ]: Without dead ends: 13 [2018-06-24 23:53:00,609 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:00,609 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 23:53:00,613 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 23:53:00,613 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 23:53:00,615 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 304 transitions. [2018-06-24 23:53:00,615 INFO ]: Start accepts. Automaton has 13 states and 304 transitions. Word has length 6 [2018-06-24 23:53:00,615 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:00,615 INFO ]: Abstraction has 13 states and 304 transitions. [2018-06-24 23:53:00,615 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:00,615 INFO ]: Start isEmpty. Operand 13 states and 304 transitions. [2018-06-24 23:53:00,617 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:53:00,617 INFO ]: Found error trace [2018-06-24 23:53:00,617 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:53:00,617 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:00,617 INFO ]: Analyzing trace with hash 1186378808, now seen corresponding path program 1 times [2018-06-24 23:53:00,617 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:00,617 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:00,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:00,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:00,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:00,645 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:00,723 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:53:00,723 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:00,724 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:00,724 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:00,724 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:00,724 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:00,724 INFO ]: Start difference. First operand 13 states and 304 transitions. Second operand 3 states. [2018-06-24 23:53:01,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:01,273 INFO ]: Finished difference Result 21 states and 397 transitions. [2018-06-24 23:53:01,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:01,273 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:53:01,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:01,274 INFO ]: With dead ends: 21 [2018-06-24 23:53:01,274 INFO ]: Without dead ends: 21 [2018-06-24 23:53:01,275 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:01,275 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 23:53:01,281 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 23:53:01,281 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 23:53:01,282 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 397 transitions. [2018-06-24 23:53:01,282 INFO ]: Start accepts. Automaton has 21 states and 397 transitions. Word has length 6 [2018-06-24 23:53:01,282 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:01,282 INFO ]: Abstraction has 21 states and 397 transitions. [2018-06-24 23:53:01,282 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:01,282 INFO ]: Start isEmpty. Operand 21 states and 397 transitions. [2018-06-24 23:53:01,283 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 23:53:01,283 INFO ]: Found error trace [2018-06-24 23:53:01,283 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:01,283 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:01,283 INFO ]: Analyzing trace with hash -1939729211, now seen corresponding path program 1 times [2018-06-24 23:53:01,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:01,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:01,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:01,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:01,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:01,338 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:01,424 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:53:01,424 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:01,424 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:01,424 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:01,424 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:01,424 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:01,424 INFO ]: Start difference. First operand 21 states and 397 transitions. Second operand 3 states. [2018-06-24 23:53:02,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:02,049 INFO ]: Finished difference Result 31 states and 567 transitions. [2018-06-24 23:53:02,049 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:02,049 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 23:53:02,049 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:02,051 INFO ]: With dead ends: 31 [2018-06-24 23:53:02,051 INFO ]: Without dead ends: 31 [2018-06-24 23:53:02,051 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:02,051 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:53:02,057 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:53:02,057 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:53:02,059 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 567 transitions. [2018-06-24 23:53:02,059 INFO ]: Start accepts. Automaton has 31 states and 567 transitions. Word has length 7 [2018-06-24 23:53:02,059 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:02,059 INFO ]: Abstraction has 31 states and 567 transitions. [2018-06-24 23:53:02,059 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:02,059 INFO ]: Start isEmpty. Operand 31 states and 567 transitions. [2018-06-24 23:53:02,060 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 23:53:02,060 INFO ]: Found error trace [2018-06-24 23:53:02,060 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:02,060 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:02,060 INFO ]: Analyzing trace with hash 1022154225, now seen corresponding path program 1 times [2018-06-24 23:53:02,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:02,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:02,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:02,061 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:02,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:02,094 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:02,171 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 23:53:02,171 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:02,171 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:02,171 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:02,171 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:02,171 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:02,171 INFO ]: Start difference. First operand 31 states and 567 transitions. Second operand 3 states. [2018-06-24 23:53:02,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:02,656 INFO ]: Finished difference Result 31 states and 447 transitions. [2018-06-24 23:53:02,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:02,656 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 23:53:02,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:02,657 INFO ]: With dead ends: 31 [2018-06-24 23:53:02,657 INFO ]: Without dead ends: 31 [2018-06-24 23:53:02,657 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:02,657 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:53:02,662 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:53:02,662 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:53:02,663 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 447 transitions. [2018-06-24 23:53:02,663 INFO ]: Start accepts. Automaton has 31 states and 447 transitions. Word has length 8 [2018-06-24 23:53:02,664 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:02,664 INFO ]: Abstraction has 31 states and 447 transitions. [2018-06-24 23:53:02,664 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:02,664 INFO ]: Start isEmpty. Operand 31 states and 447 transitions. [2018-06-24 23:53:02,664 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 23:53:02,664 INFO ]: Found error trace [2018-06-24 23:53:02,664 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:02,664 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:02,664 INFO ]: Analyzing trace with hash 2081432812, now seen corresponding path program 1 times [2018-06-24 23:53:02,664 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:02,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:02,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:02,665 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:02,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:02,691 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:02,761 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 23:53:02,761 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:02,761 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:02,761 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:02,761 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:02,761 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:02,762 INFO ]: Start difference. First operand 31 states and 447 transitions. Second operand 3 states. [2018-06-24 23:53:03,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:03,277 INFO ]: Finished difference Result 31 states and 318 transitions. [2018-06-24 23:53:03,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:03,278 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 23:53:03,278 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:03,279 INFO ]: With dead ends: 31 [2018-06-24 23:53:03,279 INFO ]: Without dead ends: 31 [2018-06-24 23:53:03,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-24 23:53:03,279 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:53:03,284 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:53:03,284 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:53:03,285 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 318 transitions. [2018-06-24 23:53:03,285 INFO ]: Start accepts. Automaton has 31 states and 318 transitions. Word has length 8 [2018-06-24 23:53:03,285 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:03,285 INFO ]: Abstraction has 31 states and 318 transitions. [2018-06-24 23:53:03,285 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:03,285 INFO ]: Start isEmpty. Operand 31 states and 318 transitions. [2018-06-24 23:53:03,286 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 23:53:03,286 INFO ]: Found error trace [2018-06-24 23:53:03,286 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:03,286 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:03,286 INFO ]: Analyzing trace with hash -792243825, now seen corresponding path program 1 times [2018-06-24 23:53:03,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:03,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:03,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:03,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:03,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:03,318 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:03,404 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 23:53:03,404 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:03,404 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:03,404 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:03,404 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:03,404 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:03,404 INFO ]: Start difference. First operand 31 states and 318 transitions. Second operand 3 states. [2018-06-24 23:53:04,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:04,207 INFO ]: Finished difference Result 31 states and 202 transitions. [2018-06-24 23:53:04,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:04,207 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 23:53:04,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:04,208 INFO ]: With dead ends: 31 [2018-06-24 23:53:04,208 INFO ]: Without dead ends: 31 [2018-06-24 23:53:04,209 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:04,209 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:53:04,212 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:53:04,212 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:53:04,214 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 202 transitions. [2018-06-24 23:53:04,214 INFO ]: Start accepts. Automaton has 31 states and 202 transitions. Word has length 9 [2018-06-24 23:53:04,214 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:04,214 INFO ]: Abstraction has 31 states and 202 transitions. [2018-06-24 23:53:04,214 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:04,214 INFO ]: Start isEmpty. Operand 31 states and 202 transitions. [2018-06-24 23:53:04,215 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 23:53:04,215 INFO ]: Found error trace [2018-06-24 23:53:04,215 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:04,215 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:04,215 INFO ]: Analyzing trace with hash 1412200802, now seen corresponding path program 1 times [2018-06-24 23:53:04,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:04,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:04,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:04,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:04,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:04,249 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:04,332 INFO ]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 23:53:04,333 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:04,333 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:04,333 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:04,333 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:04,333 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:04,333 INFO ]: Start difference. First operand 31 states and 202 transitions. Second operand 3 states. [2018-06-24 23:53:04,708 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:04,708 INFO ]: Finished difference Result 31 states and 142 transitions. [2018-06-24 23:53:04,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:04,708 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 23:53:04,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:04,709 INFO ]: With dead ends: 31 [2018-06-24 23:53:04,709 INFO ]: Without dead ends: 31 [2018-06-24 23:53:04,709 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:04,709 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:53:04,714 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:53:04,714 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:53:04,715 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 142 transitions. [2018-06-24 23:53:04,715 INFO ]: Start accepts. Automaton has 31 states and 142 transitions. Word has length 9 [2018-06-24 23:53:04,715 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:04,715 INFO ]: Abstraction has 31 states and 142 transitions. [2018-06-24 23:53:04,715 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:04,715 INFO ]: Start isEmpty. Operand 31 states and 142 transitions. [2018-06-24 23:53:04,715 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 23:53:04,715 INFO ]: Found error trace [2018-06-24 23:53:04,716 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:04,716 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:04,716 INFO ]: Analyzing trace with hash -671186115, now seen corresponding path program 1 times [2018-06-24 23:53:04,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:04,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:04,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:04,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:04,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:04,741 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:04,819 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 23:53:04,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:04,820 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:04,820 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:04,820 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:04,820 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:04,820 INFO ]: Start difference. First operand 31 states and 142 transitions. Second operand 3 states. [2018-06-24 23:53:05,945 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:05,945 INFO ]: Finished difference Result 31 states and 99 transitions. [2018-06-24 23:53:05,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:05,945 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 23:53:05,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:05,946 INFO ]: With dead ends: 31 [2018-06-24 23:53:05,946 INFO ]: Without dead ends: 31 [2018-06-24 23:53:05,946 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:05,946 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:53:05,949 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:53:05,949 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:53:05,949 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2018-06-24 23:53:05,950 INFO ]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 9 [2018-06-24 23:53:05,950 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:05,950 INFO ]: Abstraction has 31 states and 99 transitions. [2018-06-24 23:53:05,950 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:05,952 INFO ]: Start isEmpty. Operand 31 states and 99 transitions. [2018-06-24 23:53:05,952 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 23:53:05,952 INFO ]: Found error trace [2018-06-24 23:53:05,952 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:05,952 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:05,952 INFO ]: Analyzing trace with hash 1980359985, now seen corresponding path program 1 times [2018-06-24 23:53:05,952 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:05,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:05,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:05,953 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:05,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:05,993 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:06,103 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 23:53:06,103 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:06,103 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:06,103 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:06,103 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:06,103 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:06,103 INFO ]: Start difference. First operand 31 states and 99 transitions. Second operand 3 states. [2018-06-24 23:53:06,808 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:06,808 INFO ]: Finished difference Result 50 states and 169 transitions. [2018-06-24 23:53:06,808 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:06,809 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 23:53:06,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:06,809 INFO ]: With dead ends: 50 [2018-06-24 23:53:06,809 INFO ]: Without dead ends: 49 [2018-06-24 23:53:06,810 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-24 23:53:06,810 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 23:53:06,813 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-24 23:53:06,813 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 23:53:06,814 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 168 transitions. [2018-06-24 23:53:06,814 INFO ]: Start accepts. Automaton has 49 states and 168 transitions. Word has length 10 [2018-06-24 23:53:06,814 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:06,814 INFO ]: Abstraction has 49 states and 168 transitions. [2018-06-24 23:53:06,814 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:06,814 INFO ]: Start isEmpty. Operand 49 states and 168 transitions. [2018-06-24 23:53:06,815 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 23:53:06,815 INFO ]: Found error trace [2018-06-24 23:53:06,815 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:06,815 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:06,815 INFO ]: Analyzing trace with hash -934559424, now seen corresponding path program 1 times [2018-06-24 23:53:06,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:06,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:06,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:06,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:06,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:06,857 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:06,966 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 23:53:06,966 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:06,966 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:06,966 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:06,966 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:06,966 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:06,966 INFO ]: Start difference. First operand 49 states and 168 transitions. Second operand 3 states. [2018-06-24 23:53:07,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:07,506 INFO ]: Finished difference Result 86 states and 266 transitions. [2018-06-24 23:53:07,521 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:07,521 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 23:53:07,521 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:07,522 INFO ]: With dead ends: 86 [2018-06-24 23:53:07,522 INFO ]: Without dead ends: 85 [2018-06-24 23:53:07,522 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-24 23:53:07,522 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-24 23:53:07,527 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-06-24 23:53:07,527 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-24 23:53:07,529 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 265 transitions. [2018-06-24 23:53:07,529 INFO ]: Start accepts. Automaton has 85 states and 265 transitions. Word has length 11 [2018-06-24 23:53:07,529 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:07,529 INFO ]: Abstraction has 85 states and 265 transitions. [2018-06-24 23:53:07,529 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:07,529 INFO ]: Start isEmpty. Operand 85 states and 265 transitions. [2018-06-24 23:53:07,530 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 23:53:07,530 INFO ]: Found error trace [2018-06-24 23:53:07,530 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:07,530 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:07,530 INFO ]: Analyzing trace with hash 1086997114, now seen corresponding path program 1 times [2018-06-24 23:53:07,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:07,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:07,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:07,531 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:07,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:07,574 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:07,678 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 23:53:07,678 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:07,678 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:07,679 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:07,679 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:07,679 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:07,679 INFO ]: Start difference. First operand 85 states and 265 transitions. Second operand 3 states. [2018-06-24 23:53:08,169 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:08,169 INFO ]: Finished difference Result 146 states and 434 transitions. [2018-06-24 23:53:08,170 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:08,170 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 23:53:08,170 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:08,171 INFO ]: With dead ends: 146 [2018-06-24 23:53:08,171 INFO ]: Without dead ends: 145 [2018-06-24 23:53:08,171 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:08,172 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-24 23:53:08,184 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-06-24 23:53:08,184 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-24 23:53:08,186 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 433 transitions. [2018-06-24 23:53:08,186 INFO ]: Start accepts. Automaton has 145 states and 433 transitions. Word has length 12 [2018-06-24 23:53:08,186 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:08,186 INFO ]: Abstraction has 145 states and 433 transitions. [2018-06-24 23:53:08,186 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:08,186 INFO ]: Start isEmpty. Operand 145 states and 433 transitions. [2018-06-24 23:53:08,188 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 23:53:08,188 INFO ]: Found error trace [2018-06-24 23:53:08,188 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:08,188 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:08,188 INFO ]: Analyzing trace with hash 1783350196, now seen corresponding path program 1 times [2018-06-24 23:53:08,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:08,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:08,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:08,188 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:08,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:08,230 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:08,338 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 23:53:08,339 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:08,339 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:08,339 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:08,339 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:08,339 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:08,339 INFO ]: Start difference. First operand 145 states and 433 transitions. Second operand 3 states. [2018-06-24 23:53:08,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:08,989 INFO ]: Finished difference Result 201 states and 597 transitions. [2018-06-24 23:53:08,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:08,990 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-24 23:53:08,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:08,992 INFO ]: With dead ends: 201 [2018-06-24 23:53:08,992 INFO ]: Without dead ends: 201 [2018-06-24 23:53:08,992 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-24 23:53:08,992 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-24 23:53:09,010 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-06-24 23:53:09,010 INFO ]: Start removeUnreachable. Operand 201 states. [2018-06-24 23:53:09,016 INFO ]: Finished removeUnreachable. Reduced from 201 states to 201 states and 597 transitions. [2018-06-24 23:53:09,016 INFO ]: Start accepts. Automaton has 201 states and 597 transitions. Word has length 13 [2018-06-24 23:53:09,016 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:09,017 INFO ]: Abstraction has 201 states and 597 transitions. [2018-06-24 23:53:09,017 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:09,017 INFO ]: Start isEmpty. Operand 201 states and 597 transitions. [2018-06-24 23:53:09,019 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 23:53:09,019 INFO ]: Found error trace [2018-06-24 23:53:09,019 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:09,019 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:09,019 INFO ]: Analyzing trace with hash 1602929742, now seen corresponding path program 1 times [2018-06-24 23:53:09,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:09,019 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:09,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:09,020 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:09,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:09,064 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:09,174 INFO ]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 23:53:09,174 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:09,174 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:09,175 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:09,175 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:09,175 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:09,175 INFO ]: Start difference. First operand 201 states and 597 transitions. Second operand 3 states. [2018-06-24 23:53:09,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:09,497 INFO ]: Finished difference Result 202 states and 594 transitions. [2018-06-24 23:53:09,497 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:09,497 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-24 23:53:09,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:09,498 INFO ]: With dead ends: 202 [2018-06-24 23:53:09,498 INFO ]: Without dead ends: 202 [2018-06-24 23:53:09,498 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:09,498 INFO ]: Start minimizeSevpa. Operand 202 states. [2018-06-24 23:53:09,510 INFO ]: Finished minimizeSevpa. Reduced states from 202 to 198. [2018-06-24 23:53:09,510 INFO ]: Start removeUnreachable. Operand 198 states. [2018-06-24 23:53:09,519 INFO ]: Finished removeUnreachable. Reduced from 198 states to 198 states and 578 transitions. [2018-06-24 23:53:09,519 INFO ]: Start accepts. Automaton has 198 states and 578 transitions. Word has length 14 [2018-06-24 23:53:09,519 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:09,519 INFO ]: Abstraction has 198 states and 578 transitions. [2018-06-24 23:53:09,519 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:09,519 INFO ]: Start isEmpty. Operand 198 states and 578 transitions. [2018-06-24 23:53:09,521 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:53:09,521 INFO ]: Found error trace [2018-06-24 23:53:09,521 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:09,521 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:09,521 INFO ]: Analyzing trace with hash -1430781556, now seen corresponding path program 1 times [2018-06-24 23:53:09,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:09,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:09,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:09,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:09,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:09,575 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:09,724 INFO ]: Checked inductivity of 78 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 23:53:09,724 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:09,724 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:09,724 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:09,724 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:09,724 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:09,724 INFO ]: Start difference. First operand 198 states and 578 transitions. Second operand 3 states. [2018-06-24 23:53:11,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:11,359 INFO ]: Finished difference Result 298 states and 766 transitions. [2018-06-24 23:53:11,360 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:11,360 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 23:53:11,360 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:11,362 INFO ]: With dead ends: 298 [2018-06-24 23:53:11,362 INFO ]: Without dead ends: 298 [2018-06-24 23:53:11,362 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:11,362 INFO ]: Start minimizeSevpa. Operand 298 states. [2018-06-24 23:53:11,372 INFO ]: Finished minimizeSevpa. Reduced states from 298 to 275. [2018-06-24 23:53:11,372 INFO ]: Start removeUnreachable. Operand 275 states. [2018-06-24 23:53:11,374 INFO ]: Finished removeUnreachable. Reduced from 275 states to 275 states and 724 transitions. [2018-06-24 23:53:11,374 INFO ]: Start accepts. Automaton has 275 states and 724 transitions. Word has length 17 [2018-06-24 23:53:11,374 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:11,374 INFO ]: Abstraction has 275 states and 724 transitions. [2018-06-24 23:53:11,374 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:11,374 INFO ]: Start isEmpty. Operand 275 states and 724 transitions. [2018-06-24 23:53:11,378 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:53:11,378 INFO ]: Found error trace [2018-06-24 23:53:11,378 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:11,378 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:11,378 INFO ]: Analyzing trace with hash 72208220, now seen corresponding path program 1 times [2018-06-24 23:53:11,378 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:11,378 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:11,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:11,379 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:11,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:11,421 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:11,542 INFO ]: Checked inductivity of 78 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 23:53:11,542 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:11,542 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:11,543 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:11,543 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:11,543 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:11,543 INFO ]: Start difference. First operand 275 states and 724 transitions. Second operand 3 states. [2018-06-24 23:53:12,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:12,207 INFO ]: Finished difference Result 419 states and 1117 transitions. [2018-06-24 23:53:12,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:12,208 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 23:53:12,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:12,210 INFO ]: With dead ends: 419 [2018-06-24 23:53:12,210 INFO ]: Without dead ends: 419 [2018-06-24 23:53:12,211 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:12,211 INFO ]: Start minimizeSevpa. Operand 419 states. [2018-06-24 23:53:12,224 INFO ]: Finished minimizeSevpa. Reduced states from 419 to 418. [2018-06-24 23:53:12,224 INFO ]: Start removeUnreachable. Operand 418 states. [2018-06-24 23:53:12,227 INFO ]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1115 transitions. [2018-06-24 23:53:12,227 INFO ]: Start accepts. Automaton has 418 states and 1115 transitions. Word has length 17 [2018-06-24 23:53:12,227 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:12,227 INFO ]: Abstraction has 418 states and 1115 transitions. [2018-06-24 23:53:12,227 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:12,227 INFO ]: Start isEmpty. Operand 418 states and 1115 transitions. [2018-06-24 23:53:12,232 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:53:12,232 INFO ]: Found error trace [2018-06-24 23:53:12,232 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:12,232 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:12,232 INFO ]: Analyzing trace with hash -1950026280, now seen corresponding path program 1 times [2018-06-24 23:53:12,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:12,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:12,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:12,233 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:12,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:12,279 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:12,540 INFO ]: Checked inductivity of 78 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 23:53:12,540 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:12,576 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:12,587 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:13,235 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:13,265 INFO ]: Computing forward predicates... [2018-06-24 23:53:13,518 INFO ]: Checked inductivity of 78 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 23:53:13,555 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:53:13,555 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 23:53:13,555 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:53:13,555 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:53:13,555 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:53:13,555 INFO ]: Start difference. First operand 418 states and 1115 transitions. Second operand 6 states. [2018-06-24 23:53:15,722 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:15,722 INFO ]: Finished difference Result 606 states and 1540 transitions. [2018-06-24 23:53:15,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 23:53:15,724 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-24 23:53:15,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:15,728 INFO ]: With dead ends: 606 [2018-06-24 23:53:15,728 INFO ]: Without dead ends: 606 [2018-06-24 23:53:15,729 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:53:15,729 INFO ]: Start minimizeSevpa. Operand 606 states. [2018-06-24 23:53:15,754 INFO ]: Finished minimizeSevpa. Reduced states from 606 to 583. [2018-06-24 23:53:15,754 INFO ]: Start removeUnreachable. Operand 583 states. [2018-06-24 23:53:15,757 INFO ]: Finished removeUnreachable. Reduced from 583 states to 583 states and 1503 transitions. [2018-06-24 23:53:15,758 INFO ]: Start accepts. Automaton has 583 states and 1503 transitions. Word has length 17 [2018-06-24 23:53:15,758 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:15,758 INFO ]: Abstraction has 583 states and 1503 transitions. [2018-06-24 23:53:15,758 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:53:15,758 INFO ]: Start isEmpty. Operand 583 states and 1503 transitions. [2018-06-24 23:53:15,760 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:53:15,760 INFO ]: Found error trace [2018-06-24 23:53:15,760 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:15,760 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:15,760 INFO ]: Analyzing trace with hash -2082738756, now seen corresponding path program 1 times [2018-06-24 23:53:15,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:15,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:15,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:15,761 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:15,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:15,814 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:16,032 INFO ]: Checked inductivity of 78 backedges. 46 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 23:53:16,032 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:16,032 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:16,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:16,553 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:16,572 INFO ]: Computing forward predicates... [2018-06-24 23:53:16,590 INFO ]: Checked inductivity of 78 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-24 23:53:16,611 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 23:53:16,612 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-24 23:53:16,612 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:53:16,612 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:53:16,612 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:53:16,612 INFO ]: Start difference. First operand 583 states and 1503 transitions. Second operand 6 states. [2018-06-24 23:53:19,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:19,371 INFO ]: Finished difference Result 1588 states and 3662 transitions. [2018-06-24 23:53:19,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 23:53:19,372 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-24 23:53:19,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:19,382 INFO ]: With dead ends: 1588 [2018-06-24 23:53:19,382 INFO ]: Without dead ends: 1531 [2018-06-24 23:53:19,382 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 23:53:19,383 INFO ]: Start minimizeSevpa. Operand 1531 states. [2018-06-24 23:53:19,424 INFO ]: Finished minimizeSevpa. Reduced states from 1531 to 1247. [2018-06-24 23:53:19,424 INFO ]: Start removeUnreachable. Operand 1247 states. [2018-06-24 23:53:19,431 INFO ]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2977 transitions. [2018-06-24 23:53:19,431 INFO ]: Start accepts. Automaton has 1247 states and 2977 transitions. Word has length 17 [2018-06-24 23:53:19,432 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:19,432 INFO ]: Abstraction has 1247 states and 2977 transitions. [2018-06-24 23:53:19,432 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:53:19,432 INFO ]: Start isEmpty. Operand 1247 states and 2977 transitions. [2018-06-24 23:53:19,435 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:53:19,435 INFO ]: Found error trace [2018-06-24 23:53:19,435 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:19,435 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:19,435 INFO ]: Analyzing trace with hash 1065834736, now seen corresponding path program 1 times [2018-06-24 23:53:19,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:19,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:19,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:19,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:19,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:19,484 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:19,583 INFO ]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-24 23:53:19,583 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:19,583 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:19,583 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:19,584 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:19,584 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:19,584 INFO ]: Start difference. First operand 1247 states and 2977 transitions. Second operand 3 states. [2018-06-24 23:53:20,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:20,672 INFO ]: Finished difference Result 1462 states and 3400 transitions. [2018-06-24 23:53:20,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:20,672 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 23:53:20,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:20,681 INFO ]: With dead ends: 1462 [2018-06-24 23:53:20,681 INFO ]: Without dead ends: 1386 [2018-06-24 23:53:20,681 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:20,682 INFO ]: Start minimizeSevpa. Operand 1386 states. [2018-06-24 23:53:20,712 INFO ]: Finished minimizeSevpa. Reduced states from 1386 to 860. [2018-06-24 23:53:20,712 INFO ]: Start removeUnreachable. Operand 860 states. [2018-06-24 23:53:20,716 INFO ]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2191 transitions. [2018-06-24 23:53:20,716 INFO ]: Start accepts. Automaton has 860 states and 2191 transitions. Word has length 17 [2018-06-24 23:53:20,716 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:20,716 INFO ]: Abstraction has 860 states and 2191 transitions. [2018-06-24 23:53:20,716 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:20,716 INFO ]: Start isEmpty. Operand 860 states and 2191 transitions. [2018-06-24 23:53:20,719 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 23:53:20,719 INFO ]: Found error trace [2018-06-24 23:53:20,719 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:20,719 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:20,719 INFO ]: Analyzing trace with hash -410573557, now seen corresponding path program 1 times [2018-06-24 23:53:20,719 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:20,719 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:20,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:20,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:20,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:20,764 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:20,867 INFO ]: Checked inductivity of 91 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 23:53:20,867 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:20,867 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:20,867 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:20,867 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:20,867 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:20,867 INFO ]: Start difference. First operand 860 states and 2191 transitions. Second operand 3 states. [2018-06-24 23:53:21,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:21,666 INFO ]: Finished difference Result 849 states and 2088 transitions. [2018-06-24 23:53:21,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:21,666 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-24 23:53:21,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:21,671 INFO ]: With dead ends: 849 [2018-06-24 23:53:21,671 INFO ]: Without dead ends: 778 [2018-06-24 23:53:21,671 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:21,672 INFO ]: Start minimizeSevpa. Operand 778 states. [2018-06-24 23:53:21,694 INFO ]: Finished minimizeSevpa. Reduced states from 778 to 634. [2018-06-24 23:53:21,694 INFO ]: Start removeUnreachable. Operand 634 states. [2018-06-24 23:53:21,696 INFO ]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1560 transitions. [2018-06-24 23:53:21,696 INFO ]: Start accepts. Automaton has 634 states and 1560 transitions. Word has length 18 [2018-06-24 23:53:21,697 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:21,697 INFO ]: Abstraction has 634 states and 1560 transitions. [2018-06-24 23:53:21,697 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:21,697 INFO ]: Start isEmpty. Operand 634 states and 1560 transitions. [2018-06-24 23:53:21,699 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 23:53:21,699 INFO ]: Found error trace [2018-06-24 23:53:21,699 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:21,699 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:21,699 INFO ]: Analyzing trace with hash -1457750157, now seen corresponding path program 1 times [2018-06-24 23:53:21,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:21,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:21,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:21,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:21,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:21,771 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:21,942 INFO ]: Checked inductivity of 153 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 23:53:21,942 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:21,942 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:21,942 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:21,942 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:21,942 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:21,943 INFO ]: Start difference. First operand 634 states and 1560 transitions. Second operand 3 states. [2018-06-24 23:53:22,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:22,482 INFO ]: Finished difference Result 802 states and 1914 transitions. [2018-06-24 23:53:22,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:22,484 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-24 23:53:22,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:22,487 INFO ]: With dead ends: 802 [2018-06-24 23:53:22,487 INFO ]: Without dead ends: 800 [2018-06-24 23:53:22,487 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:22,488 INFO ]: Start minimizeSevpa. Operand 800 states. [2018-06-24 23:53:22,508 INFO ]: Finished minimizeSevpa. Reduced states from 800 to 787. [2018-06-24 23:53:22,508 INFO ]: Start removeUnreachable. Operand 787 states. [2018-06-24 23:53:22,511 INFO ]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1891 transitions. [2018-06-24 23:53:22,511 INFO ]: Start accepts. Automaton has 787 states and 1891 transitions. Word has length 22 [2018-06-24 23:53:22,512 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:22,512 INFO ]: Abstraction has 787 states and 1891 transitions. [2018-06-24 23:53:22,512 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:22,512 INFO ]: Start isEmpty. Operand 787 states and 1891 transitions. [2018-06-24 23:53:22,514 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 23:53:22,514 INFO ]: Found error trace [2018-06-24 23:53:22,514 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:22,514 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:22,514 INFO ]: Analyzing trace with hash -695593492, now seen corresponding path program 1 times [2018-06-24 23:53:22,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:22,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:22,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:22,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:22,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:22,565 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:22,672 INFO ]: Checked inductivity of 253 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-06-24 23:53:22,672 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:22,672 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:22,672 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:22,673 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:22,673 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:22,673 INFO ]: Start difference. First operand 787 states and 1891 transitions. Second operand 3 states. [2018-06-24 23:53:23,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:23,630 INFO ]: Finished difference Result 1090 states and 2460 transitions. [2018-06-24 23:53:23,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:23,631 INFO ]: Start accepts. Automaton has 3 states. Word has length 27 [2018-06-24 23:53:23,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:23,634 INFO ]: With dead ends: 1090 [2018-06-24 23:53:23,634 INFO ]: Without dead ends: 1075 [2018-06-24 23:53:23,635 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:23,635 INFO ]: Start minimizeSevpa. Operand 1075 states. [2018-06-24 23:53:23,659 INFO ]: Finished minimizeSevpa. Reduced states from 1075 to 829. [2018-06-24 23:53:23,659 INFO ]: Start removeUnreachable. Operand 829 states. [2018-06-24 23:53:23,662 INFO ]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1965 transitions. [2018-06-24 23:53:23,662 INFO ]: Start accepts. Automaton has 829 states and 1965 transitions. Word has length 27 [2018-06-24 23:53:23,663 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:23,663 INFO ]: Abstraction has 829 states and 1965 transitions. [2018-06-24 23:53:23,663 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:23,663 INFO ]: Start isEmpty. Operand 829 states and 1965 transitions. [2018-06-24 23:53:23,665 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 23:53:23,665 INFO ]: Found error trace [2018-06-24 23:53:23,665 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:23,665 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:23,665 INFO ]: Analyzing trace with hash 1187130696, now seen corresponding path program 1 times [2018-06-24 23:53:23,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:23,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:23,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:23,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:23,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:23,713 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:23,797 INFO ]: Checked inductivity of 253 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-06-24 23:53:23,798 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:23,798 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:23,798 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:23,798 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:23,798 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:23,798 INFO ]: Start difference. First operand 829 states and 1965 transitions. Second operand 3 states. [2018-06-24 23:53:24,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:24,272 INFO ]: Finished difference Result 1077 states and 2311 transitions. [2018-06-24 23:53:24,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:24,272 INFO ]: Start accepts. Automaton has 3 states. Word has length 27 [2018-06-24 23:53:24,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:24,276 INFO ]: With dead ends: 1077 [2018-06-24 23:53:24,276 INFO ]: Without dead ends: 1041 [2018-06-24 23:53:24,276 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:24,277 INFO ]: Start minimizeSevpa. Operand 1041 states. [2018-06-24 23:53:24,302 INFO ]: Finished minimizeSevpa. Reduced states from 1041 to 933. [2018-06-24 23:53:24,302 INFO ]: Start removeUnreachable. Operand 933 states. [2018-06-24 23:53:24,306 INFO ]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1999 transitions. [2018-06-24 23:53:24,306 INFO ]: Start accepts. Automaton has 933 states and 1999 transitions. Word has length 27 [2018-06-24 23:53:24,306 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:24,306 INFO ]: Abstraction has 933 states and 1999 transitions. [2018-06-24 23:53:24,306 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:24,306 INFO ]: Start isEmpty. Operand 933 states and 1999 transitions. [2018-06-24 23:53:24,310 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 23:53:24,310 INFO ]: Found error trace [2018-06-24 23:53:24,310 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:24,310 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:24,310 INFO ]: Analyzing trace with hash -1024092153, now seen corresponding path program 1 times [2018-06-24 23:53:24,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:24,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:24,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:24,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:24,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:24,357 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:24,488 INFO ]: Checked inductivity of 253 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-24 23:53:24,488 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:24,488 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:24,488 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:24,488 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:24,488 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:24,488 INFO ]: Start difference. First operand 933 states and 1999 transitions. Second operand 3 states. [2018-06-24 23:53:25,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:25,376 INFO ]: Finished difference Result 949 states and 1929 transitions. [2018-06-24 23:53:25,377 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:25,377 INFO ]: Start accepts. Automaton has 3 states. Word has length 27 [2018-06-24 23:53:25,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:25,378 INFO ]: With dead ends: 949 [2018-06-24 23:53:25,379 INFO ]: Without dead ends: 796 [2018-06-24 23:53:25,379 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:25,379 INFO ]: Start minimizeSevpa. Operand 796 states. [2018-06-24 23:53:25,392 INFO ]: Finished minimizeSevpa. Reduced states from 796 to 628. [2018-06-24 23:53:25,393 INFO ]: Start removeUnreachable. Operand 628 states. [2018-06-24 23:53:25,395 INFO ]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1132 transitions. [2018-06-24 23:53:25,395 INFO ]: Start accepts. Automaton has 628 states and 1132 transitions. Word has length 27 [2018-06-24 23:53:25,395 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:25,395 INFO ]: Abstraction has 628 states and 1132 transitions. [2018-06-24 23:53:25,395 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:25,395 INFO ]: Start isEmpty. Operand 628 states and 1132 transitions. [2018-06-24 23:53:25,397 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 23:53:25,397 INFO ]: Found error trace [2018-06-24 23:53:25,398 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:25,398 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:25,398 INFO ]: Analyzing trace with hash -955007221, now seen corresponding path program 1 times [2018-06-24 23:53:25,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:25,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:25,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:25,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:25,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:25,448 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:25,563 INFO ]: Checked inductivity of 253 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-24 23:53:25,563 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:25,563 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:25,563 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:25,563 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:25,563 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:25,564 INFO ]: Start difference. First operand 628 states and 1132 transitions. Second operand 3 states. [2018-06-24 23:53:25,921 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:25,921 INFO ]: Finished difference Result 748 states and 1327 transitions. [2018-06-24 23:53:25,922 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:25,922 INFO ]: Start accepts. Automaton has 3 states. Word has length 27 [2018-06-24 23:53:25,922 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:25,923 INFO ]: With dead ends: 748 [2018-06-24 23:53:25,923 INFO ]: Without dead ends: 748 [2018-06-24 23:53:25,924 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:25,924 INFO ]: Start minimizeSevpa. Operand 748 states. [2018-06-24 23:53:25,937 INFO ]: Finished minimizeSevpa. Reduced states from 748 to 736. [2018-06-24 23:53:25,937 INFO ]: Start removeUnreachable. Operand 736 states. [2018-06-24 23:53:25,939 INFO ]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1312 transitions. [2018-06-24 23:53:25,939 INFO ]: Start accepts. Automaton has 736 states and 1312 transitions. Word has length 27 [2018-06-24 23:53:25,939 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:25,939 INFO ]: Abstraction has 736 states and 1312 transitions. [2018-06-24 23:53:25,939 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:25,939 INFO ]: Start isEmpty. Operand 736 states and 1312 transitions. [2018-06-24 23:53:25,941 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 23:53:25,941 INFO ]: Found error trace [2018-06-24 23:53:25,941 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:25,941 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:25,942 INFO ]: Analyzing trace with hash 704555932, now seen corresponding path program 1 times [2018-06-24 23:53:25,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:25,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:25,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:25,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:25,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:26,012 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:26,158 INFO ]: Checked inductivity of 276 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-06-24 23:53:26,158 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:26,158 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:26,158 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:26,158 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:26,158 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:26,158 INFO ]: Start difference. First operand 736 states and 1312 transitions. Second operand 3 states. [2018-06-24 23:53:26,513 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:26,513 INFO ]: Finished difference Result 773 states and 1343 transitions. [2018-06-24 23:53:26,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:26,513 INFO ]: Start accepts. Automaton has 3 states. Word has length 28 [2018-06-24 23:53:26,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:26,514 INFO ]: With dead ends: 773 [2018-06-24 23:53:26,514 INFO ]: Without dead ends: 702 [2018-06-24 23:53:26,514 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:26,515 INFO ]: Start minimizeSevpa. Operand 702 states. [2018-06-24 23:53:26,524 INFO ]: Finished minimizeSevpa. Reduced states from 702 to 619. [2018-06-24 23:53:26,524 INFO ]: Start removeUnreachable. Operand 619 states. [2018-06-24 23:53:26,526 INFO ]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1091 transitions. [2018-06-24 23:53:26,526 INFO ]: Start accepts. Automaton has 619 states and 1091 transitions. Word has length 28 [2018-06-24 23:53:26,526 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:26,526 INFO ]: Abstraction has 619 states and 1091 transitions. [2018-06-24 23:53:26,526 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:26,526 INFO ]: Start isEmpty. Operand 619 states and 1091 transitions. [2018-06-24 23:53:26,527 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 23:53:26,527 INFO ]: Found error trace [2018-06-24 23:53:26,528 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:26,528 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:26,528 INFO ]: Analyzing trace with hash 1332836195, now seen corresponding path program 1 times [2018-06-24 23:53:26,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:26,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:26,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:26,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:26,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:26,604 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:26,848 INFO ]: Checked inductivity of 300 backedges. 171 proven. 59 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-06-24 23:53:26,848 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:26,848 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:26,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:27,639 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:27,674 INFO ]: Computing forward predicates... [2018-06-24 23:53:27,706 INFO ]: Checked inductivity of 300 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-24 23:53:27,731 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 23:53:27,731 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-24 23:53:27,731 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:53:27,731 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:53:27,731 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:53:27,731 INFO ]: Start difference. First operand 619 states and 1091 transitions. Second operand 6 states. [2018-06-24 23:53:28,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:28,694 INFO ]: Finished difference Result 1344 states and 2203 transitions. [2018-06-24 23:53:28,694 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 23:53:28,694 INFO ]: Start accepts. Automaton has 6 states. Word has length 29 [2018-06-24 23:53:28,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:28,696 INFO ]: With dead ends: 1344 [2018-06-24 23:53:28,696 INFO ]: Without dead ends: 882 [2018-06-24 23:53:28,696 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-06-24 23:53:28,696 INFO ]: Start minimizeSevpa. Operand 882 states. [2018-06-24 23:53:28,704 INFO ]: Finished minimizeSevpa. Reduced states from 882 to 517. [2018-06-24 23:53:28,704 INFO ]: Start removeUnreachable. Operand 517 states. [2018-06-24 23:53:28,706 INFO ]: Finished removeUnreachable. Reduced from 517 states to 517 states and 927 transitions. [2018-06-24 23:53:28,706 INFO ]: Start accepts. Automaton has 517 states and 927 transitions. Word has length 29 [2018-06-24 23:53:28,706 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:28,706 INFO ]: Abstraction has 517 states and 927 transitions. [2018-06-24 23:53:28,706 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:53:28,706 INFO ]: Start isEmpty. Operand 517 states and 927 transitions. [2018-06-24 23:53:28,708 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 23:53:28,708 INFO ]: Found error trace [2018-06-24 23:53:28,708 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:28,708 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:28,708 INFO ]: Analyzing trace with hash 757149067, now seen corresponding path program 1 times [2018-06-24 23:53:28,708 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:28,708 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:28,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:28,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:28,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:28,794 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:28,932 INFO ]: Checked inductivity of 435 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-06-24 23:53:28,932 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:28,932 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:28,932 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:28,932 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:28,932 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:28,932 INFO ]: Start difference. First operand 517 states and 927 transitions. Second operand 3 states. [2018-06-24 23:53:29,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:29,336 INFO ]: Finished difference Result 619 states and 1012 transitions. [2018-06-24 23:53:29,337 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:29,337 INFO ]: Start accepts. Automaton has 3 states. Word has length 34 [2018-06-24 23:53:29,337 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:29,338 INFO ]: With dead ends: 619 [2018-06-24 23:53:29,338 INFO ]: Without dead ends: 460 [2018-06-24 23:53:29,338 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:29,339 INFO ]: Start minimizeSevpa. Operand 460 states. [2018-06-24 23:53:29,347 INFO ]: Finished minimizeSevpa. Reduced states from 460 to 446. [2018-06-24 23:53:29,347 INFO ]: Start removeUnreachable. Operand 446 states. [2018-06-24 23:53:29,348 INFO ]: Finished removeUnreachable. Reduced from 446 states to 446 states and 721 transitions. [2018-06-24 23:53:29,348 INFO ]: Start accepts. Automaton has 446 states and 721 transitions. Word has length 34 [2018-06-24 23:53:29,348 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:29,348 INFO ]: Abstraction has 446 states and 721 transitions. [2018-06-24 23:53:29,348 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:29,349 INFO ]: Start isEmpty. Operand 446 states and 721 transitions. [2018-06-24 23:53:29,350 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 23:53:29,350 INFO ]: Found error trace [2018-06-24 23:53:29,350 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:29,350 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:29,350 INFO ]: Analyzing trace with hash 353891576, now seen corresponding path program 1 times [2018-06-24 23:53:29,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:29,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:29,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:29,351 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:29,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:29,437 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:29,652 INFO ]: Checked inductivity of 435 backedges. 248 proven. 12 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-24 23:53:29,652 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:29,652 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 23:53:29,667 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:30,682 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:31,063 INFO ]: Computing forward predicates... [2018-06-24 23:53:31,158 INFO ]: Checked inductivity of 435 backedges. 248 proven. 12 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-24 23:53:31,195 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:53:31,195 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 23:53:31,195 INFO ]: Interpolant automaton has 4 states [2018-06-24 23:53:31,195 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 23:53:31,196 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 23:53:31,196 INFO ]: Start difference. First operand 446 states and 721 transitions. Second operand 4 states. [2018-06-24 23:53:31,566 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:31,567 INFO ]: Finished difference Result 645 states and 986 transitions. [2018-06-24 23:53:31,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 23:53:31,567 INFO ]: Start accepts. Automaton has 4 states. Word has length 34 [2018-06-24 23:53:31,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:31,568 INFO ]: With dead ends: 645 [2018-06-24 23:53:31,568 INFO ]: Without dead ends: 632 [2018-06-24 23:53:31,568 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 23:53:31,569 INFO ]: Start minimizeSevpa. Operand 632 states. [2018-06-24 23:53:31,574 INFO ]: Finished minimizeSevpa. Reduced states from 632 to 446. [2018-06-24 23:53:31,574 INFO ]: Start removeUnreachable. Operand 446 states. [2018-06-24 23:53:31,575 INFO ]: Finished removeUnreachable. Reduced from 446 states to 446 states and 721 transitions. [2018-06-24 23:53:31,575 INFO ]: Start accepts. Automaton has 446 states and 721 transitions. Word has length 34 [2018-06-24 23:53:31,575 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:31,575 INFO ]: Abstraction has 446 states and 721 transitions. [2018-06-24 23:53:31,575 INFO ]: Interpolant automaton has 4 states. [2018-06-24 23:53:31,575 INFO ]: Start isEmpty. Operand 446 states and 721 transitions. [2018-06-24 23:53:31,576 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 23:53:31,576 INFO ]: Found error trace [2018-06-24 23:53:31,576 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:31,577 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:31,577 INFO ]: Analyzing trace with hash -439488647, now seen corresponding path program 1 times [2018-06-24 23:53:31,577 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:31,577 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:31,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:31,577 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:31,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:31,675 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:32,369 WARN ]: Spent 163.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 5 [2018-06-24 23:53:32,567 INFO ]: Checked inductivity of 435 backedges. 152 proven. 233 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-24 23:53:32,567 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:32,567 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:32,575 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:33,488 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:33,527 INFO ]: Computing forward predicates... [2018-06-24 23:53:33,565 INFO ]: Checked inductivity of 435 backedges. 131 proven. 213 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-24 23:53:33,603 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:53:33,603 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2018-06-24 23:53:33,603 INFO ]: Interpolant automaton has 10 states [2018-06-24 23:53:33,603 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 23:53:33,603 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 23:53:33,603 INFO ]: Start difference. First operand 446 states and 721 transitions. Second operand 10 states. [2018-06-24 23:53:35,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:35,216 INFO ]: Finished difference Result 982 states and 1472 transitions. [2018-06-24 23:53:35,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 23:53:35,217 INFO ]: Start accepts. Automaton has 10 states. Word has length 34 [2018-06-24 23:53:35,217 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:35,218 INFO ]: With dead ends: 982 [2018-06-24 23:53:35,218 INFO ]: Without dead ends: 967 [2018-06-24 23:53:35,219 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-06-24 23:53:35,219 INFO ]: Start minimizeSevpa. Operand 967 states. [2018-06-24 23:53:35,226 INFO ]: Finished minimizeSevpa. Reduced states from 967 to 557. [2018-06-24 23:53:35,226 INFO ]: Start removeUnreachable. Operand 557 states. [2018-06-24 23:53:35,228 INFO ]: Finished removeUnreachable. Reduced from 557 states to 557 states and 912 transitions. [2018-06-24 23:53:35,228 INFO ]: Start accepts. Automaton has 557 states and 912 transitions. Word has length 34 [2018-06-24 23:53:35,228 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:35,228 INFO ]: Abstraction has 557 states and 912 transitions. [2018-06-24 23:53:35,228 INFO ]: Interpolant automaton has 10 states. [2018-06-24 23:53:35,228 INFO ]: Start isEmpty. Operand 557 states and 912 transitions. [2018-06-24 23:53:35,230 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-24 23:53:35,230 INFO ]: Found error trace [2018-06-24 23:53:35,230 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:35,230 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:35,230 INFO ]: Analyzing trace with hash 697281973, now seen corresponding path program 1 times [2018-06-24 23:53:35,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:35,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:35,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:35,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:35,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:35,323 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:35,623 INFO ]: Checked inductivity of 703 backedges. 360 proven. 39 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2018-06-24 23:53:35,623 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:35,623 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 23:53:35,639 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:36,831 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:36,874 INFO ]: Computing forward predicates... [2018-06-24 23:53:36,889 INFO ]: Checked inductivity of 703 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-06-24 23:53:36,922 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 23:53:36,922 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-24 23:53:36,923 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:53:36,923 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:53:36,923 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:53:36,923 INFO ]: Start difference. First operand 557 states and 912 transitions. Second operand 6 states. [2018-06-24 23:53:37,713 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:37,713 INFO ]: Finished difference Result 740 states and 1103 transitions. [2018-06-24 23:53:37,713 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 23:53:37,713 INFO ]: Start accepts. Automaton has 6 states. Word has length 42 [2018-06-24 23:53:37,713 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:37,714 INFO ]: With dead ends: 740 [2018-06-24 23:53:37,714 INFO ]: Without dead ends: 503 [2018-06-24 23:53:37,714 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-06-24 23:53:37,715 INFO ]: Start minimizeSevpa. Operand 503 states. [2018-06-24 23:53:37,721 INFO ]: Finished minimizeSevpa. Reduced states from 503 to 456. [2018-06-24 23:53:37,721 INFO ]: Start removeUnreachable. Operand 456 states. [2018-06-24 23:53:37,722 INFO ]: Finished removeUnreachable. Reduced from 456 states to 456 states and 673 transitions. [2018-06-24 23:53:37,722 INFO ]: Start accepts. Automaton has 456 states and 673 transitions. Word has length 42 [2018-06-24 23:53:37,722 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:37,722 INFO ]: Abstraction has 456 states and 673 transitions. [2018-06-24 23:53:37,722 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:53:37,722 INFO ]: Start isEmpty. Operand 456 states and 673 transitions. [2018-06-24 23:53:37,724 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-24 23:53:37,724 INFO ]: Found error trace [2018-06-24 23:53:37,724 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:37,724 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:37,724 INFO ]: Analyzing trace with hash -2111520341, now seen corresponding path program 1 times [2018-06-24 23:53:37,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:37,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:37,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:37,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:37,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:37,786 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:37,878 INFO ]: Checked inductivity of 780 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-06-24 23:53:37,878 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:37,878 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:37,878 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:37,878 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:37,878 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:37,878 INFO ]: Start difference. First operand 456 states and 673 transitions. Second operand 3 states. [2018-06-24 23:53:38,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:38,261 INFO ]: Finished difference Result 541 states and 787 transitions. [2018-06-24 23:53:38,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:38,261 INFO ]: Start accepts. Automaton has 3 states. Word has length 44 [2018-06-24 23:53:38,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:38,262 INFO ]: With dead ends: 541 [2018-06-24 23:53:38,262 INFO ]: Without dead ends: 524 [2018-06-24 23:53:38,262 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:38,263 INFO ]: Start minimizeSevpa. Operand 524 states. [2018-06-24 23:53:38,268 INFO ]: Finished minimizeSevpa. Reduced states from 524 to 466. [2018-06-24 23:53:38,268 INFO ]: Start removeUnreachable. Operand 466 states. [2018-06-24 23:53:38,270 INFO ]: Finished removeUnreachable. Reduced from 466 states to 466 states and 684 transitions. [2018-06-24 23:53:38,270 INFO ]: Start accepts. Automaton has 466 states and 684 transitions. Word has length 44 [2018-06-24 23:53:38,270 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:38,270 INFO ]: Abstraction has 466 states and 684 transitions. [2018-06-24 23:53:38,270 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:38,270 INFO ]: Start isEmpty. Operand 466 states and 684 transitions. [2018-06-24 23:53:38,271 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-24 23:53:38,271 INFO ]: Found error trace [2018-06-24 23:53:38,271 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:38,271 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:38,271 INFO ]: Analyzing trace with hash -1756924358, now seen corresponding path program 1 times [2018-06-24 23:53:38,271 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:38,271 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:38,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:38,272 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:38,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:38,381 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:38,557 INFO ]: Checked inductivity of 820 backedges. 452 proven. 161 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-06-24 23:53:38,557 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:38,557 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:38,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:39,897 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:39,935 INFO ]: Computing forward predicates... [2018-06-24 23:53:39,971 INFO ]: Checked inductivity of 820 backedges. 452 proven. 145 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-06-24 23:53:39,999 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:53:39,999 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-06-24 23:53:39,999 INFO ]: Interpolant automaton has 9 states [2018-06-24 23:53:39,999 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 23:53:39,999 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-24 23:53:39,999 INFO ]: Start difference. First operand 466 states and 684 transitions. Second operand 9 states. [2018-06-24 23:53:41,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:41,036 INFO ]: Finished difference Result 930 states and 1267 transitions. [2018-06-24 23:53:41,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 23:53:41,037 INFO ]: Start accepts. Automaton has 9 states. Word has length 45 [2018-06-24 23:53:41,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:41,038 INFO ]: With dead ends: 930 [2018-06-24 23:53:41,038 INFO ]: Without dead ends: 685 [2018-06-24 23:53:41,038 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-24 23:53:41,038 INFO ]: Start minimizeSevpa. Operand 685 states. [2018-06-24 23:53:41,045 INFO ]: Finished minimizeSevpa. Reduced states from 685 to 497. [2018-06-24 23:53:41,045 INFO ]: Start removeUnreachable. Operand 497 states. [2018-06-24 23:53:41,047 INFO ]: Finished removeUnreachable. Reduced from 497 states to 497 states and 725 transitions. [2018-06-24 23:53:41,047 INFO ]: Start accepts. Automaton has 497 states and 725 transitions. Word has length 45 [2018-06-24 23:53:41,047 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:41,047 INFO ]: Abstraction has 497 states and 725 transitions. [2018-06-24 23:53:41,047 INFO ]: Interpolant automaton has 9 states. [2018-06-24 23:53:41,047 INFO ]: Start isEmpty. Operand 497 states and 725 transitions. [2018-06-24 23:53:41,048 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-24 23:53:41,048 INFO ]: Found error trace [2018-06-24 23:53:41,048 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:41,048 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:41,048 INFO ]: Analyzing trace with hash 1311185174, now seen corresponding path program 1 times [2018-06-24 23:53:41,048 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:41,048 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:41,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:41,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:41,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:41,176 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:41,374 INFO ]: Checked inductivity of 820 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-06-24 23:53:41,374 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:41,374 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:41,375 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:41,375 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:41,375 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:41,375 INFO ]: Start difference. First operand 497 states and 725 transitions. Second operand 3 states. [2018-06-24 23:53:42,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:42,022 INFO ]: Finished difference Result 525 states and 760 transitions. [2018-06-24 23:53:42,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:42,023 INFO ]: Start accepts. Automaton has 3 states. Word has length 45 [2018-06-24 23:53:42,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:42,024 INFO ]: With dead ends: 525 [2018-06-24 23:53:42,024 INFO ]: Without dead ends: 257 [2018-06-24 23:53:42,024 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:42,024 INFO ]: Start minimizeSevpa. Operand 257 states. [2018-06-24 23:53:42,027 INFO ]: Finished minimizeSevpa. Reduced states from 257 to 240. [2018-06-24 23:53:42,027 INFO ]: Start removeUnreachable. Operand 240 states. [2018-06-24 23:53:42,027 INFO ]: Finished removeUnreachable. Reduced from 240 states to 240 states and 338 transitions. [2018-06-24 23:53:42,027 INFO ]: Start accepts. Automaton has 240 states and 338 transitions. Word has length 45 [2018-06-24 23:53:42,027 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:42,027 INFO ]: Abstraction has 240 states and 338 transitions. [2018-06-24 23:53:42,027 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:42,027 INFO ]: Start isEmpty. Operand 240 states and 338 transitions. [2018-06-24 23:53:42,028 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-24 23:53:42,028 INFO ]: Found error trace [2018-06-24 23:53:42,028 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:42,028 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:42,028 INFO ]: Analyzing trace with hash 1514834358, now seen corresponding path program 1 times [2018-06-24 23:53:42,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:42,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:42,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:42,028 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:42,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:42,146 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:42,708 INFO ]: Checked inductivity of 1035 backedges. 669 proven. 92 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-06-24 23:53:42,708 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:42,708 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:42,714 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:44,211 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:44,273 INFO ]: Computing forward predicates... [2018-06-24 23:53:45,569 INFO ]: Checked inductivity of 1035 backedges. 704 proven. 57 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-06-24 23:53:45,613 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:53:45,613 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-24 23:53:45,613 INFO ]: Interpolant automaton has 13 states [2018-06-24 23:53:45,613 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 23:53:45,613 INFO ]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-24 23:53:45,613 INFO ]: Start difference. First operand 240 states and 338 transitions. Second operand 13 states. Received shutdown request... [2018-06-24 23:53:46,557 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 23:53:46,557 WARN ]: Verification canceled [2018-06-24 23:53:46,560 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 23:53:46,561 WARN ]: Timeout [2018-06-24 23:53:46,562 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:53:46 BasicIcfg [2018-06-24 23:53:46,562 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 23:53:46,563 INFO ]: Toolchain (without parser) took 54622.29 ms. Allocated memory was 305.1 MB in the beginning and 1.2 GB in the end (delta: 895.5 MB). Free memory was 190.6 MB in the beginning and 642.1 MB in the end (delta: -451.4 MB). Peak memory consumption was 444.0 MB. Max. memory is 3.6 GB. [2018-06-24 23:53:46,563 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 23:53:46,563 INFO ]: ChcToBoogie took 107.89 ms. Allocated memory was 305.1 MB in the beginning and 318.2 MB in the end (delta: 13.1 MB). Free memory was 189.6 MB in the beginning and 291.4 MB in the end (delta: -101.8 MB). Peak memory consumption was 8.2 MB. Max. memory is 3.6 GB. [2018-06-24 23:53:46,564 INFO ]: Boogie Preprocessor took 91.55 ms. Allocated memory is still 318.2 MB. Free memory was 291.4 MB in the beginning and 287.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 3.6 GB. [2018-06-24 23:53:46,564 INFO ]: RCFGBuilder took 632.99 ms. Allocated memory is still 318.2 MB. Free memory was 287.6 MB in the beginning and 214.3 MB in the end (delta: 73.3 MB). Peak memory consumption was 73.3 MB. Max. memory is 3.6 GB. [2018-06-24 23:53:46,565 INFO ]: BlockEncodingV2 took 3853.42 ms. Allocated memory was 318.2 MB in the beginning and 367.0 MB in the end (delta: 48.8 MB). Free memory was 214.3 MB in the beginning and 246.9 MB in the end (delta: -32.6 MB). Peak memory consumption was 52.1 MB. Max. memory is 3.6 GB. [2018-06-24 23:53:46,565 INFO ]: TraceAbstraction took 49921.18 ms. Allocated memory was 367.0 MB in the beginning and 1.2 GB in the end (delta: 833.6 MB). Free memory was 246.9 MB in the beginning and 642.1 MB in the end (delta: -395.2 MB). Peak memory consumption was 438.4 MB. Max. memory is 3.6 GB. [2018-06-24 23:53:46,567 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, 99 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 107.89 ms. Allocated memory was 305.1 MB in the beginning and 318.2 MB in the end (delta: 13.1 MB). Free memory was 189.6 MB in the beginning and 291.4 MB in the end (delta: -101.8 MB). Peak memory consumption was 8.2 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 91.55 ms. Allocated memory is still 318.2 MB. Free memory was 291.4 MB in the beginning and 287.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 3.6 GB. * RCFGBuilder took 632.99 ms. Allocated memory is still 318.2 MB. Free memory was 287.6 MB in the beginning and 214.3 MB in the end (delta: 73.3 MB). Peak memory consumption was 73.3 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 3853.42 ms. Allocated memory was 318.2 MB in the beginning and 367.0 MB in the end (delta: 48.8 MB). Free memory was 214.3 MB in the beginning and 246.9 MB in the end (delta: -32.6 MB). Peak memory consumption was 52.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 49921.18 ms. Allocated memory was 367.0 MB in the beginning and 1.2 GB in the end (delta: 833.6 MB). Free memory was 246.9 MB in the beginning and 642.1 MB in the end (delta: -395.2 MB). Peak memory consumption was 438.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 (240states) and interpolant automaton (currently 5 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (103 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 49.8s OverallTime, 36 OverallIterations, 3 TraceHistogramMax, 30.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 172 SDtfs, 5 SDslu, 238 SDs, 0 SdLazy, 10296 SolverSat, 2881 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 578 GetRequests, 461 SyntacticMatches, 15 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1247occurred in iteration=19, 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.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 2920 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 3.2s SsaConstructionTime, 6.7s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1019 NumberOfCodeBlocks, 1019 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 975 ConstructedInterpolants, 0 QuantifiedInterpolants, 58940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 63836 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 44 InterpolantComputations, 31 PerfectInterpolantSequences, 10702/11762 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_23-53-46-583.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_23-53-46-583.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_23-53-46-583.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_23-53-46-583.csv Completed graceful shutdown