java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_12.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:42:14,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:42:14,805 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:42:14,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:42:14,817 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:42:14,818 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:42:14,819 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:42:14,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:42:14,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:42:14,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:42:14,827 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:42:14,827 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:42:14,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:42:14,828 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:42:14,829 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:42:14,832 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:42:14,833 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:42:14,835 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:42:14,844 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:42:14,845 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:42:14,846 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:42:14,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:42:14,851 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:42:14,851 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:42:14,851 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:42:14,852 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:42:14,853 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:42:14,854 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:42:14,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:42:14,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:42:14,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:42:14,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:42:14,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:42:14,859 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:42:14,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:42:14,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:42:14,864 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:42:14,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:42:14,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:42:14,884 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:42:14,884 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:42:14,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:42:14,885 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:42:14,885 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:42:14,885 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:42:14,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:42:14,886 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:42:14,886 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:42:14,886 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:42:14,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:42:14,886 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:42:14,887 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:42:14,887 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:42:14,887 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:42:14,887 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:42:14,887 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:42:14,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:42:14,888 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:42:14,889 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:42:14,889 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:42:14,937 INFO ]: Repository-Root is: /tmp [2018-06-26 20:42:14,952 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:42:14,955 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:42:14,957 INFO ]: Initializing SmtParser... [2018-06-26 20:42:14,957 INFO ]: SmtParser initialized [2018-06-26 20:42:14,957 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_12.cil.smt2 [2018-06-26 20:42:14,959 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 20:42:15,050 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_12.cil.smt2 unknown [2018-06-26 20:42:15,599 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_12.cil.smt2 [2018-06-26 20:42:15,603 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:42:15,619 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:42:15,620 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:42:15,620 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:42:15,620 INFO ]: ChcToBoogie initialized [2018-06-26 20:42:15,632 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:42:15" (1/1) ... [2018-06-26 20:42:15,758 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:42:15 Unit [2018-06-26 20:42:15,758 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:42:15,758 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:42:15,758 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:42:15,758 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:42:15,783 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:42:15" (1/1) ... [2018-06-26 20:42:15,783 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:42:15" (1/1) ... [2018-06-26 20:42:15,806 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:42:15" (1/1) ... [2018-06-26 20:42:15,806 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:42:15" (1/1) ... [2018-06-26 20:42:15,819 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:42:15" (1/1) ... [2018-06-26 20:42:15,820 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:42:15" (1/1) ... [2018-06-26 20:42:15,829 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:42:15" (1/1) ... [2018-06-26 20:42:15,833 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:42:15,834 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:42:15,834 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:42:15,834 INFO ]: RCFGBuilder initialized [2018-06-26 20:42:15,835 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:42:15" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 20:42:15,862 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:42:15,862 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:42:15,862 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:42:15,862 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:42:15,862 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:42:15,862 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:42:16,305 INFO ]: Using library mode [2018-06-26 20:42:16,305 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:42:16 BoogieIcfgContainer [2018-06-26 20:42:16,305 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:42:16,306 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:42:16,306 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:42:16,307 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:42:16,310 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:42:16" (1/1) ... [2018-06-26 20:42:16,328 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:42:16,329 INFO ]: Using Remove infeasible edges [2018-06-26 20:42:16,333 INFO ]: Using Maximize final states [2018-06-26 20:42:16,334 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:42:16,334 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:42:16,336 INFO ]: Using Remove sink states [2018-06-26 20:42:16,336 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:42:16,336 INFO ]: Using Use SBE [2018-06-26 20:42:18,267 INFO ]: SBE split 1 edges [2018-06-26 20:42:18,384 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:42:18,387 INFO ]: 0 new accepting states [2018-06-26 20:42:18,450 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:42:18,452 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:42:18,659 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:42:18,660 INFO ]: 0 new accepting states [2018-06-26 20:42:18,661 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:42:18,661 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:42:18,818 INFO ]: Encoded RCFG 6 locations, 1219 edges [2018-06-26 20:42:18,818 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:42:18 BasicIcfg [2018-06-26 20:42:18,818 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:42:18,820 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:42:18,820 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:42:18,823 INFO ]: TraceAbstraction initialized [2018-06-26 20:42:18,824 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:42:15" (1/4) ... [2018-06-26 20:42:18,828 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3767d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:42:18, skipping insertion in model container [2018-06-26 20:42:18,828 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:42:15" (2/4) ... [2018-06-26 20:42:18,828 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3767d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:42:18, skipping insertion in model container [2018-06-26 20:42:18,829 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:42:16" (3/4) ... [2018-06-26 20:42:18,829 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3767d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:42:18, skipping insertion in model container [2018-06-26 20:42:18,829 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:42:18" (4/4) ... [2018-06-26 20:42:18,830 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:42:18,844 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:42:18,855 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:42:18,896 INFO ]: Using default assertion order modulation [2018-06-26 20:42:18,897 INFO ]: Interprodecural is true [2018-06-26 20:42:18,897 INFO ]: Hoare is false [2018-06-26 20:42:18,897 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:42:18,897 INFO ]: Backedges is TWOTRACK [2018-06-26 20:42:18,897 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:42:18,897 INFO ]: Difference is false [2018-06-26 20:42:18,897 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:42:18,897 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:42:18,913 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:42:18,938 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:42:18,938 INFO ]: Found error trace [2018-06-26 20:42:18,939 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:42:18,940 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:18,944 INFO ]: Analyzing trace with hash 72735490, now seen corresponding path program 1 times [2018-06-26 20:42:18,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:18,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:18,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:18,976 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:18,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:19,043 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:19,188 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:42:19,190 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:42:19,190 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:42:19,191 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:42:19,201 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:42:19,202 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:19,204 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:42:26,187 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:42:26,187 INFO ]: Finished difference Result 7 states and 1387 transitions. [2018-06-26 20:42:26,211 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:42:26,212 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:42:26,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:42:26,231 INFO ]: With dead ends: 7 [2018-06-26 20:42:26,231 INFO ]: Without dead ends: 7 [2018-06-26 20:42:26,233 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:26,257 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:42:26,286 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:42:26,287 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:42:26,289 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1387 transitions. [2018-06-26 20:42:26,290 INFO ]: Start accepts. Automaton has 7 states and 1387 transitions. Word has length 5 [2018-06-26 20:42:26,291 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:42:26,291 INFO ]: Abstraction has 7 states and 1387 transitions. [2018-06-26 20:42:26,291 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:42:26,291 INFO ]: Start isEmpty. Operand 7 states and 1387 transitions. [2018-06-26 20:42:26,291 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:42:26,291 INFO ]: Found error trace [2018-06-26 20:42:26,292 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:42:26,292 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:26,292 INFO ]: Analyzing trace with hash -2069534146, now seen corresponding path program 1 times [2018-06-26 20:42:26,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:26,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:26,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:26,293 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:26,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:26,332 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:26,380 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:42:26,380 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:42:26,380 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:42:26,382 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:42:26,382 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:42:26,382 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:26,382 INFO ]: Start difference. First operand 7 states and 1387 transitions. Second operand 3 states. [2018-06-26 20:42:30,472 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:42:30,472 INFO ]: Finished difference Result 8 states and 1389 transitions. [2018-06-26 20:42:30,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:42:30,473 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:42:30,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:42:30,474 INFO ]: With dead ends: 8 [2018-06-26 20:42:30,474 INFO ]: Without dead ends: 8 [2018-06-26 20:42:30,475 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:30,475 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 20:42:30,486 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 20:42:30,486 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 20:42:30,488 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1389 transitions. [2018-06-26 20:42:30,489 INFO ]: Start accepts. Automaton has 8 states and 1389 transitions. Word has length 6 [2018-06-26 20:42:30,489 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:42:30,489 INFO ]: Abstraction has 8 states and 1389 transitions. [2018-06-26 20:42:30,489 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:42:30,489 INFO ]: Start isEmpty. Operand 8 states and 1389 transitions. [2018-06-26 20:42:30,490 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:42:30,490 INFO ]: Found error trace [2018-06-26 20:42:30,490 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:42:30,490 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:30,490 INFO ]: Analyzing trace with hash -2064022811, now seen corresponding path program 1 times [2018-06-26 20:42:30,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:30,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:30,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:30,491 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:30,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:30,527 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:30,577 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:42:30,577 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:42:30,577 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:42:30,578 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:42:30,578 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:42:30,578 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:30,578 INFO ]: Start difference. First operand 8 states and 1389 transitions. Second operand 3 states. [2018-06-26 20:42:34,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:42:34,099 INFO ]: Finished difference Result 9 states and 1391 transitions. [2018-06-26 20:42:34,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:42:34,101 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:42:34,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:42:34,103 INFO ]: With dead ends: 9 [2018-06-26 20:42:34,103 INFO ]: Without dead ends: 9 [2018-06-26 20:42:34,103 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:34,103 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:42:34,109 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:42:34,109 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:42:34,111 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1391 transitions. [2018-06-26 20:42:34,112 INFO ]: Start accepts. Automaton has 9 states and 1391 transitions. Word has length 6 [2018-06-26 20:42:34,112 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:42:34,112 INFO ]: Abstraction has 9 states and 1391 transitions. [2018-06-26 20:42:34,112 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:42:34,112 INFO ]: Start isEmpty. Operand 9 states and 1391 transitions. [2018-06-26 20:42:34,113 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:42:34,113 INFO ]: Found error trace [2018-06-26 20:42:34,113 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:42:34,113 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:34,113 INFO ]: Analyzing trace with hash -250804764, now seen corresponding path program 1 times [2018-06-26 20:42:34,113 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:34,113 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:34,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:34,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:34,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:34,166 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:34,223 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:42:34,223 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:42:34,223 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:42:34,224 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:42:34,224 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:42:34,224 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:34,224 INFO ]: Start difference. First operand 9 states and 1391 transitions. Second operand 3 states. [2018-06-26 20:42:37,328 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:42:37,328 INFO ]: Finished difference Result 11 states and 1503 transitions. [2018-06-26 20:42:37,329 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:42:37,329 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:42:37,329 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:42:37,331 INFO ]: With dead ends: 11 [2018-06-26 20:42:37,331 INFO ]: Without dead ends: 11 [2018-06-26 20:42:37,332 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:37,332 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:42:37,338 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-26 20:42:37,338 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 20:42:37,341 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1501 transitions. [2018-06-26 20:42:37,341 INFO ]: Start accepts. Automaton has 10 states and 1501 transitions. Word has length 8 [2018-06-26 20:42:37,341 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:42:37,341 INFO ]: Abstraction has 10 states and 1501 transitions. [2018-06-26 20:42:37,341 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:42:37,341 INFO ]: Start isEmpty. Operand 10 states and 1501 transitions. [2018-06-26 20:42:37,342 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:42:37,342 INFO ]: Found error trace [2018-06-26 20:42:37,342 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:42:37,342 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:37,343 INFO ]: Analyzing trace with hash 837337044, now seen corresponding path program 1 times [2018-06-26 20:42:37,343 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:37,343 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:37,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:37,343 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:37,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:37,397 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:37,513 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:42:37,513 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:42:37,513 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:42:37,513 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:42:37,513 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:42:37,513 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:37,513 INFO ]: Start difference. First operand 10 states and 1501 transitions. Second operand 3 states. [2018-06-26 20:42:40,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:42:40,674 INFO ]: Finished difference Result 12 states and 1905 transitions. [2018-06-26 20:42:40,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:42:40,675 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:42:40,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:42:40,678 INFO ]: With dead ends: 12 [2018-06-26 20:42:40,678 INFO ]: Without dead ends: 12 [2018-06-26 20:42:40,678 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:40,678 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 20:42:40,686 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-26 20:42:40,686 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 20:42:40,689 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1903 transitions. [2018-06-26 20:42:40,690 INFO ]: Start accepts. Automaton has 11 states and 1903 transitions. Word has length 9 [2018-06-26 20:42:40,690 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:42:40,690 INFO ]: Abstraction has 11 states and 1903 transitions. [2018-06-26 20:42:40,690 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:42:40,690 INFO ]: Start isEmpty. Operand 11 states and 1903 transitions. [2018-06-26 20:42:40,691 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:42:40,691 INFO ]: Found error trace [2018-06-26 20:42:40,691 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:42:40,691 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:40,691 INFO ]: Analyzing trace with hash 1083917151, now seen corresponding path program 1 times [2018-06-26 20:42:40,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:40,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:40,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:40,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:40,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:40,739 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:40,834 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:42:40,835 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:42:40,835 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:42:40,835 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:42:40,835 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:42:40,835 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:40,835 INFO ]: Start difference. First operand 11 states and 1903 transitions. Second operand 3 states. [2018-06-26 20:42:43,851 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:42:43,851 INFO ]: Finished difference Result 13 states and 2119 transitions. [2018-06-26 20:42:43,852 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:42:43,852 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:42:43,852 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:42:43,854 INFO ]: With dead ends: 13 [2018-06-26 20:42:43,854 INFO ]: Without dead ends: 12 [2018-06-26 20:42:43,855 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:43,855 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 20:42:43,862 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 20:42:43,862 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:42:43,866 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2118 transitions. [2018-06-26 20:42:43,866 INFO ]: Start accepts. Automaton has 12 states and 2118 transitions. Word has length 9 [2018-06-26 20:42:43,866 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:42:43,866 INFO ]: Abstraction has 12 states and 2118 transitions. [2018-06-26 20:42:43,866 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:42:43,866 INFO ]: Start isEmpty. Operand 12 states and 2118 transitions. [2018-06-26 20:42:43,869 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:42:43,869 INFO ]: Found error trace [2018-06-26 20:42:43,869 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:42:43,869 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:43,869 INFO ]: Analyzing trace with hash 926647020, now seen corresponding path program 1 times [2018-06-26 20:42:43,869 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:43,869 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:43,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:43,870 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:43,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:43,905 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:43,998 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:42:43,998 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:42:43,998 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:42:43,998 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:42:43,998 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:42:43,998 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:43,999 INFO ]: Start difference. First operand 12 states and 2118 transitions. Second operand 3 states. [2018-06-26 20:42:47,344 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:42:47,344 INFO ]: Finished difference Result 17 states and 2127 transitions. [2018-06-26 20:42:47,345 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:42:47,345 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:42:47,345 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:42:47,348 INFO ]: With dead ends: 17 [2018-06-26 20:42:47,348 INFO ]: Without dead ends: 17 [2018-06-26 20:42:47,348 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:47,348 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:42:47,361 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-26 20:42:47,361 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 20:42:47,365 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2123 transitions. [2018-06-26 20:42:47,366 INFO ]: Start accepts. Automaton has 15 states and 2123 transitions. Word has length 10 [2018-06-26 20:42:47,366 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:42:47,366 INFO ]: Abstraction has 15 states and 2123 transitions. [2018-06-26 20:42:47,366 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:42:47,366 INFO ]: Start isEmpty. Operand 15 states and 2123 transitions. [2018-06-26 20:42:47,367 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:42:47,367 INFO ]: Found error trace [2018-06-26 20:42:47,367 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:42:47,367 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:47,367 INFO ]: Analyzing trace with hash 1639402565, now seen corresponding path program 1 times [2018-06-26 20:42:47,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:47,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:47,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:47,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:47,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:47,402 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:47,496 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:42:47,497 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:42:47,497 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:42:47,497 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:42:47,497 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:42:47,497 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:47,497 INFO ]: Start difference. First operand 15 states and 2123 transitions. Second operand 3 states. [2018-06-26 20:42:50,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:42:50,921 INFO ]: Finished difference Result 23 states and 2993 transitions. [2018-06-26 20:42:50,921 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:42:50,921 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:42:50,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:42:50,924 INFO ]: With dead ends: 23 [2018-06-26 20:42:50,924 INFO ]: Without dead ends: 23 [2018-06-26 20:42:50,924 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:50,924 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 20:42:50,935 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-26 20:42:50,935 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 20:42:50,937 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2986 transitions. [2018-06-26 20:42:50,937 INFO ]: Start accepts. Automaton has 19 states and 2986 transitions. Word has length 10 [2018-06-26 20:42:50,937 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:42:50,937 INFO ]: Abstraction has 19 states and 2986 transitions. [2018-06-26 20:42:50,937 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:42:50,937 INFO ]: Start isEmpty. Operand 19 states and 2986 transitions. [2018-06-26 20:42:50,940 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:42:50,940 INFO ]: Found error trace [2018-06-26 20:42:50,940 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:42:50,940 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:50,940 INFO ]: Analyzing trace with hash 607686236, now seen corresponding path program 1 times [2018-06-26 20:42:50,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:50,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:50,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:50,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:50,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:50,980 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:51,081 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:42:51,081 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:42:51,081 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:42:51,081 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:42:51,081 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:42:51,081 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:51,081 INFO ]: Start difference. First operand 19 states and 2986 transitions. Second operand 3 states. [2018-06-26 20:42:54,311 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:42:54,311 INFO ]: Finished difference Result 28 states and 4856 transitions. [2018-06-26 20:42:54,337 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:42:54,337 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:42:54,338 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:42:54,342 INFO ]: With dead ends: 28 [2018-06-26 20:42:54,342 INFO ]: Without dead ends: 28 [2018-06-26 20:42:54,342 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:54,342 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 20:42:54,357 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-26 20:42:54,357 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 20:42:54,362 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4856 transitions. [2018-06-26 20:42:54,362 INFO ]: Start accepts. Automaton has 28 states and 4856 transitions. Word has length 12 [2018-06-26 20:42:54,362 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:42:54,362 INFO ]: Abstraction has 28 states and 4856 transitions. [2018-06-26 20:42:54,362 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:42:54,362 INFO ]: Start isEmpty. Operand 28 states and 4856 transitions. [2018-06-26 20:42:54,364 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:42:54,364 INFO ]: Found error trace [2018-06-26 20:42:54,365 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:42:54,365 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:54,365 INFO ]: Analyzing trace with hash 2070065378, now seen corresponding path program 1 times [2018-06-26 20:42:54,365 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:54,365 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:54,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:54,365 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:54,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:54,405 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:54,636 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-26 20:42:54,701 INFO ]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:42:54,701 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:42:54,701 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:42:54,718 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:54,974 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:54,991 INFO ]: Computing forward predicates... [2018-06-26 20:42:55,224 INFO ]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:42:55,258 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:42:55,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:42:55,258 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:42:55,258 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:42:55,258 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:42:55,258 INFO ]: Start difference. First operand 28 states and 4856 transitions. Second operand 6 states. [2018-06-26 20:43:01,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:01,870 INFO ]: Finished difference Result 43 states and 5332 transitions. [2018-06-26 20:43:01,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 20:43:01,870 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-26 20:43:01,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:01,879 INFO ]: With dead ends: 43 [2018-06-26 20:43:01,879 INFO ]: Without dead ends: 43 [2018-06-26 20:43:01,880 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-26 20:43:01,880 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 20:43:01,900 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-06-26 20:43:01,901 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 20:43:01,906 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 5320 transitions. [2018-06-26 20:43:01,906 INFO ]: Start accepts. Automaton has 36 states and 5320 transitions. Word has length 12 [2018-06-26 20:43:01,906 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:01,906 INFO ]: Abstraction has 36 states and 5320 transitions. [2018-06-26 20:43:01,906 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:43:01,906 INFO ]: Start isEmpty. Operand 36 states and 5320 transitions. [2018-06-26 20:43:01,911 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:43:01,911 INFO ]: Found error trace [2018-06-26 20:43:01,911 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:43:01,911 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:01,911 INFO ]: Analyzing trace with hash 2014763300, now seen corresponding path program 1 times [2018-06-26 20:43:01,911 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:01,911 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:01,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:01,912 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:01,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:01,959 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:02,078 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:43:02,079 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:02,079 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:02,079 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:02,079 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:02,079 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:02,079 INFO ]: Start difference. First operand 36 states and 5320 transitions. Second operand 3 states. [2018-06-26 20:43:05,143 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:05,143 INFO ]: Finished difference Result 52 states and 6590 transitions. [2018-06-26 20:43:05,143 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:43:05,143 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:43:05,143 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:05,150 INFO ]: With dead ends: 52 [2018-06-26 20:43:05,150 INFO ]: Without dead ends: 52 [2018-06-26 20:43:05,151 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:05,151 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-26 20:43:05,167 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-06-26 20:43:05,167 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-26 20:43:05,174 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 6585 transitions. [2018-06-26 20:43:05,174 INFO ]: Start accepts. Automaton has 49 states and 6585 transitions. Word has length 12 [2018-06-26 20:43:05,174 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:05,174 INFO ]: Abstraction has 49 states and 6585 transitions. [2018-06-26 20:43:05,174 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:43:05,175 INFO ]: Start isEmpty. Operand 49 states and 6585 transitions. [2018-06-26 20:43:05,177 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:43:05,177 INFO ]: Found error trace [2018-06-26 20:43:05,177 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:43:05,177 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:05,177 INFO ]: Analyzing trace with hash -1350107403, now seen corresponding path program 1 times [2018-06-26 20:43:05,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:05,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:05,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:05,179 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:05,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:05,218 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:05,320 INFO ]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:43:05,320 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:05,320 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:05,320 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:05,320 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:05,320 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:05,320 INFO ]: Start difference. First operand 49 states and 6585 transitions. Second operand 3 states. [2018-06-26 20:43:09,182 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:09,183 INFO ]: Finished difference Result 78 states and 8737 transitions. [2018-06-26 20:43:09,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:43:09,183 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:43:09,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:09,189 INFO ]: With dead ends: 78 [2018-06-26 20:43:09,189 INFO ]: Without dead ends: 78 [2018-06-26 20:43:09,190 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:09,190 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-26 20:43:09,206 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 75. [2018-06-26 20:43:09,206 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-26 20:43:09,214 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 8732 transitions. [2018-06-26 20:43:09,214 INFO ]: Start accepts. Automaton has 75 states and 8732 transitions. Word has length 12 [2018-06-26 20:43:09,214 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:09,214 INFO ]: Abstraction has 75 states and 8732 transitions. [2018-06-26 20:43:09,214 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:43:09,214 INFO ]: Start isEmpty. Operand 75 states and 8732 transitions. [2018-06-26 20:43:09,218 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:43:09,218 INFO ]: Found error trace [2018-06-26 20:43:09,219 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:43:09,219 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:09,219 INFO ]: Analyzing trace with hash 2020415372, now seen corresponding path program 1 times [2018-06-26 20:43:09,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:09,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:09,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:09,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:09,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:09,255 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:09,354 INFO ]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 20:43:09,354 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:09,354 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:09,354 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:09,354 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:09,354 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:09,354 INFO ]: Start difference. First operand 75 states and 8732 transitions. Second operand 3 states. [2018-06-26 20:43:12,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:12,877 INFO ]: Finished difference Result 113 states and 13664 transitions. [2018-06-26 20:43:12,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:43:12,878 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:43:12,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:12,886 INFO ]: With dead ends: 113 [2018-06-26 20:43:12,886 INFO ]: Without dead ends: 113 [2018-06-26 20:43:12,887 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:12,887 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-26 20:43:12,910 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 105. [2018-06-26 20:43:12,910 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-26 20:43:12,921 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 13649 transitions. [2018-06-26 20:43:12,921 INFO ]: Start accepts. Automaton has 105 states and 13649 transitions. Word has length 12 [2018-06-26 20:43:12,921 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:12,921 INFO ]: Abstraction has 105 states and 13649 transitions. [2018-06-26 20:43:12,921 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:43:12,921 INFO ]: Start isEmpty. Operand 105 states and 13649 transitions. [2018-06-26 20:43:12,926 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:43:12,926 INFO ]: Found error trace [2018-06-26 20:43:12,926 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:43:12,926 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:12,926 INFO ]: Analyzing trace with hash -1522805830, now seen corresponding path program 1 times [2018-06-26 20:43:12,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:12,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:12,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:12,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:12,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:12,955 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:13,046 INFO ]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 20:43:13,046 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:13,046 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:13,046 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:13,046 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:13,046 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:13,046 INFO ]: Start difference. First operand 105 states and 13649 transitions. Second operand 3 states. [2018-06-26 20:43:15,988 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:15,988 INFO ]: Finished difference Result 127 states and 17194 transitions. [2018-06-26 20:43:15,988 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:43:15,988 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:43:15,988 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:16,007 INFO ]: With dead ends: 127 [2018-06-26 20:43:16,007 INFO ]: Without dead ends: 127 [2018-06-26 20:43:16,007 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:16,007 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-26 20:43:16,044 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 90. [2018-06-26 20:43:16,044 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-26 20:43:16,052 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 12957 transitions. [2018-06-26 20:43:16,052 INFO ]: Start accepts. Automaton has 90 states and 12957 transitions. Word has length 12 [2018-06-26 20:43:16,052 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:16,053 INFO ]: Abstraction has 90 states and 12957 transitions. [2018-06-26 20:43:16,053 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:43:16,053 INFO ]: Start isEmpty. Operand 90 states and 12957 transitions. [2018-06-26 20:43:16,058 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:43:16,058 INFO ]: Found error trace [2018-06-26 20:43:16,058 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:43:16,058 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:16,058 INFO ]: Analyzing trace with hash -1273455160, now seen corresponding path program 1 times [2018-06-26 20:43:16,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:16,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:16,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:16,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:16,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:16,086 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:16,179 INFO ]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 20:43:16,180 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:16,180 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:16,180 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:16,180 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:16,180 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:16,180 INFO ]: Start difference. First operand 90 states and 12957 transitions. Second operand 3 states. [2018-06-26 20:43:19,225 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:19,225 INFO ]: Finished difference Result 112 states and 16502 transitions. [2018-06-26 20:43:19,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:43:19,225 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:43:19,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:19,238 INFO ]: With dead ends: 112 [2018-06-26 20:43:19,238 INFO ]: Without dead ends: 112 [2018-06-26 20:43:19,238 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:19,239 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-26 20:43:19,273 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 90. [2018-06-26 20:43:19,273 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-26 20:43:19,284 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 12957 transitions. [2018-06-26 20:43:19,284 INFO ]: Start accepts. Automaton has 90 states and 12957 transitions. Word has length 12 [2018-06-26 20:43:19,284 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:19,284 INFO ]: Abstraction has 90 states and 12957 transitions. [2018-06-26 20:43:19,284 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:43:19,284 INFO ]: Start isEmpty. Operand 90 states and 12957 transitions. [2018-06-26 20:43:19,289 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:43:19,289 INFO ]: Found error trace [2018-06-26 20:43:19,289 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:43:19,289 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:19,289 INFO ]: Analyzing trace with hash -2147106026, now seen corresponding path program 1 times [2018-06-26 20:43:19,290 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:19,290 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:19,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:19,290 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:19,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:19,316 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:19,396 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:43:19,396 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:19,397 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:19,397 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:19,397 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:19,397 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:19,397 INFO ]: Start difference. First operand 90 states and 12957 transitions. Second operand 3 states. [2018-06-26 20:43:21,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:21,721 INFO ]: Finished difference Result 107 states and 13169 transitions. [2018-06-26 20:43:21,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:43:21,721 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:43:21,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:21,725 INFO ]: With dead ends: 107 [2018-06-26 20:43:21,725 INFO ]: Without dead ends: 101 [2018-06-26 20:43:21,726 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:21,726 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-26 20:43:21,740 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-06-26 20:43:21,740 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-26 20:43:21,744 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 13157 transitions. [2018-06-26 20:43:21,745 INFO ]: Start accepts. Automaton has 100 states and 13157 transitions. Word has length 12 [2018-06-26 20:43:21,745 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:21,745 INFO ]: Abstraction has 100 states and 13157 transitions. [2018-06-26 20:43:21,745 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:43:21,745 INFO ]: Start isEmpty. Operand 100 states and 13157 transitions. [2018-06-26 20:43:21,750 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:43:21,751 INFO ]: Found error trace [2018-06-26 20:43:21,751 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:43:21,751 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:21,751 INFO ]: Analyzing trace with hash -911759701, now seen corresponding path program 1 times [2018-06-26 20:43:21,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:21,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:21,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:21,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:21,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:21,781 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-26 20:43:21,793 FATAL]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:210) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:228) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:410) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:425) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:367) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:309) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:151) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:119) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-06-26 20:43:21,845 INFO ]: Toolchain (without parser) took 66240.68 ms. Allocated memory was 306.2 MB in the beginning and 1.2 GB in the end (delta: 932.7 MB). Free memory was 239.7 MB in the beginning and 1.1 GB in the end (delta: -890.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 3.6 GB. [2018-06-26 20:43:21,845 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.2 MB. Free memory is still 271.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:43:21,846 INFO ]: ChcToBoogie took 138.54 ms. Allocated memory is still 306.2 MB. Free memory was 238.7 MB in the beginning and 235.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:43:21,846 INFO ]: Boogie Preprocessor took 74.93 ms. Allocated memory is still 306.2 MB. Free memory was 235.7 MB in the beginning and 233.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:43:21,846 INFO ]: RCFGBuilder took 471.69 ms. Allocated memory is still 306.2 MB. Free memory was 233.7 MB in the beginning and 201.2 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 3.6 GB. [2018-06-26 20:43:21,847 INFO ]: BlockEncodingV2 took 2512.17 ms. Allocated memory was 306.2 MB in the beginning and 406.8 MB in the end (delta: 100.7 MB). Free memory was 201.2 MB in the beginning and 227.4 MB in the end (delta: -26.2 MB). Peak memory consumption was 146.4 MB. Max. memory is 3.6 GB. [2018-06-26 20:43:21,847 INFO ]: TraceAbstraction took 63021.24 ms. Allocated memory was 406.8 MB in the beginning and 1.2 GB in the end (delta: 832.0 MB). Free memory was 223.9 MB in the beginning and 1.1 GB in the end (delta: -916.6 MB). Peak memory consumption was 913.3 MB. Max. memory is 3.6 GB. [2018-06-26 20:43:21,850 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, 1219 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 306.2 MB. Free memory is still 271.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 138.54 ms. Allocated memory is still 306.2 MB. Free memory was 238.7 MB in the beginning and 235.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 74.93 ms. Allocated memory is still 306.2 MB. Free memory was 235.7 MB in the beginning and 233.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 471.69 ms. Allocated memory is still 306.2 MB. Free memory was 233.7 MB in the beginning and 201.2 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2512.17 ms. Allocated memory was 306.2 MB in the beginning and 406.8 MB in the end (delta: 100.7 MB). Free memory was 201.2 MB in the beginning and 227.4 MB in the end (delta: -26.2 MB). Peak memory consumption was 146.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 63021.24 ms. Allocated memory was 406.8 MB in the beginning and 1.2 GB in the end (delta: 832.0 MB). Free memory was 223.9 MB in the beginning and 1.1 GB in the end (delta: -916.6 MB). Peak memory consumption was 913.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_12.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-43-21-862.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_12.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-43-21-862.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_12.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-43-21-862.csv Completed graceful shutdown