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/ctigar/nested.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 01:13:16,198 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 01:13:16,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 01:13:16,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 01:13:16,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 01:13:16,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 01:13:16,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 01:13:16,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 01:13:16,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 01:13:16,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 01:13:16,220 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 01:13:16,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 01:13:16,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 01:13:16,222 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 01:13:16,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 01:13:16,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 01:13:16,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 01:13:16,239 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 01:13:16,242 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 01:13:16,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 01:13:16,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 01:13:16,252 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 01:13:16,252 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 01:13:16,252 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 01:13:16,253 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 01:13:16,254 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 01:13:16,255 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 01:13:16,260 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 01:13:16,261 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 01:13:16,261 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 01:13:16,261 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 01:13:16,262 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 01:13:16,262 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 01:13:16,268 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 01:13:16,269 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 01:13:16,269 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 01:13:16,296 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 01:13:16,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 01:13:16,296 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 01:13:16,297 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 01:13:16,298 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 01:13:16,299 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 01:13:16,299 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 01:13:16,300 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 01:13:16,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 01:13:16,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 01:13:16,300 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 01:13:16,300 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 01:13:16,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 01:13:16,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 01:13:16,301 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 01:13:16,301 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 01:13:16,301 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 01:13:16,301 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 01:13:16,301 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 01:13:16,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 01:13:16,302 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 01:13:16,304 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 01:13:16,304 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 01:13:16,367 INFO ]: Repository-Root is: /tmp [2018-06-25 01:13:16,386 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 01:13:16,390 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 01:13:16,392 INFO ]: Initializing SmtParser... [2018-06-25 01:13:16,392 INFO ]: SmtParser initialized [2018-06-25 01:13:16,393 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested.c.smt2 [2018-06-25 01:13:16,394 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 01:13:16,493 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested.c.smt2 unknown [2018-06-25 01:13:16,727 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested.c.smt2 [2018-06-25 01:13:16,732 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 01:13:16,737 INFO ]: Walking toolchain with 5 elements. [2018-06-25 01:13:16,738 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 01:13:16,738 INFO ]: Initializing ChcToBoogie... [2018-06-25 01:13:16,738 INFO ]: ChcToBoogie initialized [2018-06-25 01:13:16,741 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:13:16" (1/1) ... [2018-06-25 01:13:16,788 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:13:16 Unit [2018-06-25 01:13:16,788 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 01:13:16,789 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 01:13:16,789 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 01:13:16,789 INFO ]: Boogie Preprocessor initialized [2018-06-25 01:13:16,809 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:13:16" (1/1) ... [2018-06-25 01:13:16,809 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:13:16" (1/1) ... [2018-06-25 01:13:16,816 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:13:16" (1/1) ... [2018-06-25 01:13:16,816 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:13:16" (1/1) ... [2018-06-25 01:13:16,830 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:13:16" (1/1) ... [2018-06-25 01:13:16,832 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:13:16" (1/1) ... [2018-06-25 01:13:16,833 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:13:16" (1/1) ... [2018-06-25 01:13:16,834 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 01:13:16,835 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 01:13:16,835 INFO ]: Initializing RCFGBuilder... [2018-06-25 01:13:16,835 INFO ]: RCFGBuilder initialized [2018-06-25 01:13:16,836 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:13:16" (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 01:13:16,860 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 01:13:16,860 INFO ]: Found specification of procedure gotoProc [2018-06-25 01:13:16,860 INFO ]: Found implementation of procedure gotoProc [2018-06-25 01:13:16,860 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 01:13:16,860 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 01:13:16,860 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 01:13:17,107 INFO ]: Using library mode [2018-06-25 01:13:17,107 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:13:17 BoogieIcfgContainer [2018-06-25 01:13:17,107 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 01:13:17,108 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 01:13:17,108 INFO ]: Initializing BlockEncodingV2... [2018-06-25 01:13:17,118 INFO ]: BlockEncodingV2 initialized [2018-06-25 01:13:17,119 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:13:17" (1/1) ... [2018-06-25 01:13:17,144 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 01:13:17,145 INFO ]: Using Remove infeasible edges [2018-06-25 01:13:17,146 INFO ]: Using Maximize final states [2018-06-25 01:13:17,146 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 01:13:17,146 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 01:13:17,148 INFO ]: Using Remove sink states [2018-06-25 01:13:17,148 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 01:13:17,149 INFO ]: Using Use SBE [2018-06-25 01:13:17,160 WARN ]: expecting exponential blowup for input size 20 [2018-06-25 01:13:19,401 WARN ]: Simplifying disjunction of 144000 conjuctions. This might take some time... [2018-06-25 01:14:23,759 INFO ]: Simplified to disjunction of 2864 conjuctions. [2018-06-25 01:14:23,838 INFO ]: SBE split 1 edges [2018-06-25 01:14:23,845 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 01:14:23,847 INFO ]: 0 new accepting states [2018-06-25 01:14:23,887 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 01:14:23,889 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:14:23,892 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 01:14:23,892 INFO ]: 0 new accepting states [2018-06-25 01:14:23,892 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 01:14:23,892 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:14:23,893 INFO ]: Encoded RCFG 6 locations, 34 edges [2018-06-25 01:14:23,893 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:14:23 BasicIcfg [2018-06-25 01:14:23,893 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 01:14:23,898 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 01:14:23,898 INFO ]: Initializing TraceAbstraction... [2018-06-25 01:14:23,902 INFO ]: TraceAbstraction initialized [2018-06-25 01:14:23,903 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:13:16" (1/4) ... [2018-06-25 01:14:23,903 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1c40d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 01:14:23, skipping insertion in model container [2018-06-25 01:14:23,904 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:13:16" (2/4) ... [2018-06-25 01:14:23,904 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1c40d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 01:14:23, skipping insertion in model container [2018-06-25 01:14:23,904 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:13:17" (3/4) ... [2018-06-25 01:14:23,904 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1c40d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:14:23, skipping insertion in model container [2018-06-25 01:14:23,904 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:14:23" (4/4) ... [2018-06-25 01:14:23,906 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 01:14:23,916 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 01:14:23,925 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 01:14:23,980 INFO ]: Using default assertion order modulation [2018-06-25 01:14:23,981 INFO ]: Interprodecural is true [2018-06-25 01:14:23,981 INFO ]: Hoare is false [2018-06-25 01:14:23,981 INFO ]: Compute interpolants for FPandBP [2018-06-25 01:14:23,981 INFO ]: Backedges is TWOTRACK [2018-06-25 01:14:23,981 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 01:14:23,981 INFO ]: Difference is false [2018-06-25 01:14:23,981 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 01:14:23,981 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 01:14:23,994 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 01:14:24,008 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:14:24,008 INFO ]: Found error trace [2018-06-25 01:14:24,009 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:14:24,009 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:14:24,016 INFO ]: Analyzing trace with hash 36294370, now seen corresponding path program 1 times [2018-06-25 01:14:24,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:14:24,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:14:24,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:24,066 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:14:24,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:24,114 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:14:24,218 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:14:24,220 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:14:24,220 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:14:24,222 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:14:24,237 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:14:24,237 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:14:24,240 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 01:14:25,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:14:25,208 INFO ]: Finished difference Result 7 states and 50 transitions. [2018-06-25 01:14:25,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:14:25,209 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:14:25,210 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:14:25,218 INFO ]: With dead ends: 7 [2018-06-25 01:14:25,218 INFO ]: Without dead ends: 7 [2018-06-25 01:14:25,220 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 01:14:25,238 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 01:14:25,255 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 01:14:25,256 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:14:25,257 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-06-25 01:14:25,258 INFO ]: Start accepts. Automaton has 7 states and 50 transitions. Word has length 5 [2018-06-25 01:14:25,258 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:14:25,258 INFO ]: Abstraction has 7 states and 50 transitions. [2018-06-25 01:14:25,258 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:14:25,259 INFO ]: Start isEmpty. Operand 7 states and 50 transitions. [2018-06-25 01:14:25,259 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:14:25,259 INFO ]: Found error trace [2018-06-25 01:14:25,259 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:14:25,259 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:14:25,259 INFO ]: Analyzing trace with hash 1124500018, now seen corresponding path program 1 times [2018-06-25 01:14:25,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:14:25,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:14:25,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:25,260 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:14:25,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:25,269 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:14:25,301 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:14:25,302 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:14:25,302 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:14:25,303 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:14:25,303 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:14:25,303 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:14:25,303 INFO ]: Start difference. First operand 7 states and 50 transitions. Second operand 3 states. [2018-06-25 01:14:25,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:14:25,516 INFO ]: Finished difference Result 9 states and 86 transitions. [2018-06-25 01:14:25,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:14:25,517 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 01:14:25,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:14:25,517 INFO ]: With dead ends: 9 [2018-06-25 01:14:25,517 INFO ]: Without dead ends: 9 [2018-06-25 01:14:25,518 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 01:14:25,518 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:14:25,520 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 01:14:25,520 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:14:25,521 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2018-06-25 01:14:25,521 INFO ]: Start accepts. Automaton has 9 states and 86 transitions. Word has length 6 [2018-06-25 01:14:25,521 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:14:25,521 INFO ]: Abstraction has 9 states and 86 transitions. [2018-06-25 01:14:25,521 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:14:25,521 INFO ]: Start isEmpty. Operand 9 states and 86 transitions. [2018-06-25 01:14:25,521 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:14:25,522 INFO ]: Found error trace [2018-06-25 01:14:25,522 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:14:25,522 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:14:25,522 INFO ]: Analyzing trace with hash 1124768137, now seen corresponding path program 1 times [2018-06-25 01:14:25,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:14:25,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:14:25,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:25,523 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:14:25,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:25,530 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:14:25,590 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:14:25,590 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:14:25,590 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:14:25,590 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:14:25,590 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:14:25,590 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:14:25,590 INFO ]: Start difference. First operand 9 states and 86 transitions. Second operand 3 states. [2018-06-25 01:14:25,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:14:25,786 INFO ]: Finished difference Result 13 states and 134 transitions. [2018-06-25 01:14:25,787 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:14:25,787 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 01:14:25,787 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:14:25,788 INFO ]: With dead ends: 13 [2018-06-25 01:14:25,788 INFO ]: Without dead ends: 13 [2018-06-25 01:14:25,788 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:14:25,788 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 01:14:25,792 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-25 01:14:25,792 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 01:14:25,793 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2018-06-25 01:14:25,793 INFO ]: Start accepts. Automaton has 12 states and 125 transitions. Word has length 6 [2018-06-25 01:14:25,793 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:14:25,793 INFO ]: Abstraction has 12 states and 125 transitions. [2018-06-25 01:14:25,793 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:14:25,793 INFO ]: Start isEmpty. Operand 12 states and 125 transitions. [2018-06-25 01:14:25,793 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:14:25,793 INFO ]: Found error trace [2018-06-25 01:14:25,793 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:14:25,794 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:14:25,794 INFO ]: Analyzing trace with hash -1849865275, now seen corresponding path program 1 times [2018-06-25 01:14:25,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:14:25,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:14:25,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:25,795 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:14:25,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:25,809 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:14:25,845 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 01:14:25,845 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:14:25,845 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:14:25,845 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:14:25,845 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:14:25,845 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:14:25,845 INFO ]: Start difference. First operand 12 states and 125 transitions. Second operand 3 states. [2018-06-25 01:14:25,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:14:25,974 INFO ]: Finished difference Result 12 states and 89 transitions. [2018-06-25 01:14:25,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:14:25,975 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 01:14:25,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:14:25,975 INFO ]: With dead ends: 12 [2018-06-25 01:14:25,975 INFO ]: Without dead ends: 12 [2018-06-25 01:14:25,976 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 01:14:25,976 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 01:14:25,978 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 01:14:25,978 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 01:14:25,979 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2018-06-25 01:14:25,979 INFO ]: Start accepts. Automaton has 12 states and 89 transitions. Word has length 8 [2018-06-25 01:14:25,979 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:14:25,979 INFO ]: Abstraction has 12 states and 89 transitions. [2018-06-25 01:14:25,979 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:14:25,979 INFO ]: Start isEmpty. Operand 12 states and 89 transitions. [2018-06-25 01:14:25,979 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:14:25,979 INFO ]: Found error trace [2018-06-25 01:14:25,979 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:14:25,979 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:14:25,979 INFO ]: Analyzing trace with hash -1850610050, now seen corresponding path program 1 times [2018-06-25 01:14:25,980 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:14:25,980 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:14:25,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:25,980 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:14:25,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:25,992 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:14:26,029 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 01:14:26,029 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:14:26,029 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:14:26,029 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:14:26,029 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:14:26,029 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:14:26,029 INFO ]: Start difference. First operand 12 states and 89 transitions. Second operand 3 states. [2018-06-25 01:14:26,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:14:26,470 INFO ]: Finished difference Result 16 states and 126 transitions. [2018-06-25 01:14:26,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:14:26,471 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 01:14:26,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:14:26,472 INFO ]: With dead ends: 16 [2018-06-25 01:14:26,472 INFO ]: Without dead ends: 16 [2018-06-25 01:14:26,472 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:14:26,472 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 01:14:26,476 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-25 01:14:26,476 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 01:14:26,477 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 117 transitions. [2018-06-25 01:14:26,477 INFO ]: Start accepts. Automaton has 15 states and 117 transitions. Word has length 8 [2018-06-25 01:14:26,477 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:14:26,478 INFO ]: Abstraction has 15 states and 117 transitions. [2018-06-25 01:14:26,478 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:14:26,478 INFO ]: Start isEmpty. Operand 15 states and 117 transitions. [2018-06-25 01:14:26,478 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:14:26,478 INFO ]: Found error trace [2018-06-25 01:14:26,478 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:14:26,478 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:14:26,478 INFO ]: Analyzing trace with hash -1841553586, now seen corresponding path program 1 times [2018-06-25 01:14:26,478 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:14:26,478 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:14:26,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:26,479 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:14:26,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:26,489 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:14:26,507 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 01:14:26,507 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:14:26,507 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:14:26,507 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:14:26,507 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:14:26,507 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:14:26,508 INFO ]: Start difference. First operand 15 states and 117 transitions. Second operand 3 states. [2018-06-25 01:14:26,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:14:26,718 INFO ]: Finished difference Result 16 states and 92 transitions. [2018-06-25 01:14:26,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:14:26,719 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 01:14:26,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:14:26,719 INFO ]: With dead ends: 16 [2018-06-25 01:14:26,719 INFO ]: Without dead ends: 16 [2018-06-25 01:14:26,720 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 01:14:26,720 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 01:14:26,722 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 01:14:26,722 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 01:14:26,723 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 92 transitions. [2018-06-25 01:14:26,723 INFO ]: Start accepts. Automaton has 16 states and 92 transitions. Word has length 8 [2018-06-25 01:14:26,723 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:14:26,723 INFO ]: Abstraction has 16 states and 92 transitions. [2018-06-25 01:14:26,723 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:14:26,723 INFO ]: Start isEmpty. Operand 16 states and 92 transitions. [2018-06-25 01:14:26,724 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 01:14:26,724 INFO ]: Found error trace [2018-06-25 01:14:26,724 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:14:26,724 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:14:26,724 INFO ]: Analyzing trace with hash 132643499, now seen corresponding path program 1 times [2018-06-25 01:14:26,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:14:26,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:14:26,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:26,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:14:26,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:26,739 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:14:26,797 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 01:14:26,797 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:14:26,797 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:14:26,797 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:14:26,797 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:14:26,798 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:14:26,798 INFO ]: Start difference. First operand 16 states and 92 transitions. Second operand 3 states. [2018-06-25 01:14:26,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:14:26,895 INFO ]: Finished difference Result 16 states and 75 transitions. [2018-06-25 01:14:26,896 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:14:26,896 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 01:14:26,896 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:14:26,896 INFO ]: With dead ends: 16 [2018-06-25 01:14:26,896 INFO ]: Without dead ends: 16 [2018-06-25 01:14:26,896 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 01:14:26,896 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 01:14:26,899 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 01:14:26,899 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 01:14:26,899 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2018-06-25 01:14:26,899 INFO ]: Start accepts. Automaton has 16 states and 75 transitions. Word has length 10 [2018-06-25 01:14:26,899 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:14:26,899 INFO ]: Abstraction has 16 states and 75 transitions. [2018-06-25 01:14:26,899 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:14:26,900 INFO ]: Start isEmpty. Operand 16 states and 75 transitions. [2018-06-25 01:14:26,900 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 01:14:26,900 INFO ]: Found error trace [2018-06-25 01:14:26,900 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:14:26,900 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:14:26,900 INFO ]: Analyzing trace with hash -184655746, now seen corresponding path program 1 times [2018-06-25 01:14:26,900 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:14:26,900 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:14:26,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:26,901 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:14:26,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:26,911 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:14:26,931 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 01:14:26,931 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:14:26,931 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:14:26,932 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:14:26,932 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:14:26,932 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:14:26,932 INFO ]: Start difference. First operand 16 states and 75 transitions. Second operand 3 states. [2018-06-25 01:14:27,012 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:14:27,012 INFO ]: Finished difference Result 27 states and 131 transitions. [2018-06-25 01:14:27,013 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:14:27,013 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 01:14:27,013 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:14:27,013 INFO ]: With dead ends: 27 [2018-06-25 01:14:27,013 INFO ]: Without dead ends: 27 [2018-06-25 01:14:27,014 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 01:14:27,014 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 01:14:27,017 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-06-25 01:14:27,017 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 01:14:27,018 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 114 transitions. [2018-06-25 01:14:27,018 INFO ]: Start accepts. Automaton has 24 states and 114 transitions. Word has length 10 [2018-06-25 01:14:27,018 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:14:27,018 INFO ]: Abstraction has 24 states and 114 transitions. [2018-06-25 01:14:27,018 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:14:27,018 INFO ]: Start isEmpty. Operand 24 states and 114 transitions. [2018-06-25 01:14:27,019 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 01:14:27,019 INFO ]: Found error trace [2018-06-25 01:14:27,019 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:14:27,019 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:14:27,019 INFO ]: Analyzing trace with hash 529850171, now seen corresponding path program 1 times [2018-06-25 01:14:27,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:14:27,019 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:14:27,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:27,020 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:14:27,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:27,032 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:14:27,058 INFO ]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 01:14:27,058 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:14:27,058 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:14:27,058 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:14:27,058 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:14:27,058 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:14:27,058 INFO ]: Start difference. First operand 24 states and 114 transitions. Second operand 3 states. [2018-06-25 01:14:27,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:14:27,126 INFO ]: Finished difference Result 19 states and 67 transitions. [2018-06-25 01:14:27,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:14:27,126 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 01:14:27,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:14:27,127 INFO ]: With dead ends: 19 [2018-06-25 01:14:27,127 INFO ]: Without dead ends: 16 [2018-06-25 01:14:27,127 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 01:14:27,127 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 01:14:27,128 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 01:14:27,129 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 01:14:27,129 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-25 01:14:27,129 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2018-06-25 01:14:27,129 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:14:27,129 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-25 01:14:27,129 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:14:27,129 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-25 01:14:27,130 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 01:14:27,130 INFO ]: Found error trace [2018-06-25 01:14:27,130 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:14:27,130 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:14:27,130 INFO ]: Analyzing trace with hash -1922387600, now seen corresponding path program 1 times [2018-06-25 01:14:27,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:14:27,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:14:27,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:27,131 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:14:27,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:14:27,146 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:14:27,205 INFO ]: Checked inductivity of 36 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 01:14:27,205 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:14:27,205 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:14:27,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:14:27,272 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:14:27,281 INFO ]: Computing forward predicates... [2018-06-25 01:14:27,311 INFO ]: Checked inductivity of 36 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 01:14:27,343 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 01:14:27,343 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2018-06-25 01:14:27,343 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:14:27,344 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:14:27,344 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:14:27,344 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2018-06-25 01:14:28,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:14:28,199 INFO ]: Finished difference Result 13 states and 15 transitions. [2018-06-25 01:14:28,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 01:14:28,200 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-25 01:14:28,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:14:28,200 INFO ]: With dead ends: 13 [2018-06-25 01:14:28,200 INFO ]: Without dead ends: 0 [2018-06-25 01:14:28,200 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 01:14:28,200 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 01:14:28,200 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 01:14:28,200 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 01:14:28,201 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 01:14:28,201 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-06-25 01:14:28,201 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:14:28,201 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 01:14:28,201 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:14:28,201 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 01:14:28,201 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 01:14:28,203 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 01:14:28,204 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:14:28 BasicIcfg [2018-06-25 01:14:28,204 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 01:14:28,205 INFO ]: Toolchain (without parser) took 71473.01 ms. Allocated memory was 308.3 MB in the beginning and 877.7 MB in the end (delta: 569.4 MB). Free memory was 262.7 MB in the beginning and 698.8 MB in the end (delta: -436.1 MB). Peak memory consumption was 133.3 MB. Max. memory is 3.6 GB. [2018-06-25 01:14:28,207 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 01:14:28,207 INFO ]: ChcToBoogie took 50.52 ms. Allocated memory is still 308.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:14:28,207 INFO ]: Boogie Preprocessor took 45.59 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 258.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:14:28,208 INFO ]: RCFGBuilder took 272.48 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 248.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:14:28,208 INFO ]: BlockEncodingV2 took 66785.43 ms. Allocated memory was 308.3 MB in the beginning and 814.2 MB in the end (delta: 505.9 MB). Free memory was 248.7 MB in the beginning and 479.2 MB in the end (delta: -230.5 MB). Peak memory consumption was 354.8 MB. Max. memory is 3.6 GB. [2018-06-25 01:14:28,209 INFO ]: TraceAbstraction took 4306.77 ms. Allocated memory was 814.2 MB in the beginning and 877.7 MB in the end (delta: 63.4 MB). Free memory was 479.2 MB in the beginning and 698.8 MB in the end (delta: -219.5 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 01:14:28,213 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, 34 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 50.52 ms. Allocated memory is still 308.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.59 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 258.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 272.48 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 248.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 66785.43 ms. Allocated memory was 308.3 MB in the beginning and 814.2 MB in the end (delta: 505.9 MB). Free memory was 248.7 MB in the beginning and 479.2 MB in the end (delta: -230.5 MB). Peak memory consumption was 354.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4306.77 ms. Allocated memory was 814.2 MB in the beginning and 877.7 MB in the end (delta: 63.4 MB). Free memory was 479.2 MB in the beginning and 698.8 MB in the end (delta: -219.5 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 4.2s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 44 SDtfs, 3 SDslu, 30 SDs, 0 SdLazy, 488 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 1291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 133/143 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_01-14-28-224.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_01-14-28-224.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_01-14-28-224.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_01-14-28-224.csv Received shutdown request...