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/025b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:08:36,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:08:36,957 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:08:36,971 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:08:36,971 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:08:36,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:08:36,976 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:08:36,978 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:08:36,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:08:36,981 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:08:36,982 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:08:36,982 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:08:36,983 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:08:36,984 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:08:36,988 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:08:36,989 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:08:36,991 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:08:36,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:08:37,000 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:08:37,001 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:08:37,002 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:08:37,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:08:37,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:08:37,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:08:37,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:08:37,007 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:08:37,007 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:08:37,008 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:08:37,009 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:08:37,009 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:08:37,010 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:08:37,011 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:08:37,011 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:08:37,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:08:37,012 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:08:37,013 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:08:37,034 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:08:37,034 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:08:37,035 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:08:37,035 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:08:37,036 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:08:37,036 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:08:37,036 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:08:37,036 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:08:37,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:08:37,038 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:08:37,038 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:08:37,038 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:08:37,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:08:37,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:08:37,039 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:08:37,039 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:08:37,039 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:08:37,039 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:08:37,039 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:08:37,040 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:08:37,040 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:08:37,041 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:08:37,041 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:08:37,092 INFO ]: Repository-Root is: /tmp [2018-06-24 21:08:37,108 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:08:37,113 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:08:37,114 INFO ]: Initializing SmtParser... [2018-06-24 21:08:37,114 INFO ]: SmtParser initialized [2018-06-24 21:08:37,115 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/025b-horn.smt2 [2018-06-24 21:08:37,116 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:08:37,199 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025b-horn.smt2 unknown [2018-06-24 21:08:37,476 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025b-horn.smt2 [2018-06-24 21:08:37,483 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:08:37,489 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:08:37,490 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:08:37,490 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:08:37,490 INFO ]: ChcToBoogie initialized [2018-06-24 21:08:37,497 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:08:37" (1/1) ... [2018-06-24 21:08:37,565 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:37 Unit [2018-06-24 21:08:37,566 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:08:37,569 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:08:37,569 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:08:37,569 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:08:37,589 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:37" (1/1) ... [2018-06-24 21:08:37,589 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:37" (1/1) ... [2018-06-24 21:08:37,604 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:37" (1/1) ... [2018-06-24 21:08:37,604 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:37" (1/1) ... [2018-06-24 21:08:37,609 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:37" (1/1) ... [2018-06-24 21:08:37,618 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:37" (1/1) ... [2018-06-24 21:08:37,619 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:37" (1/1) ... [2018-06-24 21:08:37,621 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:08:37,622 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:08:37,622 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:08:37,626 INFO ]: RCFGBuilder initialized [2018-06-24 21:08:37,627 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:37" (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:08:37,643 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:08:37,643 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:08:37,643 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:08:37,643 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:08:37,643 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:08:37,644 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:08:38,217 INFO ]: Using library mode [2018-06-24 21:08:38,218 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:08:38 BoogieIcfgContainer [2018-06-24 21:08:38,218 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:08:38,218 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:08:38,218 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:08:38,220 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:08:38,221 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:08:38" (1/1) ... [2018-06-24 21:08:38,239 INFO ]: Initial Icfg 12 locations, 32 edges [2018-06-24 21:08:38,241 INFO ]: Using Remove infeasible edges [2018-06-24 21:08:38,241 INFO ]: Using Maximize final states [2018-06-24 21:08:38,242 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:08:38,242 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:08:38,248 INFO ]: Using Remove sink states [2018-06-24 21:08:38,249 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:08:38,249 INFO ]: Using Use SBE [2018-06-24 21:08:38,265 INFO ]: SBE split 0 edges [2018-06-24 21:08:38,276 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:08:38,277 INFO ]: 0 new accepting states [2018-06-24 21:08:38,329 INFO ]: Removed 6 edges and 2 locations by large block encoding [2018-06-24 21:08:38,331 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:08:38,334 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:08:38,334 INFO ]: 0 new accepting states [2018-06-24 21:08:38,335 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:08:38,335 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:08:38,335 INFO ]: Encoded RCFG 8 locations, 28 edges [2018-06-24 21:08:38,336 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:08:38 BasicIcfg [2018-06-24 21:08:38,336 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:08:38,337 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:08:38,337 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:08:38,340 INFO ]: TraceAbstraction initialized [2018-06-24 21:08:38,340 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:08:37" (1/4) ... [2018-06-24 21:08:38,341 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395bc3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:08:38, skipping insertion in model container [2018-06-24 21:08:38,341 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:37" (2/4) ... [2018-06-24 21:08:38,341 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395bc3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:08:38, skipping insertion in model container [2018-06-24 21:08:38,342 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:08:38" (3/4) ... [2018-06-24 21:08:38,342 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395bc3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:08:38, skipping insertion in model container [2018-06-24 21:08:38,342 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:08:38" (4/4) ... [2018-06-24 21:08:38,345 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:08:38,363 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:08:38,373 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:08:38,422 INFO ]: Using default assertion order modulation [2018-06-24 21:08:38,423 INFO ]: Interprodecural is true [2018-06-24 21:08:38,423 INFO ]: Hoare is false [2018-06-24 21:08:38,423 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:08:38,423 INFO ]: Backedges is TWOTRACK [2018-06-24 21:08:38,423 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:08:38,423 INFO ]: Difference is false [2018-06-24 21:08:38,423 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:08:38,423 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:08:38,436 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 21:08:38,448 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:08:38,448 INFO ]: Found error trace [2018-06-24 21:08:38,449 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:08:38,449 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:38,454 INFO ]: Analyzing trace with hash 56397272, now seen corresponding path program 1 times [2018-06-24 21:08:38,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:38,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:38,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:38,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:38,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:38,560 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:38,916 WARN ]: Spent 286.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-06-24 21:08:38,918 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:08:38,921 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:08:38,921 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:08:38,922 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:08:38,932 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:08:38,932 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:08:38,934 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-24 21:08:39,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:39,117 INFO ]: Finished difference Result 12 states and 49 transitions. [2018-06-24 21:08:39,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:08:39,118 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:08:39,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:39,128 INFO ]: With dead ends: 12 [2018-06-24 21:08:39,128 INFO ]: Without dead ends: 12 [2018-06-24 21:08:39,130 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:08:39,145 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:08:39,170 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-24 21:08:39,172 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:08:39,172 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2018-06-24 21:08:39,174 INFO ]: Start accepts. Automaton has 9 states and 40 transitions. Word has length 5 [2018-06-24 21:08:39,175 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:39,175 INFO ]: Abstraction has 9 states and 40 transitions. [2018-06-24 21:08:39,175 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:08:39,175 INFO ]: Start isEmpty. Operand 9 states and 40 transitions. [2018-06-24 21:08:39,175 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:08:39,176 INFO ]: Found error trace [2018-06-24 21:08:39,176 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:08:39,176 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:39,176 INFO ]: Analyzing trace with hash 1747811088, now seen corresponding path program 1 times [2018-06-24 21:08:39,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:39,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:39,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:39,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:39,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:39,197 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:39,344 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:08:39,344 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:39,344 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) [2018-06-24 21:08:39,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:08:39,399 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:39,406 INFO ]: Computing forward predicates... [2018-06-24 21:08:39,509 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:08:39,529 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:39,529 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 21:08:39,530 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:08:39,530 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:08:39,530 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:08:39,530 INFO ]: Start difference. First operand 9 states and 40 transitions. Second operand 6 states. [2018-06-24 21:08:40,062 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:40,062 INFO ]: Finished difference Result 22 states and 96 transitions. [2018-06-24 21:08:40,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:08:40,062 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:08:40,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:40,063 INFO ]: With dead ends: 22 [2018-06-24 21:08:40,064 INFO ]: Without dead ends: 22 [2018-06-24 21:08:40,064 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:08:40,064 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:08:40,068 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 12. [2018-06-24 21:08:40,068 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:08:40,069 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2018-06-24 21:08:40,069 INFO ]: Start accepts. Automaton has 12 states and 71 transitions. Word has length 6 [2018-06-24 21:08:40,069 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:40,069 INFO ]: Abstraction has 12 states and 71 transitions. [2018-06-24 21:08:40,069 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:08:40,069 INFO ]: Start isEmpty. Operand 12 states and 71 transitions. [2018-06-24 21:08:40,070 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:08:40,070 INFO ]: Found error trace [2018-06-24 21:08:40,070 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:08:40,070 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:40,070 INFO ]: Analyzing trace with hash 1747870670, now seen corresponding path program 1 times [2018-06-24 21:08:40,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:40,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:40,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:40,071 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:40,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:40,082 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:40,272 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:08:40,272 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:40,272 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:08:40,285 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:40,310 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:40,312 INFO ]: Computing forward predicates... [2018-06-24 21:08:40,572 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:08:40,591 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:40,591 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 21:08:40,591 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:08:40,591 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:08:40,591 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:08:40,591 INFO ]: Start difference. First operand 12 states and 71 transitions. Second operand 6 states. [2018-06-24 21:08:40,709 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:40,709 INFO ]: Finished difference Result 18 states and 118 transitions. [2018-06-24 21:08:40,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:08:40,710 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:08:40,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:40,711 INFO ]: With dead ends: 18 [2018-06-24 21:08:40,711 INFO ]: Without dead ends: 18 [2018-06-24 21:08:40,711 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:08:40,711 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 21:08:40,714 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-24 21:08:40,714 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:08:40,714 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 82 transitions. [2018-06-24 21:08:40,715 INFO ]: Start accepts. Automaton has 13 states and 82 transitions. Word has length 6 [2018-06-24 21:08:40,715 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:40,715 INFO ]: Abstraction has 13 states and 82 transitions. [2018-06-24 21:08:40,715 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:08:40,715 INFO ]: Start isEmpty. Operand 13 states and 82 transitions. [2018-06-24 21:08:40,715 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:08:40,715 INFO ]: Found error trace [2018-06-24 21:08:40,715 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:40,715 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:40,715 INFO ]: Analyzing trace with hash -1652786509, now seen corresponding path program 1 times [2018-06-24 21:08:40,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:40,715 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:40,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:40,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:40,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:40,730 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:40,768 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:08:40,768 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:40,768 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:08:40,774 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:40,795 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:40,796 INFO ]: Computing forward predicates... [2018-06-24 21:08:40,828 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:08:40,847 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:40,847 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:08:40,847 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:08:40,848 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:08:40,848 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:08:40,848 INFO ]: Start difference. First operand 13 states and 82 transitions. Second operand 8 states. [2018-06-24 21:08:41,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:41,061 INFO ]: Finished difference Result 17 states and 102 transitions. [2018-06-24 21:08:41,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:08:41,062 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:08:41,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:41,063 INFO ]: With dead ends: 17 [2018-06-24 21:08:41,063 INFO ]: Without dead ends: 17 [2018-06-24 21:08:41,063 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:08:41,063 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:08:41,066 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-24 21:08:41,066 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:08:41,067 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 97 transitions. [2018-06-24 21:08:41,067 INFO ]: Start accepts. Automaton has 15 states and 97 transitions. Word has length 7 [2018-06-24 21:08:41,067 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:41,067 INFO ]: Abstraction has 15 states and 97 transitions. [2018-06-24 21:08:41,067 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:08:41,067 INFO ]: Start isEmpty. Operand 15 states and 97 transitions. [2018-06-24 21:08:41,067 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:08:41,067 INFO ]: Found error trace [2018-06-24 21:08:41,067 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:41,067 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:41,067 INFO ]: Analyzing trace with hash -1651267168, now seen corresponding path program 1 times [2018-06-24 21:08:41,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:41,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:41,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:41,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:41,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:41,080 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:41,108 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:08:41,108 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:08:41,108 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:08:41,108 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:08:41,109 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:08:41,109 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:08:41,109 INFO ]: Start difference. First operand 15 states and 97 transitions. Second operand 3 states. [2018-06-24 21:08:41,142 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:41,142 INFO ]: Finished difference Result 15 states and 74 transitions. [2018-06-24 21:08:41,142 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:08:41,142 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:08:41,142 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:41,143 INFO ]: With dead ends: 15 [2018-06-24 21:08:41,143 INFO ]: Without dead ends: 15 [2018-06-24 21:08:41,143 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:08:41,143 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:08:41,145 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 21:08:41,145 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:08:41,146 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2018-06-24 21:08:41,146 INFO ]: Start accepts. Automaton has 15 states and 74 transitions. Word has length 7 [2018-06-24 21:08:41,146 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:41,146 INFO ]: Abstraction has 15 states and 74 transitions. [2018-06-24 21:08:41,146 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:08:41,146 INFO ]: Start isEmpty. Operand 15 states and 74 transitions. [2018-06-24 21:08:41,147 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:08:41,147 INFO ]: Found error trace [2018-06-24 21:08:41,147 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:41,147 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:41,147 INFO ]: Analyzing trace with hash -1651088422, now seen corresponding path program 1 times [2018-06-24 21:08:41,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:41,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:41,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:41,148 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:41,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:41,159 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:41,200 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:08:41,200 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:41,200 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:08:41,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:41,235 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:41,236 INFO ]: Computing forward predicates... [2018-06-24 21:08:41,362 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:08:41,386 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:41,387 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:08:41,387 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:08:41,387 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:08:41,387 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:08:41,387 INFO ]: Start difference. First operand 15 states and 74 transitions. Second operand 8 states. [2018-06-24 21:08:41,593 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:41,593 INFO ]: Finished difference Result 22 states and 110 transitions. [2018-06-24 21:08:41,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:08:41,598 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:08:41,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:41,599 INFO ]: With dead ends: 22 [2018-06-24 21:08:41,599 INFO ]: Without dead ends: 22 [2018-06-24 21:08:41,599 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:08:41,599 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:08:41,602 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-24 21:08:41,602 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:08:41,603 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2018-06-24 21:08:41,603 INFO ]: Start accepts. Automaton has 16 states and 81 transitions. Word has length 7 [2018-06-24 21:08:41,603 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:41,603 INFO ]: Abstraction has 16 states and 81 transitions. [2018-06-24 21:08:41,603 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:08:41,603 INFO ]: Start isEmpty. Operand 16 states and 81 transitions. [2018-06-24 21:08:41,603 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:08:41,603 INFO ]: Found error trace [2018-06-24 21:08:41,603 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 21:08:41,604 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:41,604 INFO ]: Analyzing trace with hash -1651028840, now seen corresponding path program 2 times [2018-06-24 21:08:41,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:41,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:41,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:41,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:41,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:41,633 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:41,797 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-24 21:08:41,817 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:08:41,817 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:41,817 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:08:41,833 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:08:41,846 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:08:41,846 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:41,848 INFO ]: Computing forward predicates... [2018-06-24 21:08:41,997 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:08:42,029 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:42,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 21:08:42,029 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:08:42,029 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:08:42,029 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:08:42,029 INFO ]: Start difference. First operand 16 states and 81 transitions. Second operand 7 states. [2018-06-24 21:08:43,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:43,991 INFO ]: Finished difference Result 35 states and 189 transitions. [2018-06-24 21:08:43,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:08:43,992 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 21:08:43,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:43,993 INFO ]: With dead ends: 35 [2018-06-24 21:08:43,993 INFO ]: Without dead ends: 35 [2018-06-24 21:08:43,993 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:08:43,993 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:08:43,996 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-06-24 21:08:43,996 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:08:43,997 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2018-06-24 21:08:43,997 INFO ]: Start accepts. Automaton has 20 states and 115 transitions. Word has length 7 [2018-06-24 21:08:43,998 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:43,998 INFO ]: Abstraction has 20 states and 115 transitions. [2018-06-24 21:08:43,998 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:08:43,998 INFO ]: Start isEmpty. Operand 20 states and 115 transitions. [2018-06-24 21:08:43,998 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:08:43,998 INFO ]: Found error trace [2018-06-24 21:08:43,998 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:43,998 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:43,998 INFO ]: Analyzing trace with hash -1648258277, now seen corresponding path program 1 times [2018-06-24 21:08:43,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:43,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:43,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:43,999 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:08:43,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:44,014 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:44,076 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:08:44,077 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:44,077 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:08:44,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:44,096 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:44,097 INFO ]: Computing forward predicates... [2018-06-24 21:08:44,155 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:08:44,174 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:44,174 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-06-24 21:08:44,175 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:08:44,175 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:08:44,175 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:08:44,175 INFO ]: Start difference. First operand 20 states and 115 transitions. Second operand 7 states. [2018-06-24 21:08:45,348 WARN ]: Spent 438.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-06-24 21:08:46,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:46,492 INFO ]: Finished difference Result 38 states and 202 transitions. [2018-06-24 21:08:46,493 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:08:46,493 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 21:08:46,493 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:46,494 INFO ]: With dead ends: 38 [2018-06-24 21:08:46,494 INFO ]: Without dead ends: 38 [2018-06-24 21:08:46,495 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=72, Unknown=1, NotChecked=0, Total=110 [2018-06-24 21:08:46,495 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 21:08:46,502 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 26. [2018-06-24 21:08:46,503 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 21:08:46,504 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 148 transitions. [2018-06-24 21:08:46,504 INFO ]: Start accepts. Automaton has 26 states and 148 transitions. Word has length 7 [2018-06-24 21:08:46,506 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:46,506 INFO ]: Abstraction has 26 states and 148 transitions. [2018-06-24 21:08:46,506 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:08:46,506 INFO ]: Start isEmpty. Operand 26 states and 148 transitions. [2018-06-24 21:08:46,507 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:08:46,507 INFO ]: Found error trace [2018-06-24 21:08:46,507 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:46,507 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:46,507 INFO ]: Analyzing trace with hash 355362126, now seen corresponding path program 2 times [2018-06-24 21:08:46,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:46,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:46,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:46,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:46,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:46,533 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:46,672 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:08:46,672 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:46,672 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:08:46,678 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:08:46,718 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:08:46,718 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:46,720 INFO ]: Computing forward predicates... [2018-06-24 21:08:46,778 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:08:46,799 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:46,799 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:08:46,799 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:08:46,800 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:08:46,800 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:08:46,800 INFO ]: Start difference. First operand 26 states and 148 transitions. Second operand 8 states. [2018-06-24 21:08:47,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:47,077 INFO ]: Finished difference Result 70 states and 392 transitions. [2018-06-24 21:08:47,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:08:47,077 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-24 21:08:47,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:47,079 INFO ]: With dead ends: 70 [2018-06-24 21:08:47,079 INFO ]: Without dead ends: 70 [2018-06-24 21:08:47,079 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:08:47,079 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-24 21:08:47,098 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 49. [2018-06-24 21:08:47,098 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 21:08:47,099 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 326 transitions. [2018-06-24 21:08:47,099 INFO ]: Start accepts. Automaton has 49 states and 326 transitions. Word has length 8 [2018-06-24 21:08:47,099 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:47,099 INFO ]: Abstraction has 49 states and 326 transitions. [2018-06-24 21:08:47,099 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:08:47,099 INFO ]: Start isEmpty. Operand 49 states and 326 transitions. [2018-06-24 21:08:47,100 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:08:47,100 INFO ]: Found error trace [2018-06-24 21:08:47,100 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:47,100 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:47,101 INFO ]: Analyzing trace with hash 355421708, now seen corresponding path program 3 times [2018-06-24 21:08:47,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:47,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:47,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:47,101 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:08:47,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:47,119 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:47,206 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:08:47,206 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:47,206 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:08:47,214 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:08:47,237 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:08:47,237 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:47,238 INFO ]: Computing forward predicates... [2018-06-24 21:08:47,317 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:08:47,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:47,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:08:47,337 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:08:47,337 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:08:47,337 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:08:47,337 INFO ]: Start difference. First operand 49 states and 326 transitions. Second operand 10 states. [2018-06-24 21:08:47,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:47,542 INFO ]: Finished difference Result 64 states and 416 transitions. [2018-06-24 21:08:47,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:08:47,542 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 21:08:47,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:47,544 INFO ]: With dead ends: 64 [2018-06-24 21:08:47,544 INFO ]: Without dead ends: 64 [2018-06-24 21:08:47,544 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:08:47,544 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-24 21:08:47,549 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-06-24 21:08:47,549 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-24 21:08:47,551 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 353 transitions. [2018-06-24 21:08:47,551 INFO ]: Start accepts. Automaton has 53 states and 353 transitions. Word has length 8 [2018-06-24 21:08:47,551 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:47,551 INFO ]: Abstraction has 53 states and 353 transitions. [2018-06-24 21:08:47,551 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:08:47,551 INFO ]: Start isEmpty. Operand 53 states and 353 transitions. [2018-06-24 21:08:47,552 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:08:47,552 INFO ]: Found error trace [2018-06-24 21:08:47,552 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:47,552 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:47,552 INFO ]: Analyzing trace with hash 357209168, now seen corresponding path program 4 times [2018-06-24 21:08:47,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:47,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:47,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:47,553 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:08:47,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:47,561 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:47,598 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:08:47,598 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:47,598 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:08:47,604 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:08:47,640 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:08:47,640 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:47,642 INFO ]: Computing forward predicates... [2018-06-24 21:08:47,803 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:08:47,822 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:47,822 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:08:47,823 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:08:47,823 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:08:47,823 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:08:47,823 INFO ]: Start difference. First operand 53 states and 353 transitions. Second operand 10 states. [2018-06-24 21:08:48,092 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:48,092 INFO ]: Finished difference Result 70 states and 441 transitions. [2018-06-24 21:08:48,094 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:08:48,094 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 21:08:48,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:48,095 INFO ]: With dead ends: 70 [2018-06-24 21:08:48,095 INFO ]: Without dead ends: 70 [2018-06-24 21:08:48,095 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:08:48,095 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-24 21:08:48,102 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 65. [2018-06-24 21:08:48,102 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-24 21:08:48,104 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 414 transitions. [2018-06-24 21:08:48,105 INFO ]: Start accepts. Automaton has 65 states and 414 transitions. Word has length 8 [2018-06-24 21:08:48,105 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:48,105 INFO ]: Abstraction has 65 states and 414 transitions. [2018-06-24 21:08:48,105 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:08:48,105 INFO ]: Start isEmpty. Operand 65 states and 414 transitions. [2018-06-24 21:08:48,106 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:08:48,106 INFO ]: Found error trace [2018-06-24 21:08:48,106 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:48,106 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:48,106 INFO ]: Analyzing trace with hash 443156203, now seen corresponding path program 2 times [2018-06-24 21:08:48,106 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:48,106 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:48,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:48,106 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:08:48,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:48,114 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:48,156 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:08:48,156 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:48,156 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:08:48,164 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:08:48,176 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:08:48,176 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:48,177 INFO ]: Computing forward predicates... [2018-06-24 21:08:48,330 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:08:48,349 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:48,349 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-24 21:08:48,349 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:08:48,349 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:08:48,349 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:08:48,349 INFO ]: Start difference. First operand 65 states and 414 transitions. Second operand 9 states. [2018-06-24 21:08:55,572 WARN ]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-06-24 21:08:55,827 WARN ]: Spent 226.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2018-06-24 21:08:59,417 WARN ]: Spent 672.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2018-06-24 21:09:02,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:02,044 INFO ]: Finished difference Result 92 states and 548 transitions. [2018-06-24 21:09:02,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:09:02,046 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-24 21:09:02,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:02,048 INFO ]: With dead ends: 92 [2018-06-24 21:09:02,048 INFO ]: Without dead ends: 92 [2018-06-24 21:09:02,048 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=73, Invalid=164, Unknown=3, NotChecked=0, Total=240 [2018-06-24 21:09:02,048 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-24 21:09:02,062 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 78. [2018-06-24 21:09:02,062 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-24 21:09:02,064 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 498 transitions. [2018-06-24 21:09:02,064 INFO ]: Start accepts. Automaton has 78 states and 498 transitions. Word has length 8 [2018-06-24 21:09:02,064 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:02,064 INFO ]: Abstraction has 78 states and 498 transitions. [2018-06-24 21:09:02,064 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:09:02,064 INFO ]: Start isEmpty. Operand 78 states and 498 transitions. [2018-06-24 21:09:02,065 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:02,065 INFO ]: Found error trace [2018-06-24 21:09:02,065 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:02,065 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:02,065 INFO ]: Analyzing trace with hash 710095411, now seen corresponding path program 1 times [2018-06-24 21:09:02,065 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:02,065 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:02,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:02,075 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:02,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:02,082 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:02,157 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:02,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:09:02,157 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:09:02,158 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:09:02,158 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:09:02,158 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:09:02,158 INFO ]: Start difference. First operand 78 states and 498 transitions. Second operand 3 states. [2018-06-24 21:09:02,298 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:02,298 INFO ]: Finished difference Result 79 states and 499 transitions. [2018-06-24 21:09:02,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:09:02,298 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 21:09:02,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:02,300 INFO ]: With dead ends: 79 [2018-06-24 21:09:02,300 INFO ]: Without dead ends: 78 [2018-06-24 21:09:02,300 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:02,300 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-24 21:09:02,306 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-06-24 21:09:02,306 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-24 21:09:02,310 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 472 transitions. [2018-06-24 21:09:02,310 INFO ]: Start accepts. Automaton has 78 states and 472 transitions. Word has length 9 [2018-06-24 21:09:02,310 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:02,310 INFO ]: Abstraction has 78 states and 472 transitions. [2018-06-24 21:09:02,310 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:09:02,310 INFO ]: Start isEmpty. Operand 78 states and 472 transitions. [2018-06-24 21:09:02,311 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:02,311 INFO ]: Found error trace [2018-06-24 21:09:02,311 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:02,311 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:02,311 INFO ]: Analyzing trace with hash 709737919, now seen corresponding path program 1 times [2018-06-24 21:09:02,311 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:02,311 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:02,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:02,312 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:02,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:02,327 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:02,402 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:02,402 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:09:02,402 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:09:02,403 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:09:02,403 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:09:02,403 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:09:02,403 INFO ]: Start difference. First operand 78 states and 472 transitions. Second operand 3 states. [2018-06-24 21:09:02,495 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:02,496 INFO ]: Finished difference Result 79 states and 474 transitions. [2018-06-24 21:09:02,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:09:02,496 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 21:09:02,496 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:02,497 INFO ]: With dead ends: 79 [2018-06-24 21:09:02,497 INFO ]: Without dead ends: 79 [2018-06-24 21:09:02,497 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:02,497 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-24 21:09:02,506 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-06-24 21:09:02,506 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-24 21:09:02,511 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 474 transitions. [2018-06-24 21:09:02,511 INFO ]: Start accepts. Automaton has 79 states and 474 transitions. Word has length 9 [2018-06-24 21:09:02,511 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:02,511 INFO ]: Abstraction has 79 states and 474 transitions. [2018-06-24 21:09:02,511 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:09:02,511 INFO ]: Start isEmpty. Operand 79 states and 474 transitions. [2018-06-24 21:09:02,512 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:02,512 INFO ]: Found error trace [2018-06-24 21:09:02,512 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:02,512 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:02,512 INFO ]: Analyzing trace with hash 709857083, now seen corresponding path program 1 times [2018-06-24 21:09:02,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:02,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:02,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:02,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:02,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:02,527 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:02,711 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:02,711 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:02,711 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:09:02,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:02,754 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:02,755 INFO ]: Computing forward predicates... [2018-06-24 21:09:02,764 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:02,796 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:02,796 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 21:09:02,796 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:09:02,796 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:09:02,796 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:09:02,796 INFO ]: Start difference. First operand 79 states and 474 transitions. Second operand 6 states. [2018-06-24 21:09:03,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:03,230 INFO ]: Finished difference Result 87 states and 522 transitions. [2018-06-24 21:09:03,230 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:09:03,230 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-24 21:09:03,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:03,231 INFO ]: With dead ends: 87 [2018-06-24 21:09:03,231 INFO ]: Without dead ends: 87 [2018-06-24 21:09:03,232 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:09:03,232 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-24 21:09:03,236 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 79. [2018-06-24 21:09:03,236 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-24 21:09:03,238 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 474 transitions. [2018-06-24 21:09:03,238 INFO ]: Start accepts. Automaton has 79 states and 474 transitions. Word has length 9 [2018-06-24 21:09:03,238 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:03,238 INFO ]: Abstraction has 79 states and 474 transitions. [2018-06-24 21:09:03,238 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:09:03,238 INFO ]: Start isEmpty. Operand 79 states and 474 transitions. [2018-06-24 21:09:03,239 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:03,239 INFO ]: Found error trace [2018-06-24 21:09:03,239 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-06-24 21:09:03,239 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:03,239 INFO ]: Analyzing trace with hash -1867333284, now seen corresponding path program 5 times [2018-06-24 21:09:03,239 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:03,239 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:03,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:03,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:03,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:03,248 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:03,302 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:09:03,302 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:03,302 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:09:03,308 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:09:03,360 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 21:09:03,360 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:03,362 INFO ]: Computing forward predicates... [2018-06-24 21:09:03,390 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:09:03,410 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:03,410 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 21:09:03,410 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:09:03,410 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:09:03,410 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:09:03,410 INFO ]: Start difference. First operand 79 states and 474 transitions. Second operand 6 states. [2018-06-24 21:09:03,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:03,712 INFO ]: Finished difference Result 132 states and 724 transitions. [2018-06-24 21:09:03,713 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:09:03,713 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-24 21:09:03,713 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:03,714 INFO ]: With dead ends: 132 [2018-06-24 21:09:03,714 INFO ]: Without dead ends: 132 [2018-06-24 21:09:03,715 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:09:03,715 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-24 21:09:03,725 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 96. [2018-06-24 21:09:03,725 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-24 21:09:03,726 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 604 transitions. [2018-06-24 21:09:03,726 INFO ]: Start accepts. Automaton has 96 states and 604 transitions. Word has length 9 [2018-06-24 21:09:03,726 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:03,726 INFO ]: Abstraction has 96 states and 604 transitions. [2018-06-24 21:09:03,726 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:09:03,726 INFO ]: Start isEmpty. Operand 96 states and 604 transitions. [2018-06-24 21:09:03,728 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:03,728 INFO ]: Found error trace [2018-06-24 21:09:03,728 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:03,728 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:03,728 INFO ]: Analyzing trace with hash -1867273702, now seen corresponding path program 6 times [2018-06-24 21:09:03,728 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:03,728 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:03,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:03,728 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:03,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:03,736 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:03,826 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:09:03,826 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:03,826 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:09:03,832 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:09:03,854 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 21:09:03,854 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:03,856 INFO ]: Computing forward predicates... [2018-06-24 21:09:04,089 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:09:04,112 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:04,112 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:09:04,112 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:09:04,112 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:09:04,113 INFO ]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:09:04,113 INFO ]: Start difference. First operand 96 states and 604 transitions. Second operand 12 states. [2018-06-24 21:09:14,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:14,355 INFO ]: Finished difference Result 211 states and 1250 transitions. [2018-06-24 21:09:14,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:09:14,356 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 21:09:14,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:14,359 INFO ]: With dead ends: 211 [2018-06-24 21:09:14,359 INFO ]: Without dead ends: 211 [2018-06-24 21:09:14,359 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:09:14,359 INFO ]: Start minimizeSevpa. Operand 211 states. [2018-06-24 21:09:14,378 INFO ]: Finished minimizeSevpa. Reduced states from 211 to 106. [2018-06-24 21:09:14,378 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-24 21:09:14,379 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 670 transitions. [2018-06-24 21:09:14,379 INFO ]: Start accepts. Automaton has 106 states and 670 transitions. Word has length 9 [2018-06-24 21:09:14,379 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:14,379 INFO ]: Abstraction has 106 states and 670 transitions. [2018-06-24 21:09:14,379 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:09:14,379 INFO ]: Start isEmpty. Operand 106 states and 670 transitions. [2018-06-24 21:09:14,380 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:14,380 INFO ]: Found error trace [2018-06-24 21:09:14,380 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:14,380 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:14,381 INFO ]: Analyzing trace with hash -1811862442, now seen corresponding path program 7 times [2018-06-24 21:09:14,381 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:14,381 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:14,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:14,388 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:14,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:14,397 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:14,527 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:09:14,527 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:14,527 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:09:14,534 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:14,547 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:14,549 INFO ]: Computing forward predicates... [2018-06-24 21:09:15,263 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:09:15,282 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:15,282 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:09:15,282 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:09:15,282 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:09:15,282 INFO ]: CoverageRelationStatistics Valid=23, Invalid=108, Unknown=1, NotChecked=0, Total=132 [2018-06-24 21:09:15,282 INFO ]: Start difference. First operand 106 states and 670 transitions. Second operand 12 states. [2018-06-24 21:09:23,623 WARN ]: Spent 1.41 s on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-06-24 21:09:24,543 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-06-24 21:09:33,012 WARN ]: Spent 2.35 s on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2018-06-24 21:09:41,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:41,216 INFO ]: Finished difference Result 340 states and 1989 transitions. [2018-06-24 21:09:41,218 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 21:09:41,218 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 21:09:41,218 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:41,222 INFO ]: With dead ends: 340 [2018-06-24 21:09:41,222 INFO ]: Without dead ends: 340 [2018-06-24 21:09:41,222 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=424, Invalid=1294, Unknown=4, NotChecked=0, Total=1722 [2018-06-24 21:09:41,223 INFO ]: Start minimizeSevpa. Operand 340 states. [2018-06-24 21:09:41,231 INFO ]: Finished minimizeSevpa. Reduced states from 340 to 157. [2018-06-24 21:09:41,231 INFO ]: Start removeUnreachable. Operand 157 states. [2018-06-24 21:09:41,232 INFO ]: Finished removeUnreachable. Reduced from 157 states to 157 states and 977 transitions. [2018-06-24 21:09:41,233 INFO ]: Start accepts. Automaton has 157 states and 977 transitions. Word has length 9 [2018-06-24 21:09:41,233 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:41,233 INFO ]: Abstraction has 157 states and 977 transitions. [2018-06-24 21:09:41,233 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:09:41,233 INFO ]: Start isEmpty. Operand 157 states and 977 transitions. [2018-06-24 21:09:41,235 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:41,235 INFO ]: Found error trace [2018-06-24 21:09:41,235 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:41,235 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:41,235 INFO ]: Analyzing trace with hash -1810074982, now seen corresponding path program 8 times [2018-06-24 21:09:41,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:41,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:41,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:41,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:41,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:41,243 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:41,467 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:09:41,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:41,468 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:09:41,473 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:09:41,488 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:09:41,488 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:41,490 INFO ]: Computing forward predicates... [2018-06-24 21:09:41,557 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:09:41,577 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:41,577 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:09:41,577 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:09:41,577 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:09:41,577 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:09:41,577 INFO ]: Start difference. First operand 157 states and 977 transitions. Second operand 12 states. [2018-06-24 21:09:41,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:41,866 INFO ]: Finished difference Result 247 states and 1436 transitions. [2018-06-24 21:09:41,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:09:41,871 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 21:09:41,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:41,873 INFO ]: With dead ends: 247 [2018-06-24 21:09:41,873 INFO ]: Without dead ends: 247 [2018-06-24 21:09:41,874 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:09:41,874 INFO ]: Start minimizeSevpa. Operand 247 states. [2018-06-24 21:09:41,881 INFO ]: Finished minimizeSevpa. Reduced states from 247 to 162. [2018-06-24 21:09:41,881 INFO ]: Start removeUnreachable. Operand 162 states. [2018-06-24 21:09:41,883 INFO ]: Finished removeUnreachable. Reduced from 162 states to 162 states and 1005 transitions. [2018-06-24 21:09:41,883 INFO ]: Start accepts. Automaton has 162 states and 1005 transitions. Word has length 9 [2018-06-24 21:09:41,883 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:41,883 INFO ]: Abstraction has 162 states and 1005 transitions. [2018-06-24 21:09:41,883 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:09:41,883 INFO ]: Start isEmpty. Operand 162 states and 1005 transitions. [2018-06-24 21:09:41,884 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:41,884 INFO ]: Found error trace [2018-06-24 21:09:41,884 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 21:09:41,884 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:41,884 INFO ]: Analyzing trace with hash -1810015400, now seen corresponding path program 3 times [2018-06-24 21:09:41,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:41,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:41,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:41,885 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:41,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:41,897 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:42,081 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-24 21:09:42,148 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:09:42,148 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:42,148 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:09:42,154 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:09:42,168 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:09:42,168 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:42,171 INFO ]: Computing forward predicates... [2018-06-24 21:09:42,532 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:09:42,550 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:42,550 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-24 21:09:42,550 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:09:42,550 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:09:42,551 INFO ]: CoverageRelationStatistics Valid=32, Invalid=77, Unknown=1, NotChecked=0, Total=110 [2018-06-24 21:09:42,551 INFO ]: Start difference. First operand 162 states and 1005 transitions. Second operand 11 states. Received shutdown request... [2018-06-24 21:09:54,293 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:09:54,293 WARN ]: Verification canceled [2018-06-24 21:09:54,296 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:09:54,297 WARN ]: Timeout [2018-06-24 21:09:54,297 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:09:54 BasicIcfg [2018-06-24 21:09:54,297 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:09:54,298 INFO ]: Toolchain (without parser) took 76814.46 ms. Allocated memory was 304.1 MB in the beginning and 552.6 MB in the end (delta: 248.5 MB). Free memory was 256.5 MB in the beginning and 377.3 MB in the end (delta: -120.8 MB). Peak memory consumption was 127.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:09:54,299 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:09:54,299 INFO ]: ChcToBoogie took 78.60 ms. Allocated memory is still 304.1 MB. Free memory was 255.5 MB in the beginning and 253.5 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:09:54,299 INFO ]: Boogie Preprocessor took 52.37 ms. Allocated memory is still 304.1 MB. Free memory was 253.5 MB in the beginning and 252.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 21:09:54,300 INFO ]: RCFGBuilder took 596.13 ms. Allocated memory is still 304.1 MB. Free memory was 252.5 MB in the beginning and 235.5 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:09:54,300 INFO ]: BlockEncodingV2 took 117.60 ms. Allocated memory is still 304.1 MB. Free memory was 235.5 MB in the beginning and 232.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:09:54,301 INFO ]: TraceAbstraction took 75960.18 ms. Allocated memory was 304.1 MB in the beginning and 552.6 MB in the end (delta: 248.5 MB). Free memory was 232.5 MB in the beginning and 377.3 MB in the end (delta: -144.8 MB). Peak memory consumption was 103.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:09:54,310 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 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 78.60 ms. Allocated memory is still 304.1 MB. Free memory was 255.5 MB in the beginning and 253.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 52.37 ms. Allocated memory is still 304.1 MB. Free memory was 253.5 MB in the beginning and 252.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 596.13 ms. Allocated memory is still 304.1 MB. Free memory was 252.5 MB in the beginning and 235.5 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 117.60 ms. Allocated memory is still 304.1 MB. Free memory was 235.5 MB in the beginning and 232.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 75960.18 ms. Allocated memory was 304.1 MB in the beginning and 552.6 MB in the end (delta: 248.5 MB). Free memory was 232.5 MB in the beginning and 377.3 MB in the end (delta: -144.8 MB). Peak memory consumption was 103.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) 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, 75.8s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 69.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 404 SDtfs, 519 SDslu, 1425 SDs, 0 SdLazy, 2724 SolverSat, 829 SolverUnsat, 65 SolverUnknown, 0 SolverNotchecked, 54.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred 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, 521 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s 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/025b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-09-54-324.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-09-54-324.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-09-54-324.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-09-54-324.csv Completed graceful shutdown