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_8.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:11:46,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:11:46,890 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:11:46,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:11:46,904 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:11:46,905 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:11:46,906 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:11:46,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:11:46,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:11:46,911 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:11:46,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:11:46,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:11:46,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:11:46,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:11:46,917 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:11:46,918 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:11:46,920 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:11:46,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:11:46,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:11:46,931 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:11:46,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:11:46,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:11:46,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:11:46,937 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:11:46,938 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:11:46,939 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:11:46,939 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:11:46,943 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:11:46,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:11:46,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:11:46,945 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:11:46,945 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:11:46,949 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:11:46,950 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:11:46,951 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:11:46,951 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:11:46,976 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:11:46,980 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:11:46,981 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:11:46,981 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:11:46,982 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:11:46,982 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:11:46,982 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:11:46,982 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:11:46,983 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:11:46,983 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:11:46,983 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:11:46,983 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:11:46,983 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:11:46,983 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:11:46,984 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:11:46,985 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:11:46,985 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:11:46,986 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:11:46,986 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:11:46,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:11:46,986 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:11:46,987 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:11:46,988 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:11:47,031 INFO ]: Repository-Root is: /tmp [2018-06-25 00:11:47,048 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:11:47,054 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:11:47,056 INFO ]: Initializing SmtParser... [2018-06-25 00:11:47,056 INFO ]: SmtParser initialized [2018-06-25 00:11:47,057 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_8.cil.smt2 [2018-06-25 00:11:47,058 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 00:11:47,150 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_8.cil.smt2 unknown [2018-06-25 00:11:47,659 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_8.cil.smt2 [2018-06-25 00:11:47,663 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:11:47,668 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:11:47,669 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:11:47,669 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:11:47,669 INFO ]: ChcToBoogie initialized [2018-06-25 00:11:47,672 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:11:47" (1/1) ... [2018-06-25 00:11:47,736 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:11:47 Unit [2018-06-25 00:11:47,736 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:11:47,736 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:11:47,736 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:11:47,736 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:11:47,756 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:11:47" (1/1) ... [2018-06-25 00:11:47,757 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:11:47" (1/1) ... [2018-06-25 00:11:47,778 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:11:47" (1/1) ... [2018-06-25 00:11:47,778 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:11:47" (1/1) ... [2018-06-25 00:11:47,800 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:11:47" (1/1) ... [2018-06-25 00:11:47,804 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:11:47" (1/1) ... [2018-06-25 00:11:47,808 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:11:47" (1/1) ... [2018-06-25 00:11:47,814 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:11:47,814 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:11:47,814 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:11:47,814 INFO ]: RCFGBuilder initialized [2018-06-25 00:11:47,815 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:11:47" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:11:47,831 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:11:47,831 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:11:47,831 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:11:47,831 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:11:47,831 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:11:47,831 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 00:11:48,306 INFO ]: Using library mode [2018-06-25 00:11:48,306 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:11:48 BoogieIcfgContainer [2018-06-25 00:11:48,306 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:11:48,307 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:11:48,307 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:11:48,308 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:11:48,308 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:11:48" (1/1) ... [2018-06-25 00:11:48,325 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:11:48,326 INFO ]: Using Remove infeasible edges [2018-06-25 00:11:48,327 INFO ]: Using Maximize final states [2018-06-25 00:11:48,327 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:11:48,327 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:11:48,329 INFO ]: Using Remove sink states [2018-06-25 00:11:48,330 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:11:48,330 INFO ]: Using Use SBE [2018-06-25 00:11:49,335 WARN ]: Simplifying disjunction of 8312 conjuctions. This might take some time... [2018-06-25 00:12:29,655 INFO ]: Simplified to disjunction of 8312 conjuctions. [2018-06-25 00:12:30,724 INFO ]: SBE split 1 edges [2018-06-25 00:12:30,853 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:12:30,857 INFO ]: 0 new accepting states [2018-06-25 00:12:30,918 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:12:30,922 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:12:31,089 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:12:31,090 INFO ]: 0 new accepting states [2018-06-25 00:12:31,092 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:12:31,092 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:12:31,251 INFO ]: Encoded RCFG 6 locations, 1044 edges [2018-06-25 00:12:31,252 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:12:31 BasicIcfg [2018-06-25 00:12:31,252 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:12:31,253 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:12:31,253 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:12:31,257 INFO ]: TraceAbstraction initialized [2018-06-25 00:12:31,257 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:11:47" (1/4) ... [2018-06-25 00:12:31,259 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137becfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:12:31, skipping insertion in model container [2018-06-25 00:12:31,259 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:11:47" (2/4) ... [2018-06-25 00:12:31,259 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137becfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:12:31, skipping insertion in model container [2018-06-25 00:12:31,259 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:11:48" (3/4) ... [2018-06-25 00:12:31,259 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137becfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:12:31, skipping insertion in model container [2018-06-25 00:12:31,260 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:12:31" (4/4) ... [2018-06-25 00:12:31,261 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:12:31,269 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:12:31,276 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:12:31,331 INFO ]: Using default assertion order modulation [2018-06-25 00:12:31,331 INFO ]: Interprodecural is true [2018-06-25 00:12:31,331 INFO ]: Hoare is false [2018-06-25 00:12:31,331 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:12:31,331 INFO ]: Backedges is TWOTRACK [2018-06-25 00:12:31,331 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:12:31,331 INFO ]: Difference is false [2018-06-25 00:12:31,331 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:12:31,332 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:12:31,348 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:12:31,364 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:12:31,364 INFO ]: Found error trace [2018-06-25 00:12:31,365 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:12:31,365 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:12:31,369 INFO ]: Analyzing trace with hash 67353890, now seen corresponding path program 1 times [2018-06-25 00:12:31,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:12:31,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:12:31,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:31,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:12:31,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:31,485 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:12:31,613 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:12:31,617 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:12:31,617 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:12:31,619 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:12:31,635 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:12:31,635 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:12:31,639 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:12:38,092 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:12:38,092 INFO ]: Finished difference Result 7 states and 1221 transitions. [2018-06-25 00:12:38,092 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:12:38,093 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:12:38,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:12:38,115 INFO ]: With dead ends: 7 [2018-06-25 00:12:38,115 INFO ]: Without dead ends: 7 [2018-06-25 00:12:38,120 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 00:12:38,137 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:12:38,171 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:12:38,172 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:12:38,174 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1221 transitions. [2018-06-25 00:12:38,175 INFO ]: Start accepts. Automaton has 7 states and 1221 transitions. Word has length 5 [2018-06-25 00:12:38,176 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:12:38,176 INFO ]: Abstraction has 7 states and 1221 transitions. [2018-06-25 00:12:38,176 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:12:38,176 INFO ]: Start isEmpty. Operand 7 states and 1221 transitions. [2018-06-25 00:12:38,176 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:12:38,176 INFO ]: Found error trace [2018-06-25 00:12:38,177 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:12:38,177 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:12:38,177 INFO ]: Analyzing trace with hash 2070679476, now seen corresponding path program 1 times [2018-06-25 00:12:38,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:12:38,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:12:38,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:38,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:12:38,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:38,212 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:12:38,284 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:12:38,284 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:12:38,284 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:12:38,285 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:12:38,285 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:12:38,285 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:12:38,286 INFO ]: Start difference. First operand 7 states and 1221 transitions. Second operand 3 states. [2018-06-25 00:12:42,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:12:42,025 INFO ]: Finished difference Result 8 states and 1223 transitions. [2018-06-25 00:12:42,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:12:42,025 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:12:42,025 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:12:42,027 INFO ]: With dead ends: 8 [2018-06-25 00:12:42,027 INFO ]: Without dead ends: 8 [2018-06-25 00:12:42,027 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 00:12:42,027 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:12:42,039 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:12:42,039 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:12:42,041 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1223 transitions. [2018-06-25 00:12:42,042 INFO ]: Start accepts. Automaton has 8 states and 1223 transitions. Word has length 6 [2018-06-25 00:12:42,042 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:12:42,042 INFO ]: Abstraction has 8 states and 1223 transitions. [2018-06-25 00:12:42,042 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:12:42,042 INFO ]: Start isEmpty. Operand 8 states and 1223 transitions. [2018-06-25 00:12:42,043 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:12:42,043 INFO ]: Found error trace [2018-06-25 00:12:42,043 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:12:42,043 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:12:42,043 INFO ]: Analyzing trace with hash 2072317981, now seen corresponding path program 1 times [2018-06-25 00:12:42,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:12:42,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:12:42,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:42,044 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:12:42,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:42,087 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:12:42,127 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:12:42,127 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:12:42,127 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:12:42,127 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:12:42,127 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:12:42,127 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:12:42,127 INFO ]: Start difference. First operand 8 states and 1223 transitions. Second operand 3 states. [2018-06-25 00:12:45,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:12:45,778 INFO ]: Finished difference Result 9 states and 1225 transitions. [2018-06-25 00:12:45,781 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:12:45,781 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:12:45,781 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:12:45,783 INFO ]: With dead ends: 9 [2018-06-25 00:12:45,783 INFO ]: Without dead ends: 9 [2018-06-25 00:12:45,783 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 00:12:45,783 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:12:45,788 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:12:45,788 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:12:45,790 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1225 transitions. [2018-06-25 00:12:45,791 INFO ]: Start accepts. Automaton has 9 states and 1225 transitions. Word has length 6 [2018-06-25 00:12:45,791 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:12:45,791 INFO ]: Abstraction has 9 states and 1225 transitions. [2018-06-25 00:12:45,791 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:12:45,791 INFO ]: Start isEmpty. Operand 9 states and 1225 transitions. [2018-06-25 00:12:45,792 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:12:45,792 INFO ]: Found error trace [2018-06-25 00:12:45,792 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:12:45,792 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:12:45,792 INFO ]: Analyzing trace with hash 595496062, now seen corresponding path program 1 times [2018-06-25 00:12:45,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:12:45,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:12:45,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:45,793 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:12:45,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:45,841 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:12:45,914 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:12:45,914 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:12:45,914 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:12:45,914 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:12:45,914 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:12:45,914 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:12:45,915 INFO ]: Start difference. First operand 9 states and 1225 transitions. Second operand 3 states. [2018-06-25 00:12:49,163 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:12:49,163 INFO ]: Finished difference Result 11 states and 1348 transitions. [2018-06-25 00:12:49,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:12:49,164 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:12:49,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:12:49,166 INFO ]: With dead ends: 11 [2018-06-25 00:12:49,166 INFO ]: Without dead ends: 11 [2018-06-25 00:12:49,166 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 00:12:49,166 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:12:49,173 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 00:12:49,173 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:12:49,176 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1348 transitions. [2018-06-25 00:12:49,176 INFO ]: Start accepts. Automaton has 11 states and 1348 transitions. Word has length 8 [2018-06-25 00:12:49,176 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:12:49,176 INFO ]: Abstraction has 11 states and 1348 transitions. [2018-06-25 00:12:49,176 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:12:49,176 INFO ]: Start isEmpty. Operand 11 states and 1348 transitions. [2018-06-25 00:12:49,177 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:12:49,177 INFO ]: Found error trace [2018-06-25 00:12:49,177 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:12:49,177 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:12:49,177 INFO ]: Analyzing trace with hash 884558135, now seen corresponding path program 1 times [2018-06-25 00:12:49,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:12:49,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:12:49,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:49,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:12:49,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:49,220 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:12:49,317 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:12:49,318 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:12:49,318 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:12:49,318 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:12:49,318 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:12:49,318 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:12:49,318 INFO ]: Start difference. First operand 11 states and 1348 transitions. Second operand 3 states. [2018-06-25 00:12:52,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:12:52,347 INFO ]: Finished difference Result 13 states and 1484 transitions. [2018-06-25 00:12:52,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:12:52,349 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:12:52,349 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:12:52,351 INFO ]: With dead ends: 13 [2018-06-25 00:12:52,351 INFO ]: Without dead ends: 13 [2018-06-25 00:12:52,352 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 00:12:52,352 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:12:52,364 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-25 00:12:52,364 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:12:52,367 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1482 transitions. [2018-06-25 00:12:52,367 INFO ]: Start accepts. Automaton has 12 states and 1482 transitions. Word has length 8 [2018-06-25 00:12:52,367 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:12:52,367 INFO ]: Abstraction has 12 states and 1482 transitions. [2018-06-25 00:12:52,367 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:12:52,367 INFO ]: Start isEmpty. Operand 12 states and 1482 transitions. [2018-06-25 00:12:52,368 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:12:52,368 INFO ]: Found error trace [2018-06-25 00:12:52,368 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:12:52,368 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:12:52,368 INFO ]: Analyzing trace with hash 1520671446, now seen corresponding path program 1 times [2018-06-25 00:12:52,369 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:12:52,369 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:12:52,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:52,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:12:52,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:52,405 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:12:52,510 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:12:52,510 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:12:52,510 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:12:52,510 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:12:52,510 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:12:52,510 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:12:52,510 INFO ]: Start difference. First operand 12 states and 1482 transitions. Second operand 3 states. [2018-06-25 00:12:55,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:12:55,532 INFO ]: Finished difference Result 17 states and 2300 transitions. [2018-06-25 00:12:55,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:12:55,533 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:12:55,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:12:55,535 INFO ]: With dead ends: 17 [2018-06-25 00:12:55,535 INFO ]: Without dead ends: 17 [2018-06-25 00:12:55,535 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 00:12:55,535 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:12:55,549 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-25 00:12:55,549 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:12:55,553 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2297 transitions. [2018-06-25 00:12:55,553 INFO ]: Start accepts. Automaton has 15 states and 2297 transitions. Word has length 9 [2018-06-25 00:12:55,553 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:12:55,553 INFO ]: Abstraction has 15 states and 2297 transitions. [2018-06-25 00:12:55,553 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:12:55,553 INFO ]: Start isEmpty. Operand 15 states and 2297 transitions. [2018-06-25 00:12:55,554 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:12:55,554 INFO ]: Found error trace [2018-06-25 00:12:55,554 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:12:55,554 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:12:55,555 INFO ]: Analyzing trace with hash 1758016343, now seen corresponding path program 1 times [2018-06-25 00:12:55,555 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:12:55,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:12:55,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:55,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:12:55,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:55,594 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:12:55,688 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:12:55,689 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:12:55,689 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:12:55,689 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:12:55,689 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:12:55,689 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:12:55,689 INFO ]: Start difference. First operand 15 states and 2297 transitions. Second operand 3 states. [2018-06-25 00:12:58,368 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:12:58,369 INFO ]: Finished difference Result 18 states and 2753 transitions. [2018-06-25 00:12:58,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:12:58,370 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:12:58,370 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:12:58,374 INFO ]: With dead ends: 18 [2018-06-25 00:12:58,374 INFO ]: Without dead ends: 17 [2018-06-25 00:12:58,374 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 00:12:58,374 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:12:58,392 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 00:12:58,392 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 00:12:58,395 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2751 transitions. [2018-06-25 00:12:58,395 INFO ]: Start accepts. Automaton has 17 states and 2751 transitions. Word has length 9 [2018-06-25 00:12:58,395 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:12:58,395 INFO ]: Abstraction has 17 states and 2751 transitions. [2018-06-25 00:12:58,395 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:12:58,395 INFO ]: Start isEmpty. Operand 17 states and 2751 transitions. [2018-06-25 00:12:58,397 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:12:58,397 INFO ]: Found error trace [2018-06-25 00:12:58,397 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:12:58,397 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:12:58,397 INFO ]: Analyzing trace with hash 1529906656, now seen corresponding path program 1 times [2018-06-25 00:12:58,397 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:12:58,397 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:12:58,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:58,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:12:58,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:58,423 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:12:58,495 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:12:58,495 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:12:58,495 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:12:58,495 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:12:58,495 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:12:58,495 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:12:58,496 INFO ]: Start difference. First operand 17 states and 2751 transitions. Second operand 3 states. [2018-06-25 00:13:01,314 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:13:01,314 INFO ]: Finished difference Result 21 states and 2662 transitions. [2018-06-25 00:13:01,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:13:01,314 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:13:01,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:13:01,316 INFO ]: With dead ends: 21 [2018-06-25 00:13:01,317 INFO ]: Without dead ends: 21 [2018-06-25 00:13:01,317 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 00:13:01,317 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:13:01,328 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-25 00:13:01,328 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 00:13:01,331 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2659 transitions. [2018-06-25 00:13:01,331 INFO ]: Start accepts. Automaton has 19 states and 2659 transitions. Word has length 9 [2018-06-25 00:13:01,331 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:13:01,331 INFO ]: Abstraction has 19 states and 2659 transitions. [2018-06-25 00:13:01,331 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:13:01,331 INFO ]: Start isEmpty. Operand 19 states and 2659 transitions. [2018-06-25 00:13:01,335 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:13:01,335 INFO ]: Found error trace [2018-06-25 00:13:01,335 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:13:01,335 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:13:01,335 INFO ]: Analyzing trace with hash 1664474951, now seen corresponding path program 1 times [2018-06-25 00:13:01,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:13:01,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:13:01,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:01,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:13:01,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:01,362 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:13:01,457 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:13:01,458 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:13:01,458 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:13:01,458 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:13:01,458 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:13:01,458 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:13:01,458 INFO ]: Start difference. First operand 19 states and 2659 transitions. Second operand 3 states. Received shutdown request... [2018-06-25 00:13:02,782 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:13:02,782 WARN ]: Verification canceled [2018-06-25 00:13:02,784 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:13:02,785 WARN ]: Timeout [2018-06-25 00:13:02,785 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:13:02 BasicIcfg [2018-06-25 00:13:02,785 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:13:02,786 INFO ]: Toolchain (without parser) took 75122.22 ms. Allocated memory was 305.7 MB in the beginning and 1.1 GB in the end (delta: 830.5 MB). Free memory was 239.2 MB in the beginning and 808.0 MB in the end (delta: -568.8 MB). Peak memory consumption was 261.7 MB. Max. memory is 3.6 GB. [2018-06-25 00:13:02,787 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 305.7 MB. Free memory is still 271.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:13:02,787 INFO ]: ChcToBoogie took 67.18 ms. Allocated memory is still 305.7 MB. Free memory was 239.2 MB in the beginning and 236.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:13:02,788 INFO ]: Boogie Preprocessor took 77.66 ms. Allocated memory is still 305.7 MB. Free memory was 236.2 MB in the beginning and 233.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:13:02,788 INFO ]: RCFGBuilder took 492.14 ms. Allocated memory is still 305.7 MB. Free memory was 233.3 MB in the beginning and 200.7 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 3.6 GB. [2018-06-25 00:13:02,792 INFO ]: BlockEncodingV2 took 42945.05 ms. Allocated memory was 305.7 MB in the beginning and 398.5 MB in the end (delta: 92.8 MB). Free memory was 200.7 MB in the beginning and 264.7 MB in the end (delta: -64.0 MB). Peak memory consumption was 133.8 MB. Max. memory is 3.6 GB. [2018-06-25 00:13:02,792 INFO ]: TraceAbstraction took 31531.87 ms. Allocated memory was 398.5 MB in the beginning and 1.1 GB in the end (delta: 737.7 MB). Free memory was 261.3 MB in the beginning and 808.0 MB in the end (delta: -546.7 MB). Peak memory consumption was 191.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:13:02,795 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, 1044 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 305.7 MB. Free memory is still 271.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.18 ms. Allocated memory is still 305.7 MB. Free memory was 239.2 MB in the beginning and 236.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 77.66 ms. Allocated memory is still 305.7 MB. Free memory was 236.2 MB in the beginning and 233.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 492.14 ms. Allocated memory is still 305.7 MB. Free memory was 233.3 MB in the beginning and 200.7 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 42945.05 ms. Allocated memory was 305.7 MB in the beginning and 398.5 MB in the end (delta: 92.8 MB). Free memory was 200.7 MB in the beginning and 264.7 MB in the end (delta: -64.0 MB). Peak memory consumption was 133.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 31531.87 ms. Allocated memory was 398.5 MB in the beginning and 1.1 GB in the end (delta: 737.7 MB). Free memory was 261.3 MB in the beginning and 808.0 MB in the end (delta: -546.7 MB). Peak memory consumption was 191.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (19states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (13 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 31.4s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 30.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 42 SDtfs, 0 SDslu, 30 SDs, 0 SdLazy, 8279 SolverSat, 7425 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=8, 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 54/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_8.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-13-02-812.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_8.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-13-02-812.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_8.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-13-02-812.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_8.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-13-02-812.csv Completed graceful shutdown