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/conc/lamport_safe.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:13:27,989 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:13:27,991 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:13:28,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:13:28,003 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:13:28,004 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:13:28,005 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:13:28,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:13:28,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:13:28,009 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:13:28,009 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:13:28,010 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:13:28,010 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:13:28,012 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:13:28,014 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:13:28,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:13:28,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:13:28,017 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:13:28,019 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:13:28,020 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:13:28,021 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:13:28,022 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:13:28,025 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:13:28,025 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:13:28,025 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:13:28,026 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:13:28,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:13:28,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:13:28,028 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:13:28,029 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:13:28,030 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:13:28,030 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:13:28,031 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:13:28,031 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:13:28,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:13:28,032 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:13:28,033 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 21:13:28,051 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:13:28,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:13:28,052 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:13:28,052 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:13:28,053 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:13:28,054 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:13:28,054 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:13:28,054 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:13:28,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:13:28,055 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:13:28,055 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:13:28,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:13:28,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:13:28,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:13:28,056 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:13:28,056 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:13:28,056 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:13:28,056 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:13:28,056 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:13:28,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:13:28,057 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:13:28,059 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:13:28,059 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:13:28,108 INFO ]: Repository-Root is: /tmp [2018-06-26 21:13:28,119 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:13:28,126 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:13:28,128 INFO ]: Initializing SmtParser... [2018-06-26 21:13:28,128 INFO ]: SmtParser initialized [2018-06-26 21:13:28,129 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/conc/lamport_safe.smt2 [2018-06-26 21:13:28,130 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 21:13:28,225 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/conc/lamport_safe.smt2 unknown [2018-06-26 21:13:28,556 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/conc/lamport_safe.smt2 [2018-06-26 21:13:28,561 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:13:28,567 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:13:28,567 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:13:28,567 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:13:28,567 INFO ]: ChcToBoogie initialized [2018-06-26 21:13:28,570 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:13:28" (1/1) ... [2018-06-26 21:13:28,631 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:13:28 Unit [2018-06-26 21:13:28,632 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:13:28,632 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:13:28,632 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:13:28,632 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:13:28,653 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:13:28" (1/1) ... [2018-06-26 21:13:28,654 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:13:28" (1/1) ... [2018-06-26 21:13:28,661 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:13:28" (1/1) ... [2018-06-26 21:13:28,661 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:13:28" (1/1) ... [2018-06-26 21:13:28,673 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:13:28" (1/1) ... [2018-06-26 21:13:28,682 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:13:28" (1/1) ... [2018-06-26 21:13:28,684 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:13:28" (1/1) ... [2018-06-26 21:13:28,686 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:13:28,687 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:13:28,687 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:13:28,687 INFO ]: RCFGBuilder initialized [2018-06-26 21:13:28,687 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:13:28" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 21:13:28,711 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:13:28,712 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:13:28,712 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:13:28,712 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:13:28,712 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:13:28,712 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:13:29,016 INFO ]: Using library mode [2018-06-26 21:13:29,016 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:13:29 BoogieIcfgContainer [2018-06-26 21:13:29,016 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:13:29,020 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:13:29,020 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:13:29,021 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:13:29,021 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:13:29" (1/1) ... [2018-06-26 21:13:29,037 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:13:29,038 INFO ]: Using Remove infeasible edges [2018-06-26 21:13:29,038 INFO ]: Using Maximize final states [2018-06-26 21:13:29,039 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:13:29,039 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:13:29,043 INFO ]: Using Remove sink states [2018-06-26 21:13:29,043 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:13:29,043 INFO ]: Using Use SBE [2018-06-26 21:13:29,049 WARN ]: expecting exponential blowup for input size 10 [2018-06-26 21:13:29,165 WARN ]: aborting because of expected exponential blowup for input size 56 [2018-06-26 21:13:29,192 WARN ]: aborting because of expected exponential blowup for input size 56 [2018-06-26 21:13:29,192 INFO ]: SBE split 1 edges [2018-06-26 21:13:29,199 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:13:29,201 INFO ]: 0 new accepting states [2018-06-26 21:13:30,254 INFO ]: Removed 67 edges and 2 locations by large block encoding [2018-06-26 21:13:30,256 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:13:30,257 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:13:30,257 INFO ]: 0 new accepting states [2018-06-26 21:13:30,257 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:13:30,258 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:13:30,258 INFO ]: Encoded RCFG 6 locations, 69 edges [2018-06-26 21:13:30,258 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:13:30 BasicIcfg [2018-06-26 21:13:30,258 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:13:30,259 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:13:30,259 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:13:30,262 INFO ]: TraceAbstraction initialized [2018-06-26 21:13:30,262 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:13:28" (1/4) ... [2018-06-26 21:13:30,263 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5460eeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:13:30, skipping insertion in model container [2018-06-26 21:13:30,263 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:13:28" (2/4) ... [2018-06-26 21:13:30,263 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5460eeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:13:30, skipping insertion in model container [2018-06-26 21:13:30,263 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:13:29" (3/4) ... [2018-06-26 21:13:30,263 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5460eeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:13:30, skipping insertion in model container [2018-06-26 21:13:30,263 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:13:30" (4/4) ... [2018-06-26 21:13:30,265 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:13:30,273 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:13:30,278 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:13:30,315 INFO ]: Using default assertion order modulation [2018-06-26 21:13:30,316 INFO ]: Interprodecural is true [2018-06-26 21:13:30,316 INFO ]: Hoare is false [2018-06-26 21:13:30,316 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:13:30,316 INFO ]: Backedges is TWOTRACK [2018-06-26 21:13:30,316 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:13:30,316 INFO ]: Difference is false [2018-06-26 21:13:30,316 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:13:30,316 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:13:30,329 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:13:30,341 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:13:30,341 INFO ]: Found error trace [2018-06-26 21:13:30,342 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:13:30,342 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:30,347 INFO ]: Analyzing trace with hash 39039947, now seen corresponding path program 1 times [2018-06-26 21:13:30,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:30,349 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:30,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:30,380 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:30,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:30,418 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:30,515 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:30,517 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:13:30,517 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:13:30,518 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:13:30,528 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:13:30,528 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:13:30,530 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:13:31,172 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:31,172 INFO ]: Finished difference Result 7 states and 70 transitions. [2018-06-26 21:13:31,173 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:13:31,174 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:13:31,174 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:31,184 INFO ]: With dead ends: 7 [2018-06-26 21:13:31,184 INFO ]: Without dead ends: 7 [2018-06-26 21:13:31,186 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:13:31,203 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:13:31,219 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:13:31,221 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:13:31,222 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-06-26 21:13:31,225 INFO ]: Start accepts. Automaton has 7 states and 70 transitions. Word has length 5 [2018-06-26 21:13:31,226 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:31,226 INFO ]: Abstraction has 7 states and 70 transitions. [2018-06-26 21:13:31,226 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:13:31,226 INFO ]: Start isEmpty. Operand 7 states and 70 transitions. [2018-06-26 21:13:31,226 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:13:31,226 INFO ]: Found error trace [2018-06-26 21:13:31,226 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:13:31,226 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:31,227 INFO ]: Analyzing trace with hash 39069738, now seen corresponding path program 1 times [2018-06-26 21:13:31,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:31,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:31,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:31,227 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:31,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:31,243 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:31,301 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:31,301 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:13:31,301 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:13:31,302 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:13:31,302 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:13:31,302 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:13:31,302 INFO ]: Start difference. First operand 7 states and 70 transitions. Second operand 3 states. [2018-06-26 21:13:31,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:31,666 INFO ]: Finished difference Result 8 states and 71 transitions. [2018-06-26 21:13:31,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:13:31,666 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:13:31,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:31,667 INFO ]: With dead ends: 8 [2018-06-26 21:13:31,667 INFO ]: Without dead ends: 8 [2018-06-26 21:13:31,668 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:13:31,668 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 21:13:31,670 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-26 21:13:31,670 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:13:31,671 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-06-26 21:13:31,671 INFO ]: Start accepts. Automaton has 7 states and 70 transitions. Word has length 5 [2018-06-26 21:13:31,671 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:31,671 INFO ]: Abstraction has 7 states and 70 transitions. [2018-06-26 21:13:31,671 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:13:31,671 INFO ]: Start isEmpty. Operand 7 states and 70 transitions. [2018-06-26 21:13:31,671 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:13:31,671 INFO ]: Found error trace [2018-06-26 21:13:31,671 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:13:31,672 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:31,672 INFO ]: Analyzing trace with hash 1206281118, now seen corresponding path program 1 times [2018-06-26 21:13:31,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:31,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:31,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:31,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:31,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:31,753 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:31,854 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:31,854 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:13:31,854 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:13:31,854 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:13:31,854 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:13:31,854 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:13:31,854 INFO ]: Start difference. First operand 7 states and 70 transitions. Second operand 3 states. [2018-06-26 21:13:32,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:32,038 INFO ]: Finished difference Result 8 states and 70 transitions. [2018-06-26 21:13:32,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:13:32,039 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:13:32,039 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:32,039 INFO ]: With dead ends: 8 [2018-06-26 21:13:32,039 INFO ]: Without dead ends: 7 [2018-06-26 21:13:32,040 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:13:32,040 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:13:32,041 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:13:32,041 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:13:32,045 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-06-26 21:13:32,045 INFO ]: Start accepts. Automaton has 7 states and 38 transitions. Word has length 6 [2018-06-26 21:13:32,045 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:32,045 INFO ]: Abstraction has 7 states and 38 transitions. [2018-06-26 21:13:32,045 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:13:32,045 INFO ]: Start isEmpty. Operand 7 states and 38 transitions. [2018-06-26 21:13:32,045 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:13:32,046 INFO ]: Found error trace [2018-06-26 21:13:32,046 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:13:32,046 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:32,046 INFO ]: Analyzing trace with hash 1207204639, now seen corresponding path program 1 times [2018-06-26 21:13:32,046 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:32,046 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:32,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:32,047 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:32,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:32,071 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:32,187 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:32,187 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:13:32,187 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:13:32,196 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:32,242 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:32,248 INFO ]: Computing forward predicates... [2018-06-26 21:13:33,056 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:33,077 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:13:33,077 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 21:13:33,077 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:13:33,077 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:13:33,077 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:13:33,078 INFO ]: Start difference. First operand 7 states and 38 transitions. Second operand 5 states. [2018-06-26 21:13:33,189 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:33,189 INFO ]: Finished difference Result 9 states and 40 transitions. [2018-06-26 21:13:33,210 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:13:33,210 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 21:13:33,210 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:33,210 INFO ]: With dead ends: 9 [2018-06-26 21:13:33,210 INFO ]: Without dead ends: 9 [2018-06-26 21:13:33,210 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:13:33,210 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:13:33,212 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-26 21:13:33,212 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:13:33,213 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2018-06-26 21:13:33,213 INFO ]: Start accepts. Automaton has 8 states and 39 transitions. Word has length 6 [2018-06-26 21:13:33,213 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:33,213 INFO ]: Abstraction has 8 states and 39 transitions. [2018-06-26 21:13:33,213 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:13:33,213 INFO ]: Start isEmpty. Operand 8 states and 39 transitions. [2018-06-26 21:13:33,213 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:13:33,213 INFO ]: Found error trace [2018-06-26 21:13:33,213 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:13:33,213 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:33,213 INFO ]: Analyzing trace with hash 1211822244, now seen corresponding path program 1 times [2018-06-26 21:13:33,213 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:33,213 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:33,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:33,214 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:33,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:33,236 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:33,293 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:33,294 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:13:33,294 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:13:33,294 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:13:33,294 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:13:33,294 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:13:33,294 INFO ]: Start difference. First operand 8 states and 39 transitions. Second operand 3 states. [2018-06-26 21:13:33,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:33,389 INFO ]: Finished difference Result 10 states and 39 transitions. [2018-06-26 21:13:33,389 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:13:33,389 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:13:33,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:33,390 INFO ]: With dead ends: 10 [2018-06-26 21:13:33,390 INFO ]: Without dead ends: 8 [2018-06-26 21:13:33,390 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:13:33,391 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 21:13:33,392 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 21:13:33,392 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:13:33,392 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-06-26 21:13:33,392 INFO ]: Start accepts. Automaton has 8 states and 31 transitions. Word has length 6 [2018-06-26 21:13:33,392 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:33,392 INFO ]: Abstraction has 8 states and 31 transitions. [2018-06-26 21:13:33,392 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:13:33,392 INFO ]: Start isEmpty. Operand 8 states and 31 transitions. [2018-06-26 21:13:33,392 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:13:33,392 INFO ]: Found error trace [2018-06-26 21:13:33,392 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:13:33,393 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:33,393 INFO ]: Analyzing trace with hash 1180422530, now seen corresponding path program 1 times [2018-06-26 21:13:33,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:33,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:33,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:33,393 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:33,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:33,408 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:33,454 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:33,454 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:13:33,454 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:13:33,460 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:33,499 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:33,501 INFO ]: Computing forward predicates... [2018-06-26 21:13:33,968 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:33,988 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:13:33,988 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 21:13:33,988 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:13:33,988 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:13:33,988 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:13:33,989 INFO ]: Start difference. First operand 8 states and 31 transitions. Second operand 4 states. [2018-06-26 21:13:34,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:34,047 INFO ]: Finished difference Result 12 states and 35 transitions. [2018-06-26 21:13:34,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:13:34,048 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 21:13:34,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:34,048 INFO ]: With dead ends: 12 [2018-06-26 21:13:34,048 INFO ]: Without dead ends: 12 [2018-06-26 21:13:34,049 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:13:34,049 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 21:13:34,050 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-06-26 21:13:34,050 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:13:34,051 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-06-26 21:13:34,051 INFO ]: Start accepts. Automaton has 8 states and 31 transitions. Word has length 6 [2018-06-26 21:13:34,051 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:34,051 INFO ]: Abstraction has 8 states and 31 transitions. [2018-06-26 21:13:34,051 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:13:34,051 INFO ]: Start isEmpty. Operand 8 states and 31 transitions. [2018-06-26 21:13:34,051 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:13:34,051 INFO ]: Found error trace [2018-06-26 21:13:34,051 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:13:34,051 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:34,051 INFO ]: Analyzing trace with hash 1189657740, now seen corresponding path program 1 times [2018-06-26 21:13:34,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:34,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:34,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:34,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:34,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:34,067 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:34,136 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:34,137 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:13:34,137 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:13:34,137 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:13:34,137 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:13:34,137 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:13:34,137 INFO ]: Start difference. First operand 8 states and 31 transitions. Second operand 3 states. [2018-06-26 21:13:34,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:34,171 INFO ]: Finished difference Result 10 states and 31 transitions. [2018-06-26 21:13:34,171 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:13:34,171 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:13:34,171 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:34,172 INFO ]: With dead ends: 10 [2018-06-26 21:13:34,172 INFO ]: Without dead ends: 8 [2018-06-26 21:13:34,172 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:13:34,172 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 21:13:34,173 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 21:13:34,173 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:13:34,173 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-06-26 21:13:34,173 INFO ]: Start accepts. Automaton has 8 states and 27 transitions. Word has length 6 [2018-06-26 21:13:34,174 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:34,174 INFO ]: Abstraction has 8 states and 27 transitions. [2018-06-26 21:13:34,174 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:13:34,174 INFO ]: Start isEmpty. Operand 8 states and 27 transitions. [2018-06-26 21:13:34,174 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:13:34,174 INFO ]: Found error trace [2018-06-26 21:13:34,174 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:13:34,174 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:34,174 INFO ]: Analyzing trace with hash 1162875631, now seen corresponding path program 1 times [2018-06-26 21:13:34,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:34,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:34,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:34,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:34,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:34,196 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:34,243 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:34,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:13:34,243 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:13:34,251 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:34,287 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:34,289 INFO ]: Computing forward predicates... [2018-06-26 21:13:35,103 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:35,125 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:13:35,125 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 21:13:35,125 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:13:35,125 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:13:35,125 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:13:35,125 INFO ]: Start difference. First operand 8 states and 27 transitions. Second operand 4 states. [2018-06-26 21:13:35,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:35,155 INFO ]: Finished difference Result 12 states and 31 transitions. [2018-06-26 21:13:35,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:13:35,155 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 21:13:35,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:35,155 INFO ]: With dead ends: 12 [2018-06-26 21:13:35,156 INFO ]: Without dead ends: 12 [2018-06-26 21:13:35,156 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:13:35,156 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 21:13:35,157 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-06-26 21:13:35,157 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:13:35,159 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-06-26 21:13:35,159 INFO ]: Start accepts. Automaton has 8 states and 27 transitions. Word has length 6 [2018-06-26 21:13:35,159 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:35,159 INFO ]: Abstraction has 8 states and 27 transitions. [2018-06-26 21:13:35,159 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:13:35,159 INFO ]: Start isEmpty. Operand 8 states and 27 transitions. [2018-06-26 21:13:35,160 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:13:35,160 INFO ]: Found error trace [2018-06-26 21:13:35,160 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:13:35,160 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:35,160 INFO ]: Analyzing trace with hash 1192428303, now seen corresponding path program 1 times [2018-06-26 21:13:35,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:35,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:35,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:35,161 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:35,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:35,173 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:35,487 WARN ]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-06-26 21:13:35,487 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:35,488 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:13:35,488 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 21:13:35,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:13:35,534 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:35,536 INFO ]: Computing forward predicates... [2018-06-26 21:13:35,718 WARN ]: expecting exponential blowup for input size 9 [2018-06-26 21:13:36,482 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:36,502 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:13:36,502 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 21:13:36,502 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:13:36,503 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:13:36,503 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:13:36,503 INFO ]: Start difference. First operand 8 states and 27 transitions. Second operand 4 states. [2018-06-26 21:13:36,586 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:36,586 INFO ]: Finished difference Result 10 states and 29 transitions. [2018-06-26 21:13:36,586 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:13:36,586 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 21:13:36,586 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:36,586 INFO ]: With dead ends: 10 [2018-06-26 21:13:36,586 INFO ]: Without dead ends: 10 [2018-06-26 21:13:36,587 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:13:36,587 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 21:13:36,588 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-26 21:13:36,588 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:13:36,588 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-06-26 21:13:36,588 INFO ]: Start accepts. Automaton has 8 states and 27 transitions. Word has length 6 [2018-06-26 21:13:36,588 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:36,588 INFO ]: Abstraction has 8 states and 27 transitions. [2018-06-26 21:13:36,588 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:13:36,588 INFO ]: Start isEmpty. Operand 8 states and 27 transitions. [2018-06-26 21:13:36,588 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:13:36,588 INFO ]: Found error trace [2018-06-26 21:13:36,589 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 21:13:36,589 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:36,589 INFO ]: Analyzing trace with hash -1235319094, now seen corresponding path program 2 times [2018-06-26 21:13:36,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:36,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:36,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:36,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:36,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:36,626 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:36,925 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:36,925 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:13:36,925 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:13:36,932 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:13:36,977 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:13:36,977 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:36,980 INFO ]: Computing forward predicates... [2018-06-26 21:13:39,636 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 21:13:39,641 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 21:13:39,650 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,680 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:13:39,681 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,689 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,691 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:13:39,698 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,700 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,702 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:13:39,710 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,713 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,715 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,717 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,720 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,722 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,725 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,727 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:13:39,734 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,737 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,740 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:13:39,752 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 21:13:39,774 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:13:39,780 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,840 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 21:13:39,846 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 21:13:39,855 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:13:39,866 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,868 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:13:39,878 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,881 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,884 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,886 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,889 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,892 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:13:39,940 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,942 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,945 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:13:39,952 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,954 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,955 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,957 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:13:39,960 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 21:13:44,377 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:44,396 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:13:44,440 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 21:13:44,441 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:13:44,441 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:13:44,441 INFO ]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:13:44,441 INFO ]: Start difference. First operand 8 states and 27 transitions. Second operand 6 states. [2018-06-26 21:13:44,489 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:44,489 INFO ]: Finished difference Result 10 states and 29 transitions. [2018-06-26 21:13:44,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:13:44,489 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 21:13:44,489 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:44,490 INFO ]: With dead ends: 10 [2018-06-26 21:13:44,490 INFO ]: Without dead ends: 10 [2018-06-26 21:13:44,490 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:13:44,490 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 21:13:44,491 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 21:13:44,491 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 21:13:44,491 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2018-06-26 21:13:44,492 INFO ]: Start accepts. Automaton has 10 states and 29 transitions. Word has length 7 [2018-06-26 21:13:44,492 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:44,492 INFO ]: Abstraction has 10 states and 29 transitions. [2018-06-26 21:13:44,492 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:13:44,492 INFO ]: Start isEmpty. Operand 10 states and 29 transitions. [2018-06-26 21:13:44,492 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 21:13:44,492 INFO ]: Found error trace [2018-06-26 21:13:44,492 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-26 21:13:44,492 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:44,492 INFO ]: Analyzing trace with hash -1857307286, now seen corresponding path program 3 times [2018-06-26 21:13:44,492 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:44,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:44,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:44,493 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:13:44,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:44,568 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:44,836 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-26 21:13:45,044 WARN ]: Spent 156.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-06-26 21:13:45,193 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:13:45,193 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:13:45,193 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 21:13:45,210 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:13:45,268 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 21:13:45,268 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:45,272 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-26 21:14:36,822 INFO ]: Timeout while computing interpolants [2018-06-26 21:14:37,022 WARN ]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:14:37,023 WARN ]: Verification canceled [2018-06-26 21:14:37,024 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:14:37,025 WARN ]: Timeout [2018-06-26 21:14:37,025 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:14:37 BasicIcfg [2018-06-26 21:14:37,025 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:14:37,026 INFO ]: Toolchain (without parser) took 68463.66 ms. Allocated memory was 305.7 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 254.1 MB in the beginning and 680.5 MB in the end (delta: -426.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 21:14:37,031 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:14:37,032 INFO ]: ChcToBoogie took 64.56 ms. Allocated memory is still 305.7 MB. Free memory was 254.1 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:14:37,032 INFO ]: Boogie Preprocessor took 53.85 ms. Allocated memory is still 305.7 MB. Free memory was 252.2 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:14:37,032 INFO ]: RCFGBuilder took 330.00 ms. Allocated memory is still 305.7 MB. Free memory was 250.1 MB in the beginning and 235.2 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:14:37,033 INFO ]: BlockEncodingV2 took 1238.64 ms. Allocated memory was 305.7 MB in the beginning and 326.6 MB in the end (delta: 21.0 MB). Free memory was 235.2 MB in the beginning and 275.3 MB in the end (delta: -40.2 MB). Peak memory consumption was 56.3 MB. Max. memory is 3.6 GB. [2018-06-26 21:14:37,033 INFO ]: TraceAbstraction took 66766.30 ms. Allocated memory was 326.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 275.3 MB in the beginning and 680.5 MB in the end (delta: -405.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 21:14:37,037 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, 69 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.56 ms. Allocated memory is still 305.7 MB. Free memory was 254.1 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 53.85 ms. Allocated memory is still 305.7 MB. Free memory was 252.2 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 330.00 ms. Allocated memory is still 305.7 MB. Free memory was 250.1 MB in the beginning and 235.2 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1238.64 ms. Allocated memory was 305.7 MB in the beginning and 326.6 MB in the end (delta: 21.0 MB). Free memory was 235.2 MB in the beginning and 275.3 MB in the end (delta: -40.2 MB). Peak memory consumption was 56.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 66766.30 ms. Allocated memory was 326.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 275.3 MB in the beginning and 680.5 MB in the end (delta: -405.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 10 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 30 quantified variables from 24 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 66.7s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 407 SDtfs, 0 SDslu, 45 SDs, 0 SdLazy, 208 SolverSat, 305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=10, 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, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 1065 SizeOfPredicates, 40 NumberOfNonLiveVariables, 821 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 3/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lamport_safe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_21-14-37-055.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lamport_safe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_21-14-37-055.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lamport_safe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_21-14-37-055.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lamport_safe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_21-14-37-055.csv Completed graceful shutdown