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/eldarica-misc/LIA/reve/025-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:09:34,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:09:34,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:09:34,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:09:34,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:09:34,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:09:34,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:09:34,984 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:09:34,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:09:34,988 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:09:34,988 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:09:34,989 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:09:34,990 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:09:34,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:09:34,994 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:09:34,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:09:34,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:09:34,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:09:35,000 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:09:35,001 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:09:35,002 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:09:35,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:09:35,004 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:09:35,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:09:35,005 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:09:35,006 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:09:35,007 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:09:35,008 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:09:35,009 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:09:35,009 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:09:35,010 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:09:35,010 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:09:35,011 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:09:35,011 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:09:35,012 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:09:35,012 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:09:35,026 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:09:35,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:09:35,027 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:09:35,027 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:09:35,028 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:09:35,028 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:09:35,028 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:09:35,028 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:09:35,029 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:09:35,029 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:09:35,029 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:09:35,029 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:09:35,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:09:35,030 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:09:35,030 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:09:35,030 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:09:35,030 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:09:35,030 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:09:35,030 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:09:35,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:09:35,031 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:09:35,032 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:09:35,032 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:09:35,081 INFO ]: Repository-Root is: /tmp [2018-06-24 21:09:35,093 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:09:35,097 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:09:35,098 INFO ]: Initializing SmtParser... [2018-06-24 21:09:35,098 INFO ]: SmtParser initialized [2018-06-24 21:09:35,099 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/025-horn.smt2 [2018-06-24 21:09:35,100 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-24 21:09:35,194 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025-horn.smt2 unknown [2018-06-24 21:09:35,490 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025-horn.smt2 [2018-06-24 21:09:35,495 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:09:35,500 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:09:35,501 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:09:35,501 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:09:35,501 INFO ]: ChcToBoogie initialized [2018-06-24 21:09:35,504 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:09:35" (1/1) ... [2018-06-24 21:09:35,577 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:35 Unit [2018-06-24 21:09:35,578 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:09:35,578 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:09:35,579 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:09:35,579 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:09:35,599 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:35" (1/1) ... [2018-06-24 21:09:35,599 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:35" (1/1) ... [2018-06-24 21:09:35,606 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:35" (1/1) ... [2018-06-24 21:09:35,606 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:35" (1/1) ... [2018-06-24 21:09:35,612 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:35" (1/1) ... [2018-06-24 21:09:35,615 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:35" (1/1) ... [2018-06-24 21:09:35,616 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:35" (1/1) ... [2018-06-24 21:09:35,627 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:09:35,627 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:09:35,627 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:09:35,627 INFO ]: RCFGBuilder initialized [2018-06-24 21:09:35,634 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:35" (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-24 21:09:35,647 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:09:35,647 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:09:35,647 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:09:35,647 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:09:35,647 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:09:35,647 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-24 21:09:36,109 INFO ]: Using library mode [2018-06-24 21:09:36,109 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:09:36 BoogieIcfgContainer [2018-06-24 21:09:36,109 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:09:36,110 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:09:36,110 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:09:36,111 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:09:36,111 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:09:36" (1/1) ... [2018-06-24 21:09:36,129 INFO ]: Initial Icfg 12 locations, 32 edges [2018-06-24 21:09:36,130 INFO ]: Using Remove infeasible edges [2018-06-24 21:09:36,133 INFO ]: Using Maximize final states [2018-06-24 21:09:36,134 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:09:36,134 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:09:36,136 INFO ]: Using Remove sink states [2018-06-24 21:09:36,136 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:09:36,136 INFO ]: Using Use SBE [2018-06-24 21:09:36,143 INFO ]: SBE split 0 edges [2018-06-24 21:09:36,148 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:09:36,150 INFO ]: 0 new accepting states [2018-06-24 21:09:36,175 INFO ]: Removed 6 edges and 2 locations by large block encoding [2018-06-24 21:09:36,177 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:09:36,181 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:09:36,181 INFO ]: 0 new accepting states [2018-06-24 21:09:36,181 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:09:36,181 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:09:36,182 INFO ]: Encoded RCFG 8 locations, 28 edges [2018-06-24 21:09:36,185 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:09:36 BasicIcfg [2018-06-24 21:09:36,185 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:09:36,186 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:09:36,186 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:09:36,189 INFO ]: TraceAbstraction initialized [2018-06-24 21:09:36,190 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:09:35" (1/4) ... [2018-06-24 21:09:36,190 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534c50d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:09:36, skipping insertion in model container [2018-06-24 21:09:36,190 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:35" (2/4) ... [2018-06-24 21:09:36,191 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534c50d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:09:36, skipping insertion in model container [2018-06-24 21:09:36,191 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:09:36" (3/4) ... [2018-06-24 21:09:36,191 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534c50d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:09:36, skipping insertion in model container [2018-06-24 21:09:36,191 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:09:36" (4/4) ... [2018-06-24 21:09:36,194 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:09:36,212 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:09:36,222 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:09:36,259 INFO ]: Using default assertion order modulation [2018-06-24 21:09:36,260 INFO ]: Interprodecural is true [2018-06-24 21:09:36,260 INFO ]: Hoare is false [2018-06-24 21:09:36,260 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:09:36,260 INFO ]: Backedges is TWOTRACK [2018-06-24 21:09:36,260 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:09:36,260 INFO ]: Difference is false [2018-06-24 21:09:36,260 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:09:36,260 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:09:36,271 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 21:09:36,280 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:09:36,280 INFO ]: Found error trace [2018-06-24 21:09:36,281 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:09:36,281 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:36,287 INFO ]: Analyzing trace with hash 56399194, now seen corresponding path program 1 times [2018-06-24 21:09:36,289 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:36,290 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:36,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:36,324 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:36,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:36,375 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:36,757 WARN ]: Spent 281.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-06-24 21:09:36,759 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:36,760 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:09:36,760 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:09:36,761 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:09:36,775 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:09:36,775 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:09:36,778 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-24 21:09:37,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:37,009 INFO ]: Finished difference Result 12 states and 49 transitions. [2018-06-24 21:09:37,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:09:37,010 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:09:37,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:37,019 INFO ]: With dead ends: 12 [2018-06-24 21:09:37,019 INFO ]: Without dead ends: 12 [2018-06-24 21:09:37,021 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:09:37,035 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:09:37,053 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-24 21:09:37,055 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:09:37,055 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2018-06-24 21:09:37,056 INFO ]: Start accepts. Automaton has 9 states and 40 transitions. Word has length 5 [2018-06-24 21:09:37,057 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:37,057 INFO ]: Abstraction has 9 states and 40 transitions. [2018-06-24 21:09:37,057 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:09:37,057 INFO ]: Start isEmpty. Operand 9 states and 40 transitions. [2018-06-24 21:09:37,058 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:09:37,058 INFO ]: Found error trace [2018-06-24 21:09:37,058 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:09:37,058 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:37,058 INFO ]: Analyzing trace with hash 1747813010, now seen corresponding path program 1 times [2018-06-24 21:09:37,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:37,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:37,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:37,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:37,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:37,073 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:37,216 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:37,216 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:37,216 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-24 21:09:37,227 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:37,269 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:37,277 INFO ]: Computing forward predicates... [2018-06-24 21:09:37,423 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:37,455 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:37,456 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 21:09:37,456 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:09:37,456 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:09:37,456 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:09:37,456 INFO ]: Start difference. First operand 9 states and 40 transitions. Second operand 6 states. [2018-06-24 21:09:38,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:38,113 INFO ]: Finished difference Result 22 states and 96 transitions. [2018-06-24 21:09:38,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:09:38,113 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:09:38,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:38,114 INFO ]: With dead ends: 22 [2018-06-24 21:09:38,114 INFO ]: Without dead ends: 22 [2018-06-24 21:09:38,115 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:09:38,115 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:09:38,118 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 12. [2018-06-24 21:09:38,118 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:09:38,119 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2018-06-24 21:09:38,119 INFO ]: Start accepts. Automaton has 12 states and 71 transitions. Word has length 6 [2018-06-24 21:09:38,119 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:38,119 INFO ]: Abstraction has 12 states and 71 transitions. [2018-06-24 21:09:38,119 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:09:38,119 INFO ]: Start isEmpty. Operand 12 states and 71 transitions. [2018-06-24 21:09:38,120 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:09:38,120 INFO ]: Found error trace [2018-06-24 21:09:38,120 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:09:38,120 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:38,120 INFO ]: Analyzing trace with hash 1747872592, now seen corresponding path program 1 times [2018-06-24 21:09:38,120 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:38,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:38,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:38,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:38,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:38,132 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:38,319 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:38,320 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:38,320 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-24 21:09:38,333 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:38,360 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:38,362 INFO ]: Computing forward predicates... [2018-06-24 21:09:38,555 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:38,580 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:38,580 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 21:09:38,580 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:09:38,581 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:09:38,581 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:09:38,581 INFO ]: Start difference. First operand 12 states and 71 transitions. Second operand 6 states. [2018-06-24 21:09:38,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:38,743 INFO ]: Finished difference Result 18 states and 118 transitions. [2018-06-24 21:09:38,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:09:38,743 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:09:38,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:38,744 INFO ]: With dead ends: 18 [2018-06-24 21:09:38,744 INFO ]: Without dead ends: 18 [2018-06-24 21:09:38,744 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:09:38,744 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 21:09:38,747 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-24 21:09:38,747 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:09:38,748 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 82 transitions. [2018-06-24 21:09:38,748 INFO ]: Start accepts. Automaton has 13 states and 82 transitions. Word has length 6 [2018-06-24 21:09:38,748 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:38,748 INFO ]: Abstraction has 13 states and 82 transitions. [2018-06-24 21:09:38,748 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:09:38,748 INFO ]: Start isEmpty. Operand 13 states and 82 transitions. [2018-06-24 21:09:38,748 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:09:38,748 INFO ]: Found error trace [2018-06-24 21:09:38,749 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:38,749 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:38,749 INFO ]: Analyzing trace with hash -1652784587, now seen corresponding path program 1 times [2018-06-24 21:09:38,749 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:38,749 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:38,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:38,750 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:38,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:38,771 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:38,798 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:38,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:38,799 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-24 21:09:38,804 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:38,824 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:38,825 INFO ]: Computing forward predicates... [2018-06-24 21:09:38,856 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:38,875 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:38,875 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:09:38,875 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:09:38,875 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:09:38,875 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:09:38,875 INFO ]: Start difference. First operand 13 states and 82 transitions. Second operand 8 states. [2018-06-24 21:09:39,082 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:39,082 INFO ]: Finished difference Result 17 states and 102 transitions. [2018-06-24 21:09:39,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:09:39,082 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:09:39,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:39,083 INFO ]: With dead ends: 17 [2018-06-24 21:09:39,083 INFO ]: Without dead ends: 17 [2018-06-24 21:09:39,083 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:09:39,084 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:09:39,086 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-24 21:09:39,086 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:09:39,087 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 97 transitions. [2018-06-24 21:09:39,087 INFO ]: Start accepts. Automaton has 15 states and 97 transitions. Word has length 7 [2018-06-24 21:09:39,087 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:39,087 INFO ]: Abstraction has 15 states and 97 transitions. [2018-06-24 21:09:39,087 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:09:39,087 INFO ]: Start isEmpty. Operand 15 states and 97 transitions. [2018-06-24 21:09:39,088 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:09:39,088 INFO ]: Found error trace [2018-06-24 21:09:39,088 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:39,088 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:39,088 INFO ]: Analyzing trace with hash -1651265246, now seen corresponding path program 1 times [2018-06-24 21:09:39,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:39,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:39,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:39,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:39,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:39,106 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:39,136 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:39,136 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:09:39,137 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:09:39,137 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:09:39,137 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:09:39,137 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:09:39,137 INFO ]: Start difference. First operand 15 states and 97 transitions. Second operand 3 states. [2018-06-24 21:09:39,180 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:39,180 INFO ]: Finished difference Result 15 states and 74 transitions. [2018-06-24 21:09:39,292 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:09:39,293 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:09:39,293 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:39,293 INFO ]: With dead ends: 15 [2018-06-24 21:09:39,293 INFO ]: Without dead ends: 15 [2018-06-24 21:09:39,294 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-24 21:09:39,294 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:09:39,296 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 21:09:39,296 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:09:39,296 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2018-06-24 21:09:39,296 INFO ]: Start accepts. Automaton has 15 states and 74 transitions. Word has length 7 [2018-06-24 21:09:39,296 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:39,296 INFO ]: Abstraction has 15 states and 74 transitions. [2018-06-24 21:09:39,297 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:09:39,297 INFO ]: Start isEmpty. Operand 15 states and 74 transitions. [2018-06-24 21:09:39,297 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:09:39,298 INFO ]: Found error trace [2018-06-24 21:09:39,298 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:39,298 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:39,298 INFO ]: Analyzing trace with hash -1651086500, now seen corresponding path program 1 times [2018-06-24 21:09:39,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:39,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:39,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:39,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:39,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:39,325 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:39,369 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:39,369 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:39,369 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:09:39,379 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:39,390 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:39,391 INFO ]: Computing forward predicates... [2018-06-24 21:09:39,479 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:39,497 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:39,497 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:09:39,497 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:09:39,498 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:09:39,498 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:09:39,498 INFO ]: Start difference. First operand 15 states and 74 transitions. Second operand 8 states. [2018-06-24 21:09:39,773 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:39,774 INFO ]: Finished difference Result 22 states and 110 transitions. [2018-06-24 21:09:39,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:09:39,774 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:09:39,774 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:39,775 INFO ]: With dead ends: 22 [2018-06-24 21:09:39,775 INFO ]: Without dead ends: 22 [2018-06-24 21:09:39,775 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:09:39,775 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:09:39,778 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-24 21:09:39,778 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:09:39,779 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2018-06-24 21:09:39,779 INFO ]: Start accepts. Automaton has 16 states and 81 transitions. Word has length 7 [2018-06-24 21:09:39,779 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:39,779 INFO ]: Abstraction has 16 states and 81 transitions. [2018-06-24 21:09:39,779 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:09:39,779 INFO ]: Start isEmpty. Operand 16 states and 81 transitions. [2018-06-24 21:09:39,779 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:09:39,779 INFO ]: Found error trace [2018-06-24 21:09:39,779 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 21:09:39,780 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:39,780 INFO ]: Analyzing trace with hash -1651026918, now seen corresponding path program 2 times [2018-06-24 21:09:39,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:39,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:39,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:39,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:39,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:39,794 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:39,859 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:39,859 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:39,859 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-24 21:09:39,866 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:09:39,883 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:09:39,883 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:39,886 INFO ]: Computing forward predicates... [2018-06-24 21:09:40,111 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:40,130 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:40,130 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 21:09:40,130 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:09:40,130 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:09:40,130 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:09:40,130 INFO ]: Start difference. First operand 16 states and 81 transitions. Second operand 7 states. [2018-06-24 21:09:40,404 WARN ]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-24 21:09:41,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:41,121 INFO ]: Finished difference Result 35 states and 189 transitions. [2018-06-24 21:09:41,122 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:09:41,122 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 21:09:41,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:41,123 INFO ]: With dead ends: 35 [2018-06-24 21:09:41,123 INFO ]: Without dead ends: 35 [2018-06-24 21:09:41,124 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:09:41,124 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:09:41,128 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-06-24 21:09:41,128 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:09:41,129 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2018-06-24 21:09:41,129 INFO ]: Start accepts. Automaton has 20 states and 115 transitions. Word has length 7 [2018-06-24 21:09:41,129 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:41,129 INFO ]: Abstraction has 20 states and 115 transitions. [2018-06-24 21:09:41,129 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:09:41,129 INFO ]: Start isEmpty. Operand 20 states and 115 transitions. [2018-06-24 21:09:41,129 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:09:41,129 INFO ]: Found error trace [2018-06-24 21:09:41,129 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:41,129 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:41,131 INFO ]: Analyzing trace with hash -1648256355, now seen corresponding path program 1 times [2018-06-24 21:09:41,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:41,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:41,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:41,132 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:41,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:41,139 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:41,177 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:41,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:41,177 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:09:41,183 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:41,194 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:41,195 INFO ]: Computing forward predicates... [2018-06-24 21:09:41,332 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:41,354 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:41,354 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-06-24 21:09:41,354 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:09:41,354 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:09:41,354 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:09:41,354 INFO ]: Start difference. First operand 20 states and 115 transitions. Second operand 7 states. [2018-06-24 21:09:42,896 WARN ]: Spent 252.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-06-24 21:09:44,151 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:44,151 INFO ]: Finished difference Result 38 states and 202 transitions. [2018-06-24 21:09:44,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:09:44,151 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 21:09:44,151 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:44,152 INFO ]: With dead ends: 38 [2018-06-24 21:09:44,152 INFO ]: Without dead ends: 38 [2018-06-24 21:09:44,153 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=72, Unknown=1, NotChecked=0, Total=110 [2018-06-24 21:09:44,153 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 21:09:44,157 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 26. [2018-06-24 21:09:44,157 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 21:09:44,158 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 148 transitions. [2018-06-24 21:09:44,158 INFO ]: Start accepts. Automaton has 26 states and 148 transitions. Word has length 7 [2018-06-24 21:09:44,158 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:44,158 INFO ]: Abstraction has 26 states and 148 transitions. [2018-06-24 21:09:44,158 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:09:44,158 INFO ]: Start isEmpty. Operand 26 states and 148 transitions. [2018-06-24 21:09:44,159 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:09:44,159 INFO ]: Found error trace [2018-06-24 21:09:44,159 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:44,159 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:44,159 INFO ]: Analyzing trace with hash 355364048, now seen corresponding path program 2 times [2018-06-24 21:09:44,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:44,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:44,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:44,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:44,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:44,170 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:44,222 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:44,222 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:44,248 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:09:44,254 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:09:44,269 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:09:44,269 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:44,270 INFO ]: Computing forward predicates... [2018-06-24 21:09:44,309 INFO ]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:44,329 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:44,329 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:09:44,329 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:09:44,329 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:09:44,329 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:09:44,329 INFO ]: Start difference. First operand 26 states and 148 transitions. Second operand 8 states. [2018-06-24 21:09:44,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:44,616 INFO ]: Finished difference Result 70 states and 392 transitions. [2018-06-24 21:09:44,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:09:44,617 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-24 21:09:44,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:44,618 INFO ]: With dead ends: 70 [2018-06-24 21:09:44,618 INFO ]: Without dead ends: 70 [2018-06-24 21:09:44,619 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:09:44,622 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-24 21:09:44,637 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 49. [2018-06-24 21:09:44,637 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 21:09:44,638 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 326 transitions. [2018-06-24 21:09:44,638 INFO ]: Start accepts. Automaton has 49 states and 326 transitions. Word has length 8 [2018-06-24 21:09:44,638 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:44,638 INFO ]: Abstraction has 49 states and 326 transitions. [2018-06-24 21:09:44,638 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:09:44,638 INFO ]: Start isEmpty. Operand 49 states and 326 transitions. [2018-06-24 21:09:44,638 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:09:44,638 INFO ]: Found error trace [2018-06-24 21:09:44,638 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:44,638 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:44,639 INFO ]: Analyzing trace with hash 355423630, now seen corresponding path program 3 times [2018-06-24 21:09:44,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:44,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:44,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:44,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:44,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:44,658 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:44,698 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:44,698 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:44,698 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:09:44,706 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:09:44,751 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:09:44,751 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:44,753 INFO ]: Computing forward predicates... [2018-06-24 21:09:44,856 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:44,874 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:44,874 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:09:44,875 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:09:44,875 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:09:44,875 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:09:44,875 INFO ]: Start difference. First operand 49 states and 326 transitions. Second operand 10 states. [2018-06-24 21:09:45,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:45,079 INFO ]: Finished difference Result 64 states and 416 transitions. [2018-06-24 21:09:45,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:09:45,079 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 21:09:45,079 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:45,080 INFO ]: With dead ends: 64 [2018-06-24 21:09:45,080 INFO ]: Without dead ends: 64 [2018-06-24 21:09:45,081 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:09:45,081 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-24 21:09:45,086 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-06-24 21:09:45,086 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-24 21:09:45,088 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 353 transitions. [2018-06-24 21:09:45,088 INFO ]: Start accepts. Automaton has 53 states and 353 transitions. Word has length 8 [2018-06-24 21:09:45,088 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:45,088 INFO ]: Abstraction has 53 states and 353 transitions. [2018-06-24 21:09:45,088 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:09:45,088 INFO ]: Start isEmpty. Operand 53 states and 353 transitions. [2018-06-24 21:09:45,089 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:09:45,089 INFO ]: Found error trace [2018-06-24 21:09:45,090 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:45,090 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:45,090 INFO ]: Analyzing trace with hash 357211090, now seen corresponding path program 4 times [2018-06-24 21:09:45,090 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:45,090 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:45,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:45,091 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:45,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:45,100 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:45,135 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:45,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:45,135 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:09:45,141 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:09:45,176 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:09:45,176 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:45,177 INFO ]: Computing forward predicates... [2018-06-24 21:09:45,414 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:45,432 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:45,432 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:09:45,432 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:09:45,432 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:09:45,433 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:09:45,433 INFO ]: Start difference. First operand 53 states and 353 transitions. Second operand 10 states. [2018-06-24 21:09:45,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:45,795 INFO ]: Finished difference Result 70 states and 441 transitions. [2018-06-24 21:09:45,796 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:09:45,796 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 21:09:45,796 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:45,797 INFO ]: With dead ends: 70 [2018-06-24 21:09:45,797 INFO ]: Without dead ends: 70 [2018-06-24 21:09:45,798 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:09:45,798 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-24 21:09:45,804 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 65. [2018-06-24 21:09:45,804 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-24 21:09:45,805 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 414 transitions. [2018-06-24 21:09:45,805 INFO ]: Start accepts. Automaton has 65 states and 414 transitions. Word has length 8 [2018-06-24 21:09:45,805 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:45,805 INFO ]: Abstraction has 65 states and 414 transitions. [2018-06-24 21:09:45,805 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:09:45,805 INFO ]: Start isEmpty. Operand 65 states and 414 transitions. [2018-06-24 21:09:45,806 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:09:45,806 INFO ]: Found error trace [2018-06-24 21:09:45,806 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:45,806 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:45,807 INFO ]: Analyzing trace with hash 443158125, now seen corresponding path program 2 times [2018-06-24 21:09:45,807 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:45,807 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:45,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:45,808 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:45,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:45,816 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:45,894 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:45,894 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:45,894 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:09:45,900 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:09:45,919 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:09:45,919 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:45,921 INFO ]: Computing forward predicates... [2018-06-24 21:09:46,075 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:46,094 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:46,094 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-24 21:09:46,094 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:09:46,094 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:09:46,094 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:09:46,095 INFO ]: Start difference. First operand 65 states and 414 transitions. Second operand 9 states. [2018-06-24 21:09:51,503 WARN ]: Spent 260.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2018-06-24 21:09:54,960 WARN ]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-06-24 21:09:58,660 WARN ]: Spent 3.26 s on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2018-06-24 21:09:59,661 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:59,661 INFO ]: Finished difference Result 93 states and 554 transitions. [2018-06-24 21:09:59,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:09:59,663 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-24 21:09:59,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:59,664 INFO ]: With dead ends: 93 [2018-06-24 21:09:59,665 INFO ]: Without dead ends: 93 [2018-06-24 21:09:59,665 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:09:59,665 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-24 21:09:59,679 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 78. [2018-06-24 21:09:59,679 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-24 21:09:59,680 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 498 transitions. [2018-06-24 21:09:59,680 INFO ]: Start accepts. Automaton has 78 states and 498 transitions. Word has length 8 [2018-06-24 21:09:59,680 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:59,680 INFO ]: Abstraction has 78 states and 498 transitions. [2018-06-24 21:09:59,680 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:09:59,680 INFO ]: Start isEmpty. Operand 78 states and 498 transitions. [2018-06-24 21:09:59,681 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:59,681 INFO ]: Found error trace [2018-06-24 21:09:59,682 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:59,684 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:59,684 INFO ]: Analyzing trace with hash 710094450, now seen corresponding path program 1 times [2018-06-24 21:09:59,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:59,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:59,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:59,685 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:59,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:59,697 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:59,773 INFO ]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:09:59,773 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:09:59,773 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:09:59,774 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:09:59,774 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:09:59,774 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:09:59,774 INFO ]: Start difference. First operand 78 states and 498 transitions. Second operand 3 states. [2018-06-24 21:09:59,902 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:59,902 INFO ]: Finished difference Result 79 states and 499 transitions. [2018-06-24 21:09:59,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:09:59,902 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 21:09:59,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:59,903 INFO ]: With dead ends: 79 [2018-06-24 21:09:59,903 INFO ]: Without dead ends: 78 [2018-06-24 21:09:59,903 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-24 21:09:59,903 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-24 21:09:59,911 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-06-24 21:09:59,911 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-24 21:09:59,915 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 472 transitions. [2018-06-24 21:09:59,915 INFO ]: Start accepts. Automaton has 78 states and 472 transitions. Word has length 9 [2018-06-24 21:09:59,915 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:59,915 INFO ]: Abstraction has 78 states and 472 transitions. [2018-06-24 21:09:59,915 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:09:59,915 INFO ]: Start isEmpty. Operand 78 states and 472 transitions. [2018-06-24 21:09:59,916 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:59,916 INFO ]: Found error trace [2018-06-24 21:09:59,916 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:59,916 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:59,916 INFO ]: Analyzing trace with hash 709736958, now seen corresponding path program 1 times [2018-06-24 21:09:59,916 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:59,916 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:59,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:59,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:59,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:59,938 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:00,005 INFO ]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:10:00,005 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:10:00,005 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:10:00,006 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:10:00,006 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:10:00,006 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:00,006 INFO ]: Start difference. First operand 78 states and 472 transitions. Second operand 3 states. [2018-06-24 21:10:00,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:00,099 INFO ]: Finished difference Result 79 states and 474 transitions. [2018-06-24 21:10:00,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:10:00,099 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 21:10:00,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:00,100 INFO ]: With dead ends: 79 [2018-06-24 21:10:00,100 INFO ]: Without dead ends: 79 [2018-06-24 21:10:00,100 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-24 21:10:00,100 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-24 21:10:00,108 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-06-24 21:10:00,108 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-24 21:10:00,113 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 474 transitions. [2018-06-24 21:10:00,113 INFO ]: Start accepts. Automaton has 79 states and 474 transitions. Word has length 9 [2018-06-24 21:10:00,114 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:00,114 INFO ]: Abstraction has 79 states and 474 transitions. [2018-06-24 21:10:00,114 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:10:00,114 INFO ]: Start isEmpty. Operand 79 states and 474 transitions. [2018-06-24 21:10:00,115 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:10:00,115 INFO ]: Found error trace [2018-06-24 21:10:00,115 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:00,115 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:00,115 INFO ]: Analyzing trace with hash 709856122, now seen corresponding path program 1 times [2018-06-24 21:10:00,115 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:00,115 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:00,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:00,115 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:00,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:00,127 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:00,486 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:00,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:00,486 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:00,505 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:00,534 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:00,535 INFO ]: Computing forward predicates... [2018-06-24 21:10:00,545 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:00,578 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:00,578 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 21:10:00,578 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:10:00,578 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:10:00,578 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:10:00,579 INFO ]: Start difference. First operand 79 states and 474 transitions. Second operand 6 states. [2018-06-24 21:10:01,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:01,428 INFO ]: Finished difference Result 87 states and 522 transitions. [2018-06-24 21:10:01,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:10:01,429 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-24 21:10:01,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:01,430 INFO ]: With dead ends: 87 [2018-06-24 21:10:01,430 INFO ]: Without dead ends: 87 [2018-06-24 21:10:01,430 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:10:01,430 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-24 21:10:01,438 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 79. [2018-06-24 21:10:01,438 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-24 21:10:01,441 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 474 transitions. [2018-06-24 21:10:01,441 INFO ]: Start accepts. Automaton has 79 states and 474 transitions. Word has length 9 [2018-06-24 21:10:01,442 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:01,442 INFO ]: Abstraction has 79 states and 474 transitions. [2018-06-24 21:10:01,442 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:10:01,442 INFO ]: Start isEmpty. Operand 79 states and 474 transitions. [2018-06-24 21:10:01,442 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:10:01,442 INFO ]: Found error trace [2018-06-24 21:10:01,442 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-06-24 21:10:01,443 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:01,443 INFO ]: Analyzing trace with hash -1867331362, now seen corresponding path program 5 times [2018-06-24 21:10:01,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:01,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:01,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:01,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:01,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:01,452 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:01,585 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:01,585 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:01,585 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:01,591 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:10:01,608 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 21:10:01,608 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:01,609 INFO ]: Computing forward predicates... [2018-06-24 21:10:01,622 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:01,648 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:01,648 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 21:10:01,649 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:10:01,649 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:10:01,649 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:10:01,649 INFO ]: Start difference. First operand 79 states and 474 transitions. Second operand 6 states. [2018-06-24 21:10:01,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:01,919 INFO ]: Finished difference Result 132 states and 724 transitions. [2018-06-24 21:10:01,920 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:10:01,920 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-24 21:10:01,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:01,921 INFO ]: With dead ends: 132 [2018-06-24 21:10:01,921 INFO ]: Without dead ends: 132 [2018-06-24 21:10:01,922 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:10:01,922 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-24 21:10:01,936 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 96. [2018-06-24 21:10:01,936 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-24 21:10:01,937 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 604 transitions. [2018-06-24 21:10:01,937 INFO ]: Start accepts. Automaton has 96 states and 604 transitions. Word has length 9 [2018-06-24 21:10:01,937 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:01,937 INFO ]: Abstraction has 96 states and 604 transitions. [2018-06-24 21:10:01,941 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:10:01,941 INFO ]: Start isEmpty. Operand 96 states and 604 transitions. [2018-06-24 21:10:01,942 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:10:01,942 INFO ]: Found error trace [2018-06-24 21:10:01,942 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:01,942 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:01,943 INFO ]: Analyzing trace with hash -1867271780, now seen corresponding path program 6 times [2018-06-24 21:10:01,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:01,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:01,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:01,943 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:01,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:01,958 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:02,023 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:02,023 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:02,023 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:02,029 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:10:02,075 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 21:10:02,075 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:02,077 INFO ]: Computing forward predicates... [2018-06-24 21:10:02,285 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:02,305 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:02,305 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:10:02,305 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:10:02,305 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:10:02,305 INFO ]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:10:02,305 INFO ]: Start difference. First operand 96 states and 604 transitions. Second operand 12 states. [2018-06-24 21:10:12,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:12,204 INFO ]: Finished difference Result 212 states and 1248 transitions. [2018-06-24 21:10:12,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:10:12,205 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 21:10:12,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:12,208 INFO ]: With dead ends: 212 [2018-06-24 21:10:12,208 INFO ]: Without dead ends: 212 [2018-06-24 21:10:12,208 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:10:12,209 INFO ]: Start minimizeSevpa. Operand 212 states. [2018-06-24 21:10:12,220 INFO ]: Finished minimizeSevpa. Reduced states from 212 to 99. [2018-06-24 21:10:12,220 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-24 21:10:12,222 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 629 transitions. [2018-06-24 21:10:12,222 INFO ]: Start accepts. Automaton has 99 states and 629 transitions. Word has length 9 [2018-06-24 21:10:12,222 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:12,222 INFO ]: Abstraction has 99 states and 629 transitions. [2018-06-24 21:10:12,222 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:10:12,222 INFO ]: Start isEmpty. Operand 99 states and 629 transitions. [2018-06-24 21:10:12,222 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:10:12,222 INFO ]: Found error trace [2018-06-24 21:10:12,222 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:12,223 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:12,223 INFO ]: Analyzing trace with hash -1811860520, now seen corresponding path program 7 times [2018-06-24 21:10:12,223 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:12,223 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:12,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:12,223 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:12,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:12,232 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:12,337 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:12,338 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:12,338 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:12,346 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:12,360 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:12,362 INFO ]: Computing forward predicates... [2018-06-24 21:10:12,495 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:12,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:12,514 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:10:12,514 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:10:12,514 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:10:12,514 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:10:12,515 INFO ]: Start difference. First operand 99 states and 629 transitions. Second operand 12 states. [2018-06-24 21:10:20,692 WARN ]: Spent 2.65 s on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-06-24 21:10:21,938 WARN ]: Spent 389.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-06-24 21:10:27,147 WARN ]: Spent 2.54 s on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2018-06-24 21:10:36,980 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:36,980 INFO ]: Finished difference Result 336 states and 1965 transitions. [2018-06-24 21:10:36,981 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 21:10:36,981 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 21:10:36,981 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:36,985 INFO ]: With dead ends: 336 [2018-06-24 21:10:36,985 INFO ]: Without dead ends: 336 [2018-06-24 21:10:36,986 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=395, Invalid=1241, Unknown=4, NotChecked=0, Total=1640 [2018-06-24 21:10:36,986 INFO ]: Start minimizeSevpa. Operand 336 states. [2018-06-24 21:10:36,994 INFO ]: Finished minimizeSevpa. Reduced states from 336 to 151. [2018-06-24 21:10:36,994 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-24 21:10:36,999 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 939 transitions. [2018-06-24 21:10:36,999 INFO ]: Start accepts. Automaton has 151 states and 939 transitions. Word has length 9 [2018-06-24 21:10:36,999 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:36,999 INFO ]: Abstraction has 151 states and 939 transitions. [2018-06-24 21:10:36,999 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:10:36,999 INFO ]: Start isEmpty. Operand 151 states and 939 transitions. [2018-06-24 21:10:37,000 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:10:37,000 INFO ]: Found error trace [2018-06-24 21:10:37,000 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:37,000 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:37,001 INFO ]: Analyzing trace with hash -1810073060, now seen corresponding path program 8 times [2018-06-24 21:10:37,001 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:37,001 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:37,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:37,001 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:37,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:37,010 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:37,098 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:37,098 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:37,098 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:37,104 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:10:37,118 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:10:37,118 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:37,120 INFO ]: Computing forward predicates... [2018-06-24 21:10:37,189 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:37,208 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:37,216 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:10:37,216 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:10:37,216 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:10:37,216 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:10:37,216 INFO ]: Start difference. First operand 151 states and 939 transitions. Second operand 12 states. [2018-06-24 21:10:37,568 WARN ]: Spent 127.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-06-24 21:10:37,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:37,740 INFO ]: Finished difference Result 241 states and 1398 transitions. [2018-06-24 21:10:37,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:10:37,740 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 21:10:37,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:37,741 INFO ]: With dead ends: 241 [2018-06-24 21:10:37,741 INFO ]: Without dead ends: 241 [2018-06-24 21:10:37,741 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:10:37,742 INFO ]: Start minimizeSevpa. Operand 241 states. [2018-06-24 21:10:37,749 INFO ]: Finished minimizeSevpa. Reduced states from 241 to 156. [2018-06-24 21:10:37,749 INFO ]: Start removeUnreachable. Operand 156 states. [2018-06-24 21:10:37,750 INFO ]: Finished removeUnreachable. Reduced from 156 states to 156 states and 967 transitions. [2018-06-24 21:10:37,751 INFO ]: Start accepts. Automaton has 156 states and 967 transitions. Word has length 9 [2018-06-24 21:10:37,751 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:37,751 INFO ]: Abstraction has 156 states and 967 transitions. [2018-06-24 21:10:37,751 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:10:37,751 INFO ]: Start isEmpty. Operand 156 states and 967 transitions. [2018-06-24 21:10:37,752 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:10:37,752 INFO ]: Found error trace [2018-06-24 21:10:37,752 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 21:10:37,752 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:37,752 INFO ]: Analyzing trace with hash -1810013478, now seen corresponding path program 3 times [2018-06-24 21:10:37,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:37,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:37,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:37,752 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:37,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:37,761 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:37,868 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:37,868 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:37,868 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:37,873 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:10:37,888 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:10:37,888 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:37,891 INFO ]: Computing forward predicates... [2018-06-24 21:10:39,962 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:39,981 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:39,981 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-24 21:10:39,981 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:10:39,981 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:10:39,981 INFO ]: CoverageRelationStatistics Valid=32, Invalid=77, Unknown=1, NotChecked=0, Total=110 [2018-06-24 21:10:39,982 INFO ]: Start difference. First operand 156 states and 967 transitions. Second operand 11 states. Received shutdown request... [2018-06-24 21:10:52,597 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:10:52,597 WARN ]: Verification canceled [2018-06-24 21:10:52,600 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:10:52,601 WARN ]: Timeout [2018-06-24 21:10:52,609 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:10:52 BasicIcfg [2018-06-24 21:10:52,609 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:10:52,610 INFO ]: Toolchain (without parser) took 77114.75 ms. Allocated memory was 306.2 MB in the beginning and 556.3 MB in the end (delta: 250.1 MB). Free memory was 258.6 MB in the beginning and 532.2 MB in the end (delta: -273.7 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:10:52,611 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:10:52,611 INFO ]: ChcToBoogie took 77.17 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 254.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:10:52,611 INFO ]: Boogie Preprocessor took 48.12 ms. Allocated memory is still 306.2 MB. Free memory is still 254.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:10:52,612 INFO ]: RCFGBuilder took 482.30 ms. Allocated memory is still 306.2 MB. Free memory was 254.6 MB in the beginning and 236.6 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:10:52,612 INFO ]: BlockEncodingV2 took 74.86 ms. Allocated memory is still 306.2 MB. Free memory was 236.6 MB in the beginning and 234.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:10:52,612 INFO ]: TraceAbstraction took 76423.58 ms. Allocated memory was 306.2 MB in the beginning and 556.3 MB in the end (delta: 250.1 MB). Free memory was 234.6 MB in the beginning and 532.2 MB in the end (delta: -297.6 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:10:52,615 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 32 edges - StatisticsResult: Encoded RCFG 8 locations, 28 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 77.17 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 254.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.12 ms. Allocated memory is still 306.2 MB. Free memory is still 254.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 482.30 ms. Allocated memory is still 306.2 MB. Free memory was 254.6 MB in the beginning and 236.6 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 74.86 ms. Allocated memory is still 306.2 MB. Free memory was 236.6 MB in the beginning and 234.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 76423.58 ms. Allocated memory was 306.2 MB in the beginning and 556.3 MB in the end (delta: 250.1 MB). Free memory was 234.6 MB in the beginning and 532.2 MB in the end (delta: -297.6 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. TIMEOUT Result, 76.3s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 68.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 404 SDtfs, 519 SDslu, 1449 SDs, 0 SdLazy, 2765 SolverSat, 832 SolverUnsat, 52 SolverUnknown, 0 SolverNotchecked, 50.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 22.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=19, 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, 19 MinimizatonAttempts, 532 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 246 ConstructedInterpolants, 19 QuantifiedInterpolants, 10905 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1731 ConjunctsInSsa, 392 ConjunctsInUnsatCore, 36 InterpolantComputations, 4 PerfectInterpolantSequences, 35/203 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/025-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-10-52-632.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-10-52-632.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-10-52-632.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-10-52-632.csv Completed graceful shutdown