java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e7_74_e7_740.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 03:46:32,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 03:46:32,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 03:46:32,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 03:46:32,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 03:46:32,176 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 03:46:32,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 03:46:32,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 03:46:32,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 03:46:32,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 03:46:32,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 03:46:32,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 03:46:32,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 03:46:32,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 03:46:32,185 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 03:46:32,189 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 03:46:32,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 03:46:32,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 03:46:32,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 03:46:32,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 03:46:32,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 03:46:32,209 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 03:46:32,209 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 03:46:32,209 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 03:46:32,210 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 03:46:32,215 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 03:46:32,216 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 03:46:32,217 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 03:46:32,218 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 03:46:32,218 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 03:46:32,218 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 03:46:32,219 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 03:46:32,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 03:46:32,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 03:46:32,227 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 03:46:32,227 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 03:46:32,242 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 03:46:32,243 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 03:46:32,243 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 03:46:32,243 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 03:46:32,244 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 03:46:32,244 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 03:46:32,244 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 03:46:32,244 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 03:46:32,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 03:46:32,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 03:46:32,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 03:46:32,245 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 03:46:32,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:46:32,250 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 03:46:32,250 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 03:46:32,250 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 03:46:32,250 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 03:46:32,250 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 03:46:32,251 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 03:46:32,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 03:46:32,251 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 03:46:32,252 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 03:46:32,253 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 03:46:32,300 INFO ]: Repository-Root is: /tmp [2018-06-25 03:46:32,311 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 03:46:32,315 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 03:46:32,319 INFO ]: Initializing SmtParser... [2018-06-25 03:46:32,320 INFO ]: SmtParser initialized [2018-06-25 03:46:32,320 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e7_74_e7_740.smt2 [2018-06-25 03:46:32,322 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 03:46:32,412 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e7_74_e7_740.smt2 unknown [2018-06-25 03:46:32,660 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e7_74_e7_740.smt2 [2018-06-25 03:46:32,667 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 03:46:32,673 INFO ]: Walking toolchain with 5 elements. [2018-06-25 03:46:32,674 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 03:46:32,674 INFO ]: Initializing ChcToBoogie... [2018-06-25 03:46:32,674 INFO ]: ChcToBoogie initialized [2018-06-25 03:46:32,677 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:46:32" (1/1) ... [2018-06-25 03:46:32,737 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:32 Unit [2018-06-25 03:46:32,737 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 03:46:32,738 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 03:46:32,738 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 03:46:32,738 INFO ]: Boogie Preprocessor initialized [2018-06-25 03:46:32,757 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:32" (1/1) ... [2018-06-25 03:46:32,758 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:32" (1/1) ... [2018-06-25 03:46:32,765 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:32" (1/1) ... [2018-06-25 03:46:32,765 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:32" (1/1) ... [2018-06-25 03:46:32,773 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:32" (1/1) ... [2018-06-25 03:46:32,775 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:32" (1/1) ... [2018-06-25 03:46:32,776 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:32" (1/1) ... [2018-06-25 03:46:32,786 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 03:46:32,786 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 03:46:32,786 INFO ]: Initializing RCFGBuilder... [2018-06-25 03:46:32,786 INFO ]: RCFGBuilder initialized [2018-06-25 03:46:32,787 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:32" (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 03:46:32,801 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 03:46:32,801 INFO ]: Found specification of procedure gotoProc [2018-06-25 03:46:32,801 INFO ]: Found implementation of procedure gotoProc [2018-06-25 03:46:32,801 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 03:46:32,801 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 03:46:32,801 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 03:46:33,095 INFO ]: Using library mode [2018-06-25 03:46:33,099 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:46:33 BoogieIcfgContainer [2018-06-25 03:46:33,099 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 03:46:33,100 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 03:46:33,100 INFO ]: Initializing BlockEncodingV2... [2018-06-25 03:46:33,101 INFO ]: BlockEncodingV2 initialized [2018-06-25 03:46:33,101 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:46:33" (1/1) ... [2018-06-25 03:46:33,118 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 03:46:33,120 INFO ]: Using Remove infeasible edges [2018-06-25 03:46:33,120 INFO ]: Using Maximize final states [2018-06-25 03:46:33,121 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 03:46:33,121 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 03:46:33,124 INFO ]: Using Remove sink states [2018-06-25 03:46:33,125 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 03:46:33,125 INFO ]: Using Use SBE [2018-06-25 03:46:33,131 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 03:46:35,166 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:46:35,167 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 03:46:36,278 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:46:36,279 INFO ]: SBE split 2 edges [2018-06-25 03:46:36,300 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 03:46:36,304 INFO ]: 0 new accepting states [2018-06-25 03:46:48,791 INFO ]: Removed 2067 edges and 2 locations by large block encoding [2018-06-25 03:46:48,793 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:46:48,808 INFO ]: Removed 13 edges and 0 locations because of local infeasibility [2018-06-25 03:46:48,809 INFO ]: 0 new accepting states [2018-06-25 03:46:48,811 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:46:48,812 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:46:48,818 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 03:46:48,819 INFO ]: 0 new accepting states [2018-06-25 03:46:48,822 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:46:48,822 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:46:48,835 INFO ]: Encoded RCFG 6 locations, 2056 edges [2018-06-25 03:46:48,836 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:46:48 BasicIcfg [2018-06-25 03:46:48,836 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 03:46:48,837 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 03:46:48,837 INFO ]: Initializing TraceAbstraction... [2018-06-25 03:46:48,840 INFO ]: TraceAbstraction initialized [2018-06-25 03:46:48,840 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:46:32" (1/4) ... [2018-06-25 03:46:48,841 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772064c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 03:46:48, skipping insertion in model container [2018-06-25 03:46:48,841 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:32" (2/4) ... [2018-06-25 03:46:48,842 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772064c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 03:46:48, skipping insertion in model container [2018-06-25 03:46:48,842 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:46:33" (3/4) ... [2018-06-25 03:46:48,842 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772064c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:46:48, skipping insertion in model container [2018-06-25 03:46:48,842 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:46:48" (4/4) ... [2018-06-25 03:46:48,843 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 03:46:48,852 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 03:46:48,860 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 03:46:48,898 INFO ]: Using default assertion order modulation [2018-06-25 03:46:48,898 INFO ]: Interprodecural is true [2018-06-25 03:46:48,898 INFO ]: Hoare is false [2018-06-25 03:46:48,898 INFO ]: Compute interpolants for FPandBP [2018-06-25 03:46:48,898 INFO ]: Backedges is TWOTRACK [2018-06-25 03:46:48,898 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 03:46:48,898 INFO ]: Difference is false [2018-06-25 03:46:48,898 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 03:46:48,898 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 03:46:48,922 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 03:46:48,943 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:46:48,943 INFO ]: Found error trace [2018-06-25 03:46:48,944 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:46:48,944 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:48,949 INFO ]: Analyzing trace with hash 161089830, now seen corresponding path program 1 times [2018-06-25 03:46:48,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:48,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:48,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:48,993 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:48,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:49,038 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:49,110 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:49,111 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:49,112 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:49,113 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:49,124 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:49,124 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:49,128 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 03:46:52,165 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:52,165 INFO ]: Finished difference Result 7 states and 2057 transitions. [2018-06-25 03:46:52,165 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:52,166 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:46:52,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:52,180 INFO ]: With dead ends: 7 [2018-06-25 03:46:52,180 INFO ]: Without dead ends: 7 [2018-06-25 03:46:52,182 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 03:46:52,197 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:52,245 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:52,246 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:52,250 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-25 03:46:52,251 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-25 03:46:52,252 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:52,252 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-25 03:46:52,252 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:52,252 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-25 03:46:52,254 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:52,254 INFO ]: Found error trace [2018-06-25 03:46:52,254 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:52,254 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:52,254 INFO ]: Analyzing trace with hash 579684345, now seen corresponding path program 1 times [2018-06-25 03:46:52,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:52,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:52,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:52,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:52,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:52,286 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:52,430 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:52,430 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:52,430 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:52,431 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:52,431 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:52,431 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:52,432 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-25 03:46:55,311 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:55,312 INFO ]: Finished difference Result 8 states and 2057 transitions. [2018-06-25 03:46:55,312 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:55,312 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:55,312 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:55,314 INFO ]: With dead ends: 8 [2018-06-25 03:46:55,314 INFO ]: Without dead ends: 7 [2018-06-25 03:46:55,315 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:55,315 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:55,322 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:55,322 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:55,326 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1545 transitions. [2018-06-25 03:46:55,326 INFO ]: Start accepts. Automaton has 7 states and 1545 transitions. Word has length 6 [2018-06-25 03:46:55,326 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:55,326 INFO ]: Abstraction has 7 states and 1545 transitions. [2018-06-25 03:46:55,326 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:55,326 INFO ]: Start isEmpty. Operand 7 states and 1545 transitions. [2018-06-25 03:46:55,327 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:55,327 INFO ]: Found error trace [2018-06-25 03:46:55,327 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:55,327 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:55,327 INFO ]: Analyzing trace with hash 580607866, now seen corresponding path program 1 times [2018-06-25 03:46:55,328 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:55,328 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:55,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:55,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:55,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:55,378 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:55,422 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:55,422 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:55,422 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:55,423 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:55,423 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:55,423 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:55,423 INFO ]: Start difference. First operand 7 states and 1545 transitions. Second operand 3 states. [2018-06-25 03:46:57,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:57,623 INFO ]: Finished difference Result 8 states and 1545 transitions. [2018-06-25 03:46:57,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:57,624 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:57,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:57,625 INFO ]: With dead ends: 8 [2018-06-25 03:46:57,625 INFO ]: Without dead ends: 7 [2018-06-25 03:46:57,625 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 03:46:57,626 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:57,634 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:57,634 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:57,636 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1033 transitions. [2018-06-25 03:46:57,636 INFO ]: Start accepts. Automaton has 7 states and 1033 transitions. Word has length 6 [2018-06-25 03:46:57,636 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:57,637 INFO ]: Abstraction has 7 states and 1033 transitions. [2018-06-25 03:46:57,637 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:57,637 INFO ]: Start isEmpty. Operand 7 states and 1033 transitions. [2018-06-25 03:46:57,637 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:57,637 INFO ]: Found error trace [2018-06-25 03:46:57,637 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:57,637 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:57,638 INFO ]: Analyzing trace with hash 582454908, now seen corresponding path program 1 times [2018-06-25 03:46:57,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:57,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:57,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:57,638 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:57,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:57,660 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:57,708 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:57,709 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:57,709 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:57,709 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:57,709 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:57,709 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:57,709 INFO ]: Start difference. First operand 7 states and 1033 transitions. Second operand 3 states. [2018-06-25 03:46:58,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:58,636 INFO ]: Finished difference Result 8 states and 1033 transitions. [2018-06-25 03:46:58,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:58,636 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:58,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:58,638 INFO ]: With dead ends: 8 [2018-06-25 03:46:58,638 INFO ]: Without dead ends: 7 [2018-06-25 03:46:58,638 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 03:46:58,638 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:58,645 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:58,645 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:58,647 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2018-06-25 03:46:58,647 INFO ]: Start accepts. Automaton has 7 states and 777 transitions. Word has length 6 [2018-06-25 03:46:58,647 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:58,647 INFO ]: Abstraction has 7 states and 777 transitions. [2018-06-25 03:46:58,647 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:58,647 INFO ]: Start isEmpty. Operand 7 states and 777 transitions. [2018-06-25 03:46:58,647 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:58,647 INFO ]: Found error trace [2018-06-25 03:46:58,647 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:58,647 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:58,648 INFO ]: Analyzing trace with hash -366001159, now seen corresponding path program 1 times [2018-06-25 03:46:58,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:58,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:58,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:58,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:58,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:58,678 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:58,724 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:58,724 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:58,725 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:58,725 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:58,725 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:58,725 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:58,725 INFO ]: Start difference. First operand 7 states and 777 transitions. Second operand 3 states. [2018-06-25 03:46:59,351 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:59,351 INFO ]: Finished difference Result 8 states and 777 transitions. [2018-06-25 03:46:59,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:59,353 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:59,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:59,354 INFO ]: With dead ends: 8 [2018-06-25 03:46:59,354 INFO ]: Without dead ends: 7 [2018-06-25 03:46:59,354 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 03:46:59,354 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:59,358 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:59,358 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:59,359 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 649 transitions. [2018-06-25 03:46:59,359 INFO ]: Start accepts. Automaton has 7 states and 649 transitions. Word has length 6 [2018-06-25 03:46:59,359 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:59,359 INFO ]: Abstraction has 7 states and 649 transitions. [2018-06-25 03:46:59,359 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:59,359 INFO ]: Start isEmpty. Operand 7 states and 649 transitions. [2018-06-25 03:46:59,360 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:59,360 INFO ]: Found error trace [2018-06-25 03:46:59,360 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:59,360 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:59,360 INFO ]: Analyzing trace with hash -365077638, now seen corresponding path program 1 times [2018-06-25 03:46:59,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:59,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:59,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:59,361 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:59,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:59,382 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:59,453 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:59,453 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:59,453 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:59,453 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:59,453 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:59,453 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:59,453 INFO ]: Start difference. First operand 7 states and 649 transitions. Second operand 3 states. [2018-06-25 03:47:00,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:00,022 INFO ]: Finished difference Result 8 states and 649 transitions. [2018-06-25 03:47:00,022 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:00,022 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:00,022 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:00,023 INFO ]: With dead ends: 8 [2018-06-25 03:47:00,023 INFO ]: Without dead ends: 7 [2018-06-25 03:47:00,023 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 03:47:00,023 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:00,026 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:00,026 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:00,027 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 457 transitions. [2018-06-25 03:47:00,027 INFO ]: Start accepts. Automaton has 7 states and 457 transitions. Word has length 6 [2018-06-25 03:47:00,027 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:00,027 INFO ]: Abstraction has 7 states and 457 transitions. [2018-06-25 03:47:00,027 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:00,027 INFO ]: Start isEmpty. Operand 7 states and 457 transitions. [2018-06-25 03:47:00,028 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:00,028 INFO ]: Found error trace [2018-06-25 03:47:00,028 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:00,028 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:00,028 INFO ]: Analyzing trace with hash -364154117, now seen corresponding path program 1 times [2018-06-25 03:47:00,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:00,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:00,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:00,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:00,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:00,051 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:00,110 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:00,110 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:00,110 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:00,110 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:00,110 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:00,110 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:00,111 INFO ]: Start difference. First operand 7 states and 457 transitions. Second operand 3 states. [2018-06-25 03:47:00,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:00,684 INFO ]: Finished difference Result 8 states and 457 transitions. [2018-06-25 03:47:00,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:00,689 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:00,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:00,689 INFO ]: With dead ends: 8 [2018-06-25 03:47:00,689 INFO ]: Without dead ends: 7 [2018-06-25 03:47:00,690 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 03:47:00,690 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:00,692 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:00,692 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:00,692 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 345 transitions. [2018-06-25 03:47:00,692 INFO ]: Start accepts. Automaton has 7 states and 345 transitions. Word has length 6 [2018-06-25 03:47:00,693 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:00,693 INFO ]: Abstraction has 7 states and 345 transitions. [2018-06-25 03:47:00,693 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:00,693 INFO ]: Start isEmpty. Operand 7 states and 345 transitions. [2018-06-25 03:47:00,693 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:00,693 INFO ]: Found error trace [2018-06-25 03:47:00,693 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:00,693 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:00,693 INFO ]: Analyzing trace with hash -838843911, now seen corresponding path program 1 times [2018-06-25 03:47:00,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:00,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:00,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:00,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:00,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:00,704 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:00,746 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:00,746 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:00,746 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:00,746 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:00,746 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:00,746 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:00,746 INFO ]: Start difference. First operand 7 states and 345 transitions. Second operand 3 states. [2018-06-25 03:47:01,014 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:01,014 INFO ]: Finished difference Result 8 states and 345 transitions. [2018-06-25 03:47:01,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:01,014 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:01,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:01,014 INFO ]: With dead ends: 8 [2018-06-25 03:47:01,014 INFO ]: Without dead ends: 7 [2018-06-25 03:47:01,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 03:47:01,015 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:01,016 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:01,016 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:01,016 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2018-06-25 03:47:01,016 INFO ]: Start accepts. Automaton has 7 states and 201 transitions. Word has length 6 [2018-06-25 03:47:01,016 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:01,016 INFO ]: Abstraction has 7 states and 201 transitions. [2018-06-25 03:47:01,016 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:01,016 INFO ]: Start isEmpty. Operand 7 states and 201 transitions. [2018-06-25 03:47:01,016 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:01,016 INFO ]: Found error trace [2018-06-25 03:47:01,016 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:01,016 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:01,017 INFO ]: Analyzing trace with hash -1074341766, now seen corresponding path program 1 times [2018-06-25 03:47:01,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:01,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:01,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:01,017 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:01,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:01,032 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:01,146 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:01,146 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:01,146 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:01,146 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:01,146 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:01,146 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:01,146 INFO ]: Start difference. First operand 7 states and 201 transitions. Second operand 3 states. [2018-06-25 03:47:01,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:01,323 INFO ]: Finished difference Result 8 states and 201 transitions. [2018-06-25 03:47:01,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:01,323 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:01,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:01,324 INFO ]: With dead ends: 8 [2018-06-25 03:47:01,324 INFO ]: Without dead ends: 7 [2018-06-25 03:47:01,324 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 03:47:01,324 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:01,325 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:01,325 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:01,325 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2018-06-25 03:47:01,325 INFO ]: Start accepts. Automaton has 7 states and 169 transitions. Word has length 6 [2018-06-25 03:47:01,326 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:01,326 INFO ]: Abstraction has 7 states and 169 transitions. [2018-06-25 03:47:01,326 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:01,326 INFO ]: Start isEmpty. Operand 7 states and 169 transitions. [2018-06-25 03:47:01,326 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:01,326 INFO ]: Found error trace [2018-06-25 03:47:01,326 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:01,326 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:01,326 INFO ]: Analyzing trace with hash 347880574, now seen corresponding path program 1 times [2018-06-25 03:47:01,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:01,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:01,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:01,327 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:01,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:01,336 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:01,441 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:01,441 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:01,441 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:01,441 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:01,441 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:01,441 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:01,441 INFO ]: Start difference. First operand 7 states and 169 transitions. Second operand 3 states. [2018-06-25 03:47:01,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:01,613 INFO ]: Finished difference Result 8 states and 169 transitions. [2018-06-25 03:47:01,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:01,613 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:01,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:01,614 INFO ]: With dead ends: 8 [2018-06-25 03:47:01,614 INFO ]: Without dead ends: 7 [2018-06-25 03:47:01,614 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 03:47:01,614 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:01,615 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:01,615 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:01,615 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-06-25 03:47:01,615 INFO ]: Start accepts. Automaton has 7 states and 105 transitions. Word has length 6 [2018-06-25 03:47:01,615 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:01,615 INFO ]: Abstraction has 7 states and 105 transitions. [2018-06-25 03:47:01,616 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:01,616 INFO ]: Start isEmpty. Operand 7 states and 105 transitions. [2018-06-25 03:47:01,616 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:01,616 INFO ]: Found error trace [2018-06-25 03:47:01,616 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:01,616 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:01,616 INFO ]: Analyzing trace with hash -1191628933, now seen corresponding path program 1 times [2018-06-25 03:47:01,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:01,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:01,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:01,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:01,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:01,624 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:01,737 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:01,738 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:01,738 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:01,738 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:01,738 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:01,738 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:01,738 INFO ]: Start difference. First operand 7 states and 105 transitions. Second operand 3 states. [2018-06-25 03:47:02,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:02,425 INFO ]: Finished difference Result 8 states and 105 transitions. [2018-06-25 03:47:02,426 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:02,426 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:02,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:02,426 INFO ]: With dead ends: 8 [2018-06-25 03:47:02,426 INFO ]: Without dead ends: 7 [2018-06-25 03:47:02,426 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:02,426 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:02,427 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:02,427 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:02,427 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2018-06-25 03:47:02,427 INFO ]: Start accepts. Automaton has 7 states and 81 transitions. Word has length 6 [2018-06-25 03:47:02,427 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:02,427 INFO ]: Abstraction has 7 states and 81 transitions. [2018-06-25 03:47:02,427 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:02,427 INFO ]: Start isEmpty. Operand 7 states and 81 transitions. [2018-06-25 03:47:02,427 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:02,427 INFO ]: Found error trace [2018-06-25 03:47:02,427 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:02,427 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:02,427 INFO ]: Analyzing trace with hash 586148992, now seen corresponding path program 1 times [2018-06-25 03:47:02,427 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:02,427 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:02,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:02,428 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:02,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:02,436 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:02,477 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:02,477 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:02,477 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:02,477 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:02,478 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:02,478 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:02,478 INFO ]: Start difference. First operand 7 states and 81 transitions. Second operand 3 states. [2018-06-25 03:47:02,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:02,540 INFO ]: Finished difference Result 8 states and 81 transitions. [2018-06-25 03:47:02,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:02,540 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:02,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:02,540 INFO ]: With dead ends: 8 [2018-06-25 03:47:02,540 INFO ]: Without dead ends: 7 [2018-06-25 03:47:02,541 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 03:47:02,541 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:02,541 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:02,541 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:02,542 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-06-25 03:47:02,542 INFO ]: Start accepts. Automaton has 7 states and 57 transitions. Word has length 6 [2018-06-25 03:47:02,542 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:02,542 INFO ]: Abstraction has 7 states and 57 transitions. [2018-06-25 03:47:02,542 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:02,542 INFO ]: Start isEmpty. Operand 7 states and 57 transitions. [2018-06-25 03:47:02,542 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:02,542 INFO ]: Found error trace [2018-06-25 03:47:02,542 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:02,542 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:02,542 INFO ]: Analyzing trace with hash -1247963714, now seen corresponding path program 1 times [2018-06-25 03:47:02,542 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:02,542 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:02,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:02,543 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:02,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:02,559 INFO ]: Conjunction of SSA is sat [2018-06-25 03:47:02,561 INFO ]: Counterexample might be feasible [2018-06-25 03:47:02,573 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 03:47:02,574 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:47:02 BasicIcfg [2018-06-25 03:47:02,574 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 03:47:02,575 INFO ]: Toolchain (without parser) took 29907.08 ms. Allocated memory was 309.3 MB in the beginning and 1.1 GB in the end (delta: 752.4 MB). Free memory was 261.8 MB in the beginning and 430.4 MB in the end (delta: -168.6 MB). Peak memory consumption was 583.8 MB. Max. memory is 3.6 GB. [2018-06-25 03:47:02,576 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:47:02,576 INFO ]: ChcToBoogie took 63.66 ms. Allocated memory is still 309.3 MB. Free memory was 261.8 MB in the beginning and 258.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:47:02,577 INFO ]: Boogie Preprocessor took 48.24 ms. Allocated memory is still 309.3 MB. Free memory was 258.8 MB in the beginning and 257.8 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:47:02,577 INFO ]: RCFGBuilder took 313.00 ms. Allocated memory is still 309.3 MB. Free memory was 257.8 MB in the beginning and 243.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:47:02,578 INFO ]: BlockEncodingV2 took 15736.48 ms. Allocated memory was 309.3 MB in the beginning and 717.8 MB in the end (delta: 408.4 MB). Free memory was 243.8 MB in the beginning and 319.3 MB in the end (delta: -75.6 MB). Peak memory consumption was 394.2 MB. Max. memory is 3.6 GB. [2018-06-25 03:47:02,578 INFO ]: TraceAbstraction took 13737.30 ms. Allocated memory was 717.8 MB in the beginning and 1.1 GB in the end (delta: 343.9 MB). Free memory was 319.3 MB in the beginning and 430.4 MB in the end (delta: -111.0 MB). Peak memory consumption was 232.9 MB. Max. memory is 3.6 GB. [2018-06-25 03:47:02,582 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, 2056 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.66 ms. Allocated memory is still 309.3 MB. Free memory was 261.8 MB in the beginning and 258.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.24 ms. Allocated memory is still 309.3 MB. Free memory was 258.8 MB in the beginning and 257.8 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 313.00 ms. Allocated memory is still 309.3 MB. Free memory was 257.8 MB in the beginning and 243.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 15736.48 ms. Allocated memory was 309.3 MB in the beginning and 717.8 MB in the end (delta: 408.4 MB). Free memory was 243.8 MB in the beginning and 319.3 MB in the end (delta: -75.6 MB). Peak memory consumption was 394.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 13737.30 ms. Allocated memory was 717.8 MB in the beginning and 1.1 GB in the end (delta: 343.9 MB). Free memory was 319.3 MB in the beginning and 430.4 MB in the end (delta: -111.0 MB). Peak memory consumption was 232.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assume !hbv_False_1_Bool; [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_False_2_Int, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Bool, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Bool, hbv_False_14_Bool, hbv_False_15_Int, hbv_False_16_Bool, hbv_False_17_Bool, hbv_False_18_Bool, hbv_False_19_Bool, hbv_False_1_Bool, hbv_False_20_Bool, hbv_False_21_Bool; [L0] havoc hbv_False_5_Bool, hbv_False_17_Bool, hbv_False_4_Bool, hbv_False_8_Int, hbv_False_16_Bool, hbv_False_11_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_6_Int, hbv_False_13_Bool, hbv_False_3_Bool, hbv_False_21_Bool, hbv_False_14_Bool, hbv_False_12_Int, hbv_False_19_Bool, hbv_False_1_Bool, hbv_False_20_Bool, hbv_False_15_Int, hbv_False_2_Int, hbv_False_18_Bool, hbv_False_7_Int; [L0] assume ((((((((((((((((((((((((((((((((((((((!(((hbv_state_5_Bool && !hhv_state_17_Bool) || hhv_state_3_Bool) && ((!hhv_state_3_Bool || !hbv_state_5_Bool) || hhv_state_17_Bool)) && !((hbv_state_6_Bool || hbv_state_14_Bool) && (!hbv_state_6_Bool || !hbv_state_14_Bool))) && hhv_state_7_Int == hhv_state_10_Int) && !((hbv_state_1_Bool && !hbv_state_2_Bool) && !(hbv_state_3_Int == 0))) && hbv_state_7_Int == hhv_state_0_Int) && hhv_state_4_Int == hhv_state_7_Int) && !((hbv_state_4_Bool || hbv_state_17_Bool) && (!hbv_state_17_Bool || !hbv_state_4_Bool))) && !((!hbv_state_18_Bool || !hbv_state_4_Bool) && (hbv_state_4_Bool || hbv_state_18_Bool))) && hhv_state_6_Int == hhv_state_0_Int) && !((!hhv_state_16_Bool || !hhv_state_11_Bool) && (hhv_state_16_Bool || hhv_state_11_Bool))) && !((!(hhv_state_8_Int == hhv_state_13_Int) && !hhv_state_15_Bool) && hhv_state_14_Bool)) && hbv_state_16_Int == hbv_state_7_Int) && hhv_state_5_Int == hhv_state_4_Int) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_6_Bool || !hbv_state_5_Bool))) && !((!hhv_state_18_Bool || !hhv_state_3_Bool) && (hhv_state_3_Bool || hhv_state_18_Bool))) && !((!(hhv_state_13_Int == 0) && !hhv_state_14_Bool) && hhv_state_15_Bool)) && !((hhv_state_1_Bool || hhv_state_12_Bool) && (!hhv_state_1_Bool || !hhv_state_12_Bool))) && hhv_state_9_Int == hhv_state_8_Int) && hbv_state_15_Int == hbv_state_10_Int) && !(((hhv_state_20_Bool || !(0 <= hhv_state_10_Int)) && hbv_state_4_Bool) && (0 <= hhv_state_10_Int || !hhv_state_20_Bool))) && !((!(hbv_state_11_Int == hbv_state_9_Int) && !hbv_state_1_Bool) && !hbv_state_2_Bool)) && hbv_state_19_Int == hbv_state_9_Int) && !(!(hbv_state_15_Int == 1) && (hbv_state_1_Bool || !hbv_state_2_Bool))) && !(((!(hhv_state_10_Int <= 0) || hhv_state_19_Bool) && hbv_state_6_Bool) && (hhv_state_10_Int <= 0 || !hhv_state_19_Bool))) && hbv_state_7_Int == hbv_state_8_Int) && !(!(hhv_state_13_Int == 2) && (!hhv_state_15_Bool || hhv_state_14_Bool))) && !(!(hhv_state_8_Int == 1) && (!hhv_state_14_Bool || hhv_state_15_Bool))) && !((!hhv_state_12_Bool || !hhv_state_17_Bool) && (hhv_state_17_Bool || hhv_state_12_Bool))) && !(((hhv_state_19_Bool || 10 <= hhv_state_10_Int) && !hbv_state_6_Bool) && (!hhv_state_19_Bool || !(10 <= hhv_state_10_Int)))) && !((hbv_state_2_Bool || !hbv_state_1_Bool) && !(hbv_state_3_Int == 2))) && !((!hbv_state_12_Bool || !hbv_state_13_Bool) && (hbv_state_12_Bool || hbv_state_13_Bool))) && !(!(hbv_state_11_Int + (-1 * hbv_state_9_Int + -1 * hbv_state_10_Int) == 0) && (hbv_state_2_Bool || hbv_state_1_Bool))) && !((hbv_state_2_Bool && !hbv_state_1_Bool) && !(hbv_state_15_Int == hbv_state_3_Int))) && !((!hhv_state_2_Bool || !hhv_state_11_Bool) && (hhv_state_11_Bool || hhv_state_2_Bool))) && !((!hhv_state_15_Bool && !(hhv_state_5_Int == hhv_state_6_Int)) && !hhv_state_14_Bool)) && !(((!(hhv_state_10_Int <= -10) || !hhv_state_20_Bool) && (hhv_state_20_Bool || hhv_state_10_Int <= -10)) && !hbv_state_4_Bool)) && hbv_state_16_Int == hbv_state_11_Int) && !((!hhv_state_19_Bool || !hhv_state_2_Bool) && (hhv_state_2_Bool || hhv_state_19_Bool))) && !((hhv_state_14_Bool || hhv_state_15_Bool) && !(hhv_state_5_Int + (-1 * hhv_state_6_Int + -1 * hhv_state_9_Int) == 0))) && !((hhv_state_20_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_20_Bool)); [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_state_19_Int, hbv_state_18_Bool, hbv_state_14_Bool, hbv_state_12_Bool, hbv_state_16_Int, hbv_state_11_Int, hbv_state_9_Int, hbv_state_7_Int, hbv_state_15_Int, hbv_state_10_Int, hbv_state_8_Int, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_3_Int, hbv_state_2_Bool, hbv_state_1_Bool, hbv_state_5_Bool, hbv_state_17_Bool, hbv_state_13_Bool, hbv_state_20_Bool, hbv_state_21_Bool; [L0] havoc hbv_state_15_Int, hbv_state_9_Int, hbv_state_10_Int, hbv_state_6_Bool, hbv_state_8_Int, hbv_state_4_Bool, hbv_state_11_Int, hbv_state_21_Bool, hbv_state_14_Bool, hbv_state_17_Bool, hbv_state_5_Bool, hbv_state_2_Bool, hbv_state_19_Int, hbv_state_20_Bool, hbv_state_7_Int, hbv_state_13_Bool, hbv_state_18_Bool, hbv_state_12_Bool, hbv_state_16_Int, hbv_state_1_Bool, hbv_state_3_Int; [L0] RET call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. UNSAFE Result, 13.6s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9463 SDtfs, 0 SDslu, 36 SDs, 0 SdLazy, 5381 SolverSat, 4039 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=1, 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, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 11/11 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e7_74_e7_740.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_03-47-02-596.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e7_74_e7_740.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_03-47-02-596.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e7_74_e7_740.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_03-47-02-596.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e7_74_e7_740.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_03-47-02-596.csv Received shutdown request...