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/lustre/speed2_e7_223.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 06:56:43,868 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 06:56:43,870 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 06:56:43,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 06:56:43,882 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 06:56:43,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 06:56:43,885 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 06:56:43,887 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 06:56:43,889 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 06:56:43,890 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 06:56:43,891 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 06:56:43,891 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 06:56:43,892 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 06:56:43,893 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 06:56:43,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 06:56:43,895 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 06:56:43,897 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 06:56:43,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 06:56:43,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 06:56:43,902 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 06:56:43,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 06:56:43,906 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 06:56:43,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 06:56:43,906 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 06:56:43,907 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 06:56:43,908 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 06:56:43,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 06:56:43,910 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 06:56:43,911 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 06:56:43,911 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 06:56:43,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 06:56:43,913 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 06:56:43,913 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 06:56:43,914 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 06:56:43,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 06:56:43,915 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 06:56:43,930 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 06:56:43,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 06:56:43,931 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 06:56:43,931 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 06:56:43,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 06:56:43,932 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 06:56:43,933 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 06:56:43,933 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 06:56:43,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 06:56:43,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 06:56:43,933 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 06:56:43,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 06:56:43,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:56:43,938 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 06:56:43,938 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 06:56:43,939 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 06:56:43,939 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 06:56:43,939 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 06:56:43,939 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 06:56:43,939 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 06:56:43,939 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 06:56:43,941 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 06:56:43,941 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 06:56:43,985 INFO ]: Repository-Root is: /tmp [2018-06-25 06:56:44,014 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 06:56:44,017 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 06:56:44,019 INFO ]: Initializing SmtParser... [2018-06-25 06:56:44,023 INFO ]: SmtParser initialized [2018-06-25 06:56:44,023 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e7_223.smt2 [2018-06-25 06:56:44,044 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-25 06:56:44,189 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e7_223.smt2 unknown [2018-06-25 06:56:44,494 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e7_223.smt2 [2018-06-25 06:56:44,499 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 06:56:44,513 INFO ]: Walking toolchain with 5 elements. [2018-06-25 06:56:44,514 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 06:56:44,514 INFO ]: Initializing ChcToBoogie... [2018-06-25 06:56:44,514 INFO ]: ChcToBoogie initialized [2018-06-25 06:56:44,526 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,590 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44 Unit [2018-06-25 06:56:44,590 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 06:56:44,591 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 06:56:44,591 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 06:56:44,591 INFO ]: Boogie Preprocessor initialized [2018-06-25 06:56:44,612 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,612 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,620 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,620 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,625 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,626 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,633 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,635 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 06:56:44,635 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 06:56:44,635 INFO ]: Initializing RCFGBuilder... [2018-06-25 06:56:44,635 INFO ]: RCFGBuilder initialized [2018-06-25 06:56:44,636 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (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-25 06:56:44,658 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 06:56:44,658 INFO ]: Found specification of procedure gotoProc [2018-06-25 06:56:44,658 INFO ]: Found implementation of procedure gotoProc [2018-06-25 06:56:44,658 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 06:56:44,658 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 06:56:44,658 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-25 06:56:45,009 INFO ]: Using library mode [2018-06-25 06:56:45,015 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:56:45 BoogieIcfgContainer [2018-06-25 06:56:45,015 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 06:56:45,015 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 06:56:45,015 INFO ]: Initializing BlockEncodingV2... [2018-06-25 06:56:45,018 INFO ]: BlockEncodingV2 initialized [2018-06-25 06:56:45,018 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:56:45" (1/1) ... [2018-06-25 06:56:45,038 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 06:56:45,040 INFO ]: Using Remove infeasible edges [2018-06-25 06:56:45,041 INFO ]: Using Maximize final states [2018-06-25 06:56:45,043 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 06:56:45,043 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 06:56:45,045 INFO ]: Using Remove sink states [2018-06-25 06:56:45,046 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 06:56:45,046 INFO ]: Using Use SBE [2018-06-25 06:56:45,061 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 06:56:47,880 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 06:56:47,884 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:56:48,533 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 06:56:48,534 INFO ]: SBE split 2 edges [2018-06-25 06:56:48,550 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 06:56:48,554 INFO ]: 0 new accepting states [2018-06-25 06:57:03,727 INFO ]: Removed 2058 edges and 2 locations by large block encoding [2018-06-25 06:57:03,730 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:57:03,746 INFO ]: Removed 5 edges and 0 locations because of local infeasibility [2018-06-25 06:57:03,748 INFO ]: 0 new accepting states [2018-06-25 06:57:03,750 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:57:03,751 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:57:03,758 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 06:57:03,761 INFO ]: 0 new accepting states [2018-06-25 06:57:03,763 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:57:03,763 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:57:03,774 INFO ]: Encoded RCFG 6 locations, 2055 edges [2018-06-25 06:57:03,774 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:57:03 BasicIcfg [2018-06-25 06:57:03,774 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 06:57:03,775 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 06:57:03,775 INFO ]: Initializing TraceAbstraction... [2018-06-25 06:57:03,845 INFO ]: TraceAbstraction initialized [2018-06-25 06:57:03,845 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:56:44" (1/4) ... [2018-06-25 06:57:03,897 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f1ac31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 06:57:03, skipping insertion in model container [2018-06-25 06:57:03,897 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (2/4) ... [2018-06-25 06:57:03,897 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f1ac31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 06:57:03, skipping insertion in model container [2018-06-25 06:57:03,897 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:56:45" (3/4) ... [2018-06-25 06:57:03,898 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f1ac31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:57:03, skipping insertion in model container [2018-06-25 06:57:03,898 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:57:03" (4/4) ... [2018-06-25 06:57:03,899 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 06:57:04,024 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 06:57:04,196 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 06:57:05,380 INFO ]: Using default assertion order modulation [2018-06-25 06:57:05,381 INFO ]: Interprodecural is true [2018-06-25 06:57:05,381 INFO ]: Hoare is false [2018-06-25 06:57:05,381 INFO ]: Compute interpolants for FPandBP [2018-06-25 06:57:05,381 INFO ]: Backedges is TWOTRACK [2018-06-25 06:57:05,381 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 06:57:05,381 INFO ]: Difference is false [2018-06-25 06:57:05,381 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 06:57:05,382 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 06:57:05,486 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 06:57:05,543 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:05,543 INFO ]: Found error trace [2018-06-25 06:57:05,557 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:05,557 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:05,562 INFO ]: Analyzing trace with hash 161071571, now seen corresponding path program 1 times [2018-06-25 06:57:05,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:05,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:05,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:05,833 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:05,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:05,964 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:06,175 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:06,178 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:06,178 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:06,180 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:06,197 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:06,197 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:06,218 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 06:57:09,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:09,684 INFO ]: Finished difference Result 7 states and 2056 transitions. [2018-06-25 06:57:09,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:09,685 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:57:09,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:09,778 INFO ]: With dead ends: 7 [2018-06-25 06:57:09,778 INFO ]: Without dead ends: 7 [2018-06-25 06:57:09,780 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-25 06:57:10,275 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:10,399 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:10,400 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:10,405 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2056 transitions. [2018-06-25 06:57:10,406 INFO ]: Start accepts. Automaton has 7 states and 2056 transitions. Word has length 5 [2018-06-25 06:57:10,407 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:10,407 INFO ]: Abstraction has 7 states and 2056 transitions. [2018-06-25 06:57:10,407 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:10,407 INFO ]: Start isEmpty. Operand 7 states and 2056 transitions. [2018-06-25 06:57:10,409 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:10,409 INFO ]: Found error trace [2018-06-25 06:57:10,409 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:10,409 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:10,409 INFO ]: Analyzing trace with hash 579666086, now seen corresponding path program 1 times [2018-06-25 06:57:10,409 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:10,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:10,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:10,411 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:10,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:10,471 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:10,618 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:10,618 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:10,618 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:10,619 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:10,619 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:10,619 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:10,620 INFO ]: Start difference. First operand 7 states and 2056 transitions. Second operand 3 states. [2018-06-25 06:57:13,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:13,863 INFO ]: Finished difference Result 8 states and 2056 transitions. [2018-06-25 06:57:13,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:13,863 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:13,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:13,866 INFO ]: With dead ends: 8 [2018-06-25 06:57:13,866 INFO ]: Without dead ends: 7 [2018-06-25 06:57:13,867 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:13,867 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:13,878 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:13,878 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:13,881 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1544 transitions. [2018-06-25 06:57:13,881 INFO ]: Start accepts. Automaton has 7 states and 1544 transitions. Word has length 6 [2018-06-25 06:57:13,881 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:13,881 INFO ]: Abstraction has 7 states and 1544 transitions. [2018-06-25 06:57:13,881 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:13,881 INFO ]: Start isEmpty. Operand 7 states and 1544 transitions. [2018-06-25 06:57:13,882 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:13,882 INFO ]: Found error trace [2018-06-25 06:57:13,882 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:13,882 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:13,882 INFO ]: Analyzing trace with hash 580589607, now seen corresponding path program 1 times [2018-06-25 06:57:13,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:13,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:13,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:13,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:13,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:13,913 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:13,958 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:13,958 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:13,958 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:13,958 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:13,958 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:13,958 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:13,958 INFO ]: Start difference. First operand 7 states and 1544 transitions. Second operand 3 states. [2018-06-25 06:57:16,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:16,069 INFO ]: Finished difference Result 8 states and 1544 transitions. [2018-06-25 06:57:16,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:16,069 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:16,070 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:16,071 INFO ]: With dead ends: 8 [2018-06-25 06:57:16,071 INFO ]: Without dead ends: 7 [2018-06-25 06:57:16,071 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-25 06:57:16,071 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:16,079 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:16,079 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:16,081 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1032 transitions. [2018-06-25 06:57:16,081 INFO ]: Start accepts. Automaton has 7 states and 1032 transitions. Word has length 6 [2018-06-25 06:57:16,081 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:16,081 INFO ]: Abstraction has 7 states and 1032 transitions. [2018-06-25 06:57:16,081 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:16,081 INFO ]: Start isEmpty. Operand 7 states and 1032 transitions. [2018-06-25 06:57:16,082 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:16,082 INFO ]: Found error trace [2018-06-25 06:57:16,082 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:16,082 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:16,082 INFO ]: Analyzing trace with hash 584283691, now seen corresponding path program 1 times [2018-06-25 06:57:16,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:16,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:16,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:16,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:16,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:16,114 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:16,164 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:16,165 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:16,165 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:16,165 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:16,165 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:16,165 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:16,165 INFO ]: Start difference. First operand 7 states and 1032 transitions. Second operand 3 states. [2018-06-25 06:57:17,187 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:17,187 INFO ]: Finished difference Result 8 states and 1032 transitions. [2018-06-25 06:57:17,187 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:17,187 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:17,187 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:17,189 INFO ]: With dead ends: 8 [2018-06-25 06:57:17,189 INFO ]: Without dead ends: 7 [2018-06-25 06:57:17,189 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-25 06:57:17,189 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:17,192 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:17,193 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:17,194 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 776 transitions. [2018-06-25 06:57:17,194 INFO ]: Start accepts. Automaton has 7 states and 776 transitions. Word has length 6 [2018-06-25 06:57:17,194 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:17,194 INFO ]: Abstraction has 7 states and 776 transitions. [2018-06-25 06:57:17,194 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:17,194 INFO ]: Start isEmpty. Operand 7 states and 776 transitions. [2018-06-25 06:57:17,195 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:17,195 INFO ]: Found error trace [2018-06-25 06:57:17,195 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:17,195 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:17,195 INFO ]: Analyzing trace with hash 587054254, now seen corresponding path program 1 times [2018-06-25 06:57:17,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:17,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:17,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:17,196 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:17,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:17,222 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:17,247 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:17,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:17,247 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:17,247 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:17,247 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:17,247 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:17,248 INFO ]: Start difference. First operand 7 states and 776 transitions. Second operand 3 states. [2018-06-25 06:57:17,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:17,865 INFO ]: Finished difference Result 8 states and 776 transitions. [2018-06-25 06:57:17,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:17,865 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:17,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:17,866 INFO ]: With dead ends: 8 [2018-06-25 06:57:17,866 INFO ]: Without dead ends: 7 [2018-06-25 06:57:17,867 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:17,867 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:17,871 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:17,871 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:17,872 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 520 transitions. [2018-06-25 06:57:17,872 INFO ]: Start accepts. Automaton has 7 states and 520 transitions. Word has length 6 [2018-06-25 06:57:17,873 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:17,873 INFO ]: Abstraction has 7 states and 520 transitions. [2018-06-25 06:57:17,873 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:17,873 INFO ]: Start isEmpty. Operand 7 states and 520 transitions. [2018-06-25 06:57:17,873 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:17,873 INFO ]: Found error trace [2018-06-25 06:57:17,873 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:17,873 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:17,873 INFO ]: Analyzing trace with hash -355860687, now seen corresponding path program 1 times [2018-06-25 06:57:17,873 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:17,873 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:17,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:17,875 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:17,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:17,898 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:17,954 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:17,954 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:17,954 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:17,954 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:17,954 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:17,955 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:17,955 INFO ]: Start difference. First operand 7 states and 520 transitions. Second operand 3 states. [2018-06-25 06:57:18,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:18,425 INFO ]: Finished difference Result 8 states and 520 transitions. [2018-06-25 06:57:18,426 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:18,426 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:18,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:18,427 INFO ]: With dead ends: 8 [2018-06-25 06:57:18,427 INFO ]: Without dead ends: 7 [2018-06-25 06:57:18,427 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-25 06:57:18,427 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:18,430 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:18,430 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:18,431 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 392 transitions. [2018-06-25 06:57:18,431 INFO ]: Start accepts. Automaton has 7 states and 392 transitions. Word has length 6 [2018-06-25 06:57:18,431 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:18,431 INFO ]: Abstraction has 7 states and 392 transitions. [2018-06-25 06:57:18,431 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:18,431 INFO ]: Start isEmpty. Operand 7 states and 392 transitions. [2018-06-25 06:57:18,432 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:18,432 INFO ]: Found error trace [2018-06-25 06:57:18,432 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:18,432 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:18,432 INFO ]: Analyzing trace with hash -830550481, now seen corresponding path program 1 times [2018-06-25 06:57:18,432 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:18,432 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:18,433 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:18,433 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:18,433 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:18,450 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:18,488 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:18,488 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:57:18,488 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-25 06:57:18,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:18,681 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:18,699 INFO ]: Computing forward predicates... [2018-06-25 06:57:18,809 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:18,832 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:57:18,832 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 06:57:18,832 INFO ]: Interpolant automaton has 4 states [2018-06-25 06:57:18,832 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 06:57:18,832 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 06:57:18,832 INFO ]: Start difference. First operand 7 states and 392 transitions. Second operand 4 states. [2018-06-25 06:57:20,844 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:20,844 INFO ]: Finished difference Result 11 states and 395 transitions. [2018-06-25 06:57:20,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:57:20,898 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 06:57:20,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:20,898 INFO ]: With dead ends: 11 [2018-06-25 06:57:20,898 INFO ]: Without dead ends: 10 [2018-06-25 06:57:20,899 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:57:20,899 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 06:57:20,905 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 06:57:20,905 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:57:20,905 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 345 transitions. [2018-06-25 06:57:20,906 INFO ]: Start accepts. Automaton has 8 states and 345 transitions. Word has length 6 [2018-06-25 06:57:20,906 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:20,906 INFO ]: Abstraction has 8 states and 345 transitions. [2018-06-25 06:57:20,906 INFO ]: Interpolant automaton has 4 states. [2018-06-25 06:57:20,906 INFO ]: Start isEmpty. Operand 8 states and 345 transitions. [2018-06-25 06:57:20,906 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:20,906 INFO ]: Found error trace [2018-06-25 06:57:20,906 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:20,906 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:20,906 INFO ]: Analyzing trace with hash 115135023, now seen corresponding path program 1 times [2018-06-25 06:57:20,906 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:20,906 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:20,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:20,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:20,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:20,934 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:20,992 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:20,992 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:20,992 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:20,992 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:20,992 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:20,992 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:20,992 INFO ]: Start difference. First operand 8 states and 345 transitions. Second operand 3 states. [2018-06-25 06:57:21,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:21,277 INFO ]: Finished difference Result 9 states and 345 transitions. [2018-06-25 06:57:21,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:21,277 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:21,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:21,277 INFO ]: With dead ends: 9 [2018-06-25 06:57:21,277 INFO ]: Without dead ends: 8 [2018-06-25 06:57:21,278 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-25 06:57:21,278 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:21,278 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:57:21,278 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:57:21,279 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2018-06-25 06:57:21,279 INFO ]: Start accepts. Automaton has 8 states and 57 transitions. Word has length 6 [2018-06-25 06:57:21,279 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:21,279 INFO ]: Abstraction has 8 states and 57 transitions. [2018-06-25 06:57:21,279 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:21,279 INFO ]: Start isEmpty. Operand 8 states and 57 transitions. [2018-06-25 06:57:21,279 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:57:21,279 INFO ]: Found error trace [2018-06-25 06:57:21,279 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:57:21,279 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:21,279 INFO ]: Analyzing trace with hash 187471826, now seen corresponding path program 1 times [2018-06-25 06:57:21,279 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:21,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:21,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:21,280 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:21,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:21,292 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:21,311 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:57:21,311 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:21,311 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:21,311 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:21,312 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:21,312 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:21,312 INFO ]: Start difference. First operand 8 states and 57 transitions. Second operand 3 states. [2018-06-25 06:57:21,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:21,556 INFO ]: Finished difference Result 9 states and 57 transitions. [2018-06-25 06:57:21,556 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:21,556 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 06:57:21,556 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:21,556 INFO ]: With dead ends: 9 [2018-06-25 06:57:21,556 INFO ]: Without dead ends: 8 [2018-06-25 06:57:21,556 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-25 06:57:21,557 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:21,557 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:57:21,557 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:57:21,558 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-06-25 06:57:21,558 INFO ]: Start accepts. Automaton has 8 states and 41 transitions. Word has length 7 [2018-06-25 06:57:21,558 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:21,558 INFO ]: Abstraction has 8 states and 41 transitions. [2018-06-25 06:57:21,558 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:21,558 INFO ]: Start isEmpty. Operand 8 states and 41 transitions. [2018-06-25 06:57:21,558 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:57:21,558 INFO ]: Found error trace [2018-06-25 06:57:21,558 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:57:21,558 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:21,558 INFO ]: Analyzing trace with hash -237208271, now seen corresponding path program 1 times [2018-06-25 06:57:21,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:21,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:21,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:21,559 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:21,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:21,575 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:21,601 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:57:21,601 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:21,601 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:21,602 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:21,602 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:21,602 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:21,602 INFO ]: Start difference. First operand 8 states and 41 transitions. Second operand 3 states. [2018-06-25 06:57:21,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:21,636 INFO ]: Finished difference Result 9 states and 41 transitions. [2018-06-25 06:57:21,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:21,636 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 06:57:21,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:21,636 INFO ]: With dead ends: 9 [2018-06-25 06:57:21,636 INFO ]: Without dead ends: 8 [2018-06-25 06:57:21,636 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-25 06:57:21,637 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:21,637 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:57:21,637 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:57:21,638 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-25 06:57:21,638 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 7 [2018-06-25 06:57:21,638 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:21,638 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-25 06:57:21,638 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:21,638 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-25 06:57:21,638 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:57:21,638 INFO ]: Found error trace [2018-06-25 06:57:21,638 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:57:21,638 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:21,638 INFO ]: Analyzing trace with hash 1878970319, now seen corresponding path program 1 times [2018-06-25 06:57:21,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:21,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:21,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:21,639 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:21,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:21,650 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:21,765 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:57:21,765 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:21,765 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:21,766 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:21,766 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:21,766 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:21,766 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 3 states. [2018-06-25 06:57:21,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:21,796 INFO ]: Finished difference Result 9 states and 25 transitions. [2018-06-25 06:57:21,796 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:21,796 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 06:57:21,796 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:21,796 INFO ]: With dead ends: 9 [2018-06-25 06:57:21,796 INFO ]: Without dead ends: 8 [2018-06-25 06:57:21,797 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:21,797 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:21,797 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:57:21,797 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:57:21,797 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-06-25 06:57:21,797 INFO ]: Start accepts. Automaton has 8 states and 17 transitions. Word has length 7 [2018-06-25 06:57:21,797 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:21,797 INFO ]: Abstraction has 8 states and 17 transitions. [2018-06-25 06:57:21,798 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:21,798 INFO ]: Start isEmpty. Operand 8 states and 17 transitions. [2018-06-25 06:57:21,798 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:57:21,798 INFO ]: Found error trace [2018-06-25 06:57:21,798 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:57:21,798 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:21,798 INFO ]: Analyzing trace with hash -1067453650, now seen corresponding path program 1 times [2018-06-25 06:57:21,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:21,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:21,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:21,798 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:21,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:21,812 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:21,854 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:57:21,854 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:21,854 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:21,854 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:21,854 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:21,854 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:21,854 INFO ]: Start difference. First operand 8 states and 17 transitions. Second operand 3 states. [2018-06-25 06:57:21,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:21,865 INFO ]: Finished difference Result 9 states and 17 transitions. [2018-06-25 06:57:21,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:21,865 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 06:57:21,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:21,866 INFO ]: With dead ends: 9 [2018-06-25 06:57:21,866 INFO ]: Without dead ends: 8 [2018-06-25 06:57:21,866 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-25 06:57:21,866 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:21,867 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:57:21,867 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:57:21,867 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-06-25 06:57:21,867 INFO ]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 7 [2018-06-25 06:57:21,867 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:21,867 INFO ]: Abstraction has 8 states and 13 transitions. [2018-06-25 06:57:21,867 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:21,867 INFO ]: Start isEmpty. Operand 8 states and 13 transitions. [2018-06-25 06:57:21,867 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:57:21,867 INFO ]: Found error trace [2018-06-25 06:57:21,867 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:57:21,867 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:21,867 INFO ]: Analyzing trace with hash -841393672, now seen corresponding path program 1 times [2018-06-25 06:57:21,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:21,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:21,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:21,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:21,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:21,885 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:22,470 WARN ]: Spent 493.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2018-06-25 06:57:22,693 WARN ]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 06:57:22,712 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:22,712 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:57:22,713 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-25 06:57:22,723 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:22,789 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:22,792 INFO ]: Computing forward predicates... [2018-06-25 06:57:23,232 WARN ]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 06:57:23,240 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 06:57:23,259 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 06:57:23,428 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:23,460 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:57:23,460 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 06:57:23,461 INFO ]: Interpolant automaton has 7 states [2018-06-25 06:57:23,461 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 06:57:23,461 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:57:23,461 INFO ]: Start difference. First operand 8 states and 13 transitions. Second operand 7 states. [2018-06-25 06:57:23,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:23,605 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-25 06:57:23,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:57:23,605 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 06:57:23,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:23,605 INFO ]: With dead ends: 11 [2018-06-25 06:57:23,605 INFO ]: Without dead ends: 8 [2018-06-25 06:57:23,606 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-25 06:57:23,606 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:23,606 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:57:23,606 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:57:23,606 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-25 06:57:23,607 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2018-06-25 06:57:23,607 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:23,607 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-25 06:57:23,607 INFO ]: Interpolant automaton has 7 states. [2018-06-25 06:57:23,607 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-25 06:57:23,607 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:57:23,607 INFO ]: Found error trace [2018-06-25 06:57:23,607 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:57:23,607 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:23,607 INFO ]: Analyzing trace with hash 131997462, now seen corresponding path program 1 times [2018-06-25 06:57:23,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:23,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:23,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:23,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:23,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:23,622 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:23,787 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-25 06:57:23,946 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:23,946 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:57:23,946 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-25 06:57:23,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:23,988 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:23,991 INFO ]: Computing forward predicates... [2018-06-25 06:57:24,186 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:24,207 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:57:24,207 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 06:57:24,207 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:57:24,207 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:57:24,207 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:57:24,208 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 6 states. [2018-06-25 06:57:24,310 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:24,310 INFO ]: Finished difference Result 10 states and 12 transitions. [2018-06-25 06:57:24,311 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:57:24,311 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 06:57:24,311 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:24,311 INFO ]: With dead ends: 10 [2018-06-25 06:57:24,311 INFO ]: Without dead ends: 8 [2018-06-25 06:57:24,311 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:57:24,311 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:24,312 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:57:24,312 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:57:24,312 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-06-25 06:57:24,312 INFO ]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 7 [2018-06-25 06:57:24,312 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:24,312 INFO ]: Abstraction has 8 states and 10 transitions. [2018-06-25 06:57:24,312 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:57:24,312 INFO ]: Start isEmpty. Operand 8 states and 10 transitions. [2018-06-25 06:57:24,312 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:57:24,312 INFO ]: Found error trace [2018-06-25 06:57:24,312 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:57:24,312 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:24,312 INFO ]: Analyzing trace with hash 1938607205, now seen corresponding path program 1 times [2018-06-25 06:57:24,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:24,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:24,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:24,313 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:24,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:24,324 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:24,790 WARN ]: Spent 407.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 12 [2018-06-25 06:57:25,026 WARN ]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 06:57:25,178 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:25,179 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:57:25,179 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:57:25,195 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:25,244 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:25,247 INFO ]: Computing forward predicates... [2018-06-25 06:57:25,476 WARN ]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-25 06:57:25,667 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:25,687 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:57:25,687 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 06:57:25,687 INFO ]: Interpolant automaton has 7 states [2018-06-25 06:57:25,687 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 06:57:25,687 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:57:25,687 INFO ]: Start difference. First operand 8 states and 10 transitions. Second operand 7 states. [2018-06-25 06:57:25,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:25,738 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-25 06:57:25,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 06:57:25,738 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 06:57:25,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:25,738 INFO ]: With dead ends: 4 [2018-06-25 06:57:25,738 INFO ]: Without dead ends: 0 [2018-06-25 06:57:25,738 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-25 06:57:25,738 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 06:57:25,738 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 06:57:25,738 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 06:57:25,739 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 06:57:25,739 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 06:57:25,739 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:25,739 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 06:57:25,739 INFO ]: Interpolant automaton has 7 states. [2018-06-25 06:57:25,739 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 06:57:25,739 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 06:57:25,741 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 06:57:25,742 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:57:25 BasicIcfg [2018-06-25 06:57:25,742 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 06:57:25,743 INFO ]: Toolchain (without parser) took 41234.99 ms. Allocated memory was 290.5 MB in the beginning and 1.1 GB in the end (delta: 759.7 MB). Free memory was 243.5 MB in the beginning and 446.2 MB in the end (delta: -202.8 MB). Peak memory consumption was 556.9 MB. Max. memory is 3.6 GB. [2018-06-25 06:57:25,743 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 290.5 MB. Free memory is still 256.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:57:25,744 INFO ]: ChcToBoogie took 77.01 ms. Allocated memory is still 290.5 MB. Free memory was 243.5 MB in the beginning and 240.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:57:25,744 INFO ]: Boogie Preprocessor took 43.70 ms. Allocated memory is still 290.5 MB. Free memory was 240.5 MB in the beginning and 239.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:57:25,745 INFO ]: RCFGBuilder took 379.79 ms. Allocated memory is still 290.5 MB. Free memory was 239.5 MB in the beginning and 225.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 3.6 GB. [2018-06-25 06:57:25,745 INFO ]: BlockEncodingV2 took 18758.81 ms. Allocated memory was 290.5 MB in the beginning and 676.9 MB in the end (delta: 386.4 MB). Free memory was 225.9 MB in the beginning and 160.2 MB in the end (delta: 65.7 MB). Peak memory consumption was 485.6 MB. Max. memory is 3.6 GB. [2018-06-25 06:57:25,746 INFO ]: TraceAbstraction took 21967.08 ms. Allocated memory was 676.9 MB in the beginning and 1.1 GB in the end (delta: 373.3 MB). Free memory was 160.2 MB in the beginning and 446.2 MB in the end (delta: -286.1 MB). Peak memory consumption was 87.2 MB. Max. memory is 3.6 GB. [2018-06-25 06:57:25,749 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, 2055 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 290.5 MB. Free memory is still 256.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 77.01 ms. Allocated memory is still 290.5 MB. Free memory was 243.5 MB in the beginning and 240.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.70 ms. Allocated memory is still 290.5 MB. Free memory was 240.5 MB in the beginning and 239.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 379.79 ms. Allocated memory is still 290.5 MB. Free memory was 239.5 MB in the beginning and 225.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 18758.81 ms. Allocated memory was 290.5 MB in the beginning and 676.9 MB in the end (delta: 386.4 MB). Free memory was 225.9 MB in the beginning and 160.2 MB in the end (delta: 65.7 MB). Peak memory consumption was 485.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 21967.08 ms. Allocated memory was 676.9 MB in the beginning and 1.1 GB in the end (delta: 373.3 MB). Free memory was 160.2 MB in the beginning and 446.2 MB in the end (delta: -286.1 MB). Peak memory consumption was 87.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 20.6s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8862 SDtfs, 0 SDslu, 70 SDs, 0 SdLazy, 4928 SolverSat, 4341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=7, 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.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 1483 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1003 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 18/38 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e7_223.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_06-57-25-759.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e7_223.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_06-57-25-759.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e7_223.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_06-57-25-759.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e7_223.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_06-57-25-759.csv Received shutdown request...