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/Consistency/ch-triangle-location-nr.6.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:19:32,295 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:19:32,297 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:19:32,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:19:32,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:19:32,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:19:32,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:19:32,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:19:32,318 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:19:32,319 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:19:32,321 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:19:32,321 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:19:32,322 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:19:32,322 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:19:32,326 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:19:32,326 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:19:32,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:19:32,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:19:32,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:19:32,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:19:32,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:19:32,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:19:32,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:19:32,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:19:32,349 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:19:32,350 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:19:32,350 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:19:32,351 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:19:32,355 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:19:32,355 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:19:32,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:19:32,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:19:32,357 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:19:32,358 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:19:32,358 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:19:32,358 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:19:32,380 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:19:32,380 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:19:32,380 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:19:32,380 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:19:32,382 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:19:32,382 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:19:32,382 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:19:32,383 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:19:32,383 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:19:32,383 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:19:32,383 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:19:32,383 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:19:32,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:19:32,384 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:19:32,384 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:19:32,384 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:19:32,384 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:19:32,385 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:19:32,386 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:19:32,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:19:32,386 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:19:32,387 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:19:32,387 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:19:32,440 INFO ]: Repository-Root is: /tmp [2018-06-24 20:19:32,456 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:19:32,461 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:19:32,462 INFO ]: Initializing SmtParser... [2018-06-24 20:19:32,462 INFO ]: SmtParser initialized [2018-06-24 20:19:32,463 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.6.smt2 [2018-06-24 20:19:32,464 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 20:19:32,541 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.6.smt2 unknown [2018-06-24 20:19:32,956 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.6.smt2 [2018-06-24 20:19:32,960 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:19:32,966 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:19:32,966 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:19:32,966 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:19:32,966 INFO ]: ChcToBoogie initialized [2018-06-24 20:19:32,970 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:19:32" (1/1) ... [2018-06-24 20:19:33,052 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:19:33 Unit [2018-06-24 20:19:33,052 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:19:33,053 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:19:33,053 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:19:33,053 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:19:33,073 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:19:33" (1/1) ... [2018-06-24 20:19:33,073 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:19:33" (1/1) ... [2018-06-24 20:19:33,095 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:19:33" (1/1) ... [2018-06-24 20:19:33,095 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:19:33" (1/1) ... [2018-06-24 20:19:33,117 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:19:33" (1/1) ... [2018-06-24 20:19:33,121 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:19:33" (1/1) ... [2018-06-24 20:19:33,124 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:19:33" (1/1) ... [2018-06-24 20:19:33,128 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:19:33,129 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:19:33,129 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:19:33,129 INFO ]: RCFGBuilder initialized [2018-06-24 20:19:33,130 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:19:33" (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 20:19:33,172 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:19:33,172 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:19:33,172 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:19:33,172 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:19:33,172 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:19:33,172 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 20:19:34,516 INFO ]: Using library mode [2018-06-24 20:19:34,517 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:19:34 BoogieIcfgContainer [2018-06-24 20:19:34,517 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:19:34,517 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:19:34,517 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:19:34,518 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:19:34,519 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:19:34" (1/1) ... [2018-06-24 20:19:34,562 INFO ]: Initial Icfg 145 locations, 284 edges [2018-06-24 20:19:34,564 INFO ]: Using Remove infeasible edges [2018-06-24 20:19:34,564 INFO ]: Using Maximize final states [2018-06-24 20:19:34,565 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:19:34,565 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:19:34,567 INFO ]: Using Remove sink states [2018-06-24 20:19:34,567 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:19:34,568 INFO ]: Using Use SBE [2018-06-24 20:19:34,579 INFO ]: SBE split 0 edges [2018-06-24 20:19:34,586 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:19:34,588 INFO ]: 0 new accepting states [2018-06-24 20:19:35,413 INFO ]: Removed 64 edges and 9 locations by large block encoding [2018-06-24 20:19:35,417 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:19:35,421 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:19:35,422 INFO ]: 0 new accepting states [2018-06-24 20:19:35,424 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:19:35,427 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:19:35,429 INFO ]: Encoded RCFG 133 locations, 271 edges [2018-06-24 20:19:35,429 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:19:35 BasicIcfg [2018-06-24 20:19:35,429 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:19:35,433 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:19:35,433 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:19:35,436 INFO ]: TraceAbstraction initialized [2018-06-24 20:19:35,437 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:19:32" (1/4) ... [2018-06-24 20:19:35,438 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fff6e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:19:35, skipping insertion in model container [2018-06-24 20:19:35,438 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:19:33" (2/4) ... [2018-06-24 20:19:35,438 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fff6e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:19:35, skipping insertion in model container [2018-06-24 20:19:35,438 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:19:34" (3/4) ... [2018-06-24 20:19:35,438 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fff6e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:19:35, skipping insertion in model container [2018-06-24 20:19:35,438 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:19:35" (4/4) ... [2018-06-24 20:19:35,442 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:19:35,453 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:19:35,469 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:19:35,513 INFO ]: Using default assertion order modulation [2018-06-24 20:19:35,514 INFO ]: Interprodecural is true [2018-06-24 20:19:35,514 INFO ]: Hoare is false [2018-06-24 20:19:35,514 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:19:35,514 INFO ]: Backedges is TWOTRACK [2018-06-24 20:19:35,514 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:19:35,514 INFO ]: Difference is false [2018-06-24 20:19:35,514 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:19:35,514 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:19:35,532 INFO ]: Start isEmpty. Operand 133 states. [2018-06-24 20:19:35,595 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 20:19:35,595 INFO ]: Found error trace [2018-06-24 20:19:35,596 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 20:19:35,596 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:19:35,601 INFO ]: Analyzing trace with hash 5798289, now seen corresponding path program 1 times [2018-06-24 20:19:35,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:19:35,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:19:35,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:35,640 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:19:35,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:35,699 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:19:35,815 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:19:35,818 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:19:35,818 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:19:35,820 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:19:35,835 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:19:35,835 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:19:35,839 INFO ]: Start difference. First operand 133 states. Second operand 3 states. [2018-06-24 20:19:37,897 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:19:37,898 INFO ]: Finished difference Result 263 states and 538 transitions. [2018-06-24 20:19:37,901 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:19:37,902 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 20:19:37,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:19:37,949 INFO ]: With dead ends: 263 [2018-06-24 20:19:37,949 INFO ]: Without dead ends: 263 [2018-06-24 20:19:37,950 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 20:19:37,973 INFO ]: Start minimizeSevpa. Operand 263 states. [2018-06-24 20:19:38,082 INFO ]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-06-24 20:19:38,083 INFO ]: Start removeUnreachable. Operand 263 states. [2018-06-24 20:19:38,102 INFO ]: Finished removeUnreachable. Reduced from 263 states to 263 states and 538 transitions. [2018-06-24 20:19:38,104 INFO ]: Start accepts. Automaton has 263 states and 538 transitions. Word has length 4 [2018-06-24 20:19:38,104 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:19:38,105 INFO ]: Abstraction has 263 states and 538 transitions. [2018-06-24 20:19:38,105 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:19:38,105 INFO ]: Start isEmpty. Operand 263 states and 538 transitions. [2018-06-24 20:19:38,108 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 20:19:38,108 INFO ]: Found error trace [2018-06-24 20:19:38,108 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 20:19:38,109 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:19:38,111 INFO ]: Analyzing trace with hash 5800211, now seen corresponding path program 1 times [2018-06-24 20:19:38,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:19:38,111 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:19:38,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:38,112 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:19:38,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:38,132 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:19:38,229 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:19:38,229 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:19:38,229 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:19:38,231 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:19:38,231 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:19:38,231 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:19:38,231 INFO ]: Start difference. First operand 263 states and 538 transitions. Second operand 3 states. [2018-06-24 20:19:39,392 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:19:39,392 INFO ]: Finished difference Result 393 states and 806 transitions. [2018-06-24 20:19:39,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:19:39,392 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 20:19:39,392 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:19:39,406 INFO ]: With dead ends: 393 [2018-06-24 20:19:39,406 INFO ]: Without dead ends: 393 [2018-06-24 20:19:39,407 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 20:19:39,408 INFO ]: Start minimizeSevpa. Operand 393 states. [2018-06-24 20:19:39,524 INFO ]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-06-24 20:19:39,524 INFO ]: Start removeUnreachable. Operand 393 states. [2018-06-24 20:19:39,538 INFO ]: Finished removeUnreachable. Reduced from 393 states to 393 states and 806 transitions. [2018-06-24 20:19:39,538 INFO ]: Start accepts. Automaton has 393 states and 806 transitions. Word has length 4 [2018-06-24 20:19:39,538 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:19:39,538 INFO ]: Abstraction has 393 states and 806 transitions. [2018-06-24 20:19:39,538 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:19:39,538 INFO ]: Start isEmpty. Operand 393 states and 806 transitions. [2018-06-24 20:19:39,574 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:19:39,574 INFO ]: Found error trace [2018-06-24 20:19:39,574 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:19:39,575 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:19:39,575 INFO ]: Analyzing trace with hash -215896189, now seen corresponding path program 1 times [2018-06-24 20:19:39,575 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:19:39,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:19:39,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:39,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:19:39,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:39,600 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:19:39,678 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:19:39,678 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:19:39,678 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:19:39,679 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:19:39,679 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:19:39,679 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:19:39,679 INFO ]: Start difference. First operand 393 states and 806 transitions. Second operand 3 states. [2018-06-24 20:19:40,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:19:40,721 INFO ]: Finished difference Result 523 states and 1067 transitions. [2018-06-24 20:19:40,722 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:19:40,722 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 20:19:40,722 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:19:40,741 INFO ]: With dead ends: 523 [2018-06-24 20:19:40,741 INFO ]: Without dead ends: 523 [2018-06-24 20:19:40,742 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 20:19:40,742 INFO ]: Start minimizeSevpa. Operand 523 states. [2018-06-24 20:19:40,818 INFO ]: Finished minimizeSevpa. Reduced states from 523 to 523. [2018-06-24 20:19:40,818 INFO ]: Start removeUnreachable. Operand 523 states. [2018-06-24 20:19:40,833 INFO ]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1067 transitions. [2018-06-24 20:19:40,833 INFO ]: Start accepts. Automaton has 523 states and 1067 transitions. Word has length 9 [2018-06-24 20:19:40,833 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:19:40,833 INFO ]: Abstraction has 523 states and 1067 transitions. [2018-06-24 20:19:40,833 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:19:40,833 INFO ]: Start isEmpty. Operand 523 states and 1067 transitions. [2018-06-24 20:19:40,854 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:19:40,854 INFO ]: Found error trace [2018-06-24 20:19:40,854 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:19:40,854 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:19:40,854 INFO ]: Analyzing trace with hash 62163246, now seen corresponding path program 1 times [2018-06-24 20:19:40,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:19:40,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:19:40,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:40,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:19:40,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:40,901 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:19:41,025 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:19:41,025 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:19:41,026 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:19:41,026 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:19:41,026 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:19:41,026 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:19:41,026 INFO ]: Start difference. First operand 523 states and 1067 transitions. Second operand 5 states. [2018-06-24 20:19:42,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:19:42,259 INFO ]: Finished difference Result 817 states and 2248 transitions. [2018-06-24 20:19:42,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:19:42,260 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:19:42,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:19:42,319 INFO ]: With dead ends: 817 [2018-06-24 20:19:42,319 INFO ]: Without dead ends: 817 [2018-06-24 20:19:42,319 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:19:42,320 INFO ]: Start minimizeSevpa. Operand 817 states. [2018-06-24 20:19:42,504 INFO ]: Finished minimizeSevpa. Reduced states from 817 to 532. [2018-06-24 20:19:42,504 INFO ]: Start removeUnreachable. Operand 532 states. [2018-06-24 20:19:42,517 INFO ]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1123 transitions. [2018-06-24 20:19:42,517 INFO ]: Start accepts. Automaton has 532 states and 1123 transitions. Word has length 9 [2018-06-24 20:19:42,517 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:19:42,517 INFO ]: Abstraction has 532 states and 1123 transitions. [2018-06-24 20:19:42,517 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:19:42,517 INFO ]: Start isEmpty. Operand 532 states and 1123 transitions. [2018-06-24 20:19:42,537 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:19:42,537 INFO ]: Found error trace [2018-06-24 20:19:42,537 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:19:42,537 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:19:42,538 INFO ]: Analyzing trace with hash 62165168, now seen corresponding path program 1 times [2018-06-24 20:19:42,538 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:19:42,538 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:19:42,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:42,539 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:19:42,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:42,555 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:19:42,746 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:19:42,746 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:19:42,746 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:19:42,746 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:19:42,746 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:19:42,746 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:19:42,746 INFO ]: Start difference. First operand 532 states and 1123 transitions. Second operand 5 states. [2018-06-24 20:19:45,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:19:45,147 INFO ]: Finished difference Result 817 states and 2244 transitions. [2018-06-24 20:19:45,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:19:45,147 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:19:45,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:19:45,191 INFO ]: With dead ends: 817 [2018-06-24 20:19:45,192 INFO ]: Without dead ends: 817 [2018-06-24 20:19:45,192 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:19:45,192 INFO ]: Start minimizeSevpa. Operand 817 states. [2018-06-24 20:19:45,371 INFO ]: Finished minimizeSevpa. Reduced states from 817 to 532. [2018-06-24 20:19:45,371 INFO ]: Start removeUnreachable. Operand 532 states. [2018-06-24 20:19:45,382 INFO ]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1119 transitions. [2018-06-24 20:19:45,382 INFO ]: Start accepts. Automaton has 532 states and 1119 transitions. Word has length 9 [2018-06-24 20:19:45,382 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:19:45,382 INFO ]: Abstraction has 532 states and 1119 transitions. [2018-06-24 20:19:45,382 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:19:45,382 INFO ]: Start isEmpty. Operand 532 states and 1119 transitions. [2018-06-24 20:19:45,397 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:19:45,397 INFO ]: Found error trace [2018-06-24 20:19:45,397 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:19:45,397 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:19:45,397 INFO ]: Analyzing trace with hash 62170934, now seen corresponding path program 1 times [2018-06-24 20:19:45,397 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:19:45,397 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:19:45,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:45,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:19:45,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:45,415 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:19:45,487 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:19:45,488 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:19:45,488 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:19:45,488 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:19:45,488 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:19:45,488 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:19:45,488 INFO ]: Start difference. First operand 532 states and 1119 transitions. Second operand 5 states. [2018-06-24 20:19:46,872 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:19:46,872 INFO ]: Finished difference Result 817 states and 2240 transitions. [2018-06-24 20:19:46,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:19:46,873 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:19:46,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:19:46,918 INFO ]: With dead ends: 817 [2018-06-24 20:19:46,918 INFO ]: Without dead ends: 817 [2018-06-24 20:19:46,918 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:19:46,919 INFO ]: Start minimizeSevpa. Operand 817 states. [2018-06-24 20:19:47,122 INFO ]: Finished minimizeSevpa. Reduced states from 817 to 532. [2018-06-24 20:19:47,123 INFO ]: Start removeUnreachable. Operand 532 states. [2018-06-24 20:19:47,133 INFO ]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1115 transitions. [2018-06-24 20:19:47,133 INFO ]: Start accepts. Automaton has 532 states and 1115 transitions. Word has length 9 [2018-06-24 20:19:47,133 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:19:47,133 INFO ]: Abstraction has 532 states and 1115 transitions. [2018-06-24 20:19:47,133 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:19:47,133 INFO ]: Start isEmpty. Operand 532 states and 1115 transitions. [2018-06-24 20:19:47,150 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:19:47,150 INFO ]: Found error trace [2018-06-24 20:19:47,150 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:19:47,150 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:19:47,150 INFO ]: Analyzing trace with hash -1228785642, now seen corresponding path program 1 times [2018-06-24 20:19:47,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:19:47,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:19:47,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:47,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:19:47,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:47,176 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:19:47,456 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:19:47,456 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:19:47,456 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:19:47,456 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:19:47,456 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:19:47,456 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:19:47,457 INFO ]: Start difference. First operand 532 states and 1115 transitions. Second operand 5 states. [2018-06-24 20:19:48,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:19:48,540 INFO ]: Finished difference Result 1025 states and 2885 transitions. [2018-06-24 20:19:48,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:19:48,541 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:19:48,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:19:48,591 INFO ]: With dead ends: 1025 [2018-06-24 20:19:48,591 INFO ]: Without dead ends: 1025 [2018-06-24 20:19:48,591 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:19:48,592 INFO ]: Start minimizeSevpa. Operand 1025 states. [2018-06-24 20:19:48,849 INFO ]: Finished minimizeSevpa. Reduced states from 1025 to 795. [2018-06-24 20:19:48,850 INFO ]: Start removeUnreachable. Operand 795 states. [2018-06-24 20:19:48,873 INFO ]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1684 transitions. [2018-06-24 20:19:48,874 INFO ]: Start accepts. Automaton has 795 states and 1684 transitions. Word has length 9 [2018-06-24 20:19:48,874 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:19:48,874 INFO ]: Abstraction has 795 states and 1684 transitions. [2018-06-24 20:19:48,874 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:19:48,874 INFO ]: Start isEmpty. Operand 795 states and 1684 transitions. [2018-06-24 20:19:48,898 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:19:48,899 INFO ]: Found error trace [2018-06-24 20:19:48,899 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:19:48,899 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:19:48,899 INFO ]: Analyzing trace with hash 380662508, now seen corresponding path program 1 times [2018-06-24 20:19:48,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:19:48,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:19:48,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:48,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:19:48,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:48,914 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:19:49,064 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:19:49,064 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:19:49,065 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:19:49,065 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:19:49,065 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:19:49,065 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:19:49,065 INFO ]: Start difference. First operand 795 states and 1684 transitions. Second operand 6 states. [2018-06-24 20:19:55,070 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:19:55,071 INFO ]: Finished difference Result 1932 states and 8210 transitions. [2018-06-24 20:19:55,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:19:55,072 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:19:55,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:19:55,214 INFO ]: With dead ends: 1932 [2018-06-24 20:19:55,214 INFO ]: Without dead ends: 1932 [2018-06-24 20:19:55,214 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:19:55,215 INFO ]: Start minimizeSevpa. Operand 1932 states. [2018-06-24 20:19:55,879 INFO ]: Finished minimizeSevpa. Reduced states from 1932 to 1283. [2018-06-24 20:19:55,879 INFO ]: Start removeUnreachable. Operand 1283 states. [2018-06-24 20:19:55,906 INFO ]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 3654 transitions. [2018-06-24 20:19:55,907 INFO ]: Start accepts. Automaton has 1283 states and 3654 transitions. Word has length 10 [2018-06-24 20:19:55,907 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:19:55,907 INFO ]: Abstraction has 1283 states and 3654 transitions. [2018-06-24 20:19:55,907 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:19:55,907 INFO ]: Start isEmpty. Operand 1283 states and 3654 transitions. [2018-06-24 20:19:55,925 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:19:55,925 INFO ]: Found error trace [2018-06-24 20:19:55,925 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:19:55,925 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:19:55,926 INFO ]: Analyzing trace with hash 409291659, now seen corresponding path program 1 times [2018-06-24 20:19:55,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:19:55,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:19:55,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:55,926 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:19:55,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:19:55,938 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:19:55,992 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:19:55,992 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:19:55,992 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:19:55,993 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:19:55,993 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:19:55,993 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:19:55,993 INFO ]: Start difference. First operand 1283 states and 3654 transitions. Second operand 6 states. [2018-06-24 20:20:00,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:00,603 INFO ]: Finished difference Result 2983 states and 14614 transitions. [2018-06-24 20:20:00,604 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:20:00,604 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:20:00,604 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:00,895 INFO ]: With dead ends: 2983 [2018-06-24 20:20:00,895 INFO ]: Without dead ends: 2983 [2018-06-24 20:20:00,895 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:20:00,896 INFO ]: Start minimizeSevpa. Operand 2983 states. [2018-06-24 20:20:01,972 INFO ]: Finished minimizeSevpa. Reduced states from 2983 to 2169. [2018-06-24 20:20:01,972 INFO ]: Start removeUnreachable. Operand 2169 states. [2018-06-24 20:20:02,091 INFO ]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 7254 transitions. [2018-06-24 20:20:02,091 INFO ]: Start accepts. Automaton has 2169 states and 7254 transitions. Word has length 10 [2018-06-24 20:20:02,091 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:02,091 INFO ]: Abstraction has 2169 states and 7254 transitions. [2018-06-24 20:20:02,091 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:20:02,091 INFO ]: Start isEmpty. Operand 2169 states and 7254 transitions. [2018-06-24 20:20:02,121 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:20:02,121 INFO ]: Found error trace [2018-06-24 20:20:02,121 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:02,121 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:02,122 INFO ]: Analyzing trace with hash 1554457699, now seen corresponding path program 1 times [2018-06-24 20:20:02,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:02,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:02,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:02,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:02,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:02,134 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:02,161 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:02,161 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:02,161 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:20:02,162 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:20:02,162 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:20:02,162 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:20:02,162 INFO ]: Start difference. First operand 2169 states and 7254 transitions. Second operand 3 states. [2018-06-24 20:20:02,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:02,802 INFO ]: Finished difference Result 2803 states and 8980 transitions. [2018-06-24 20:20:02,807 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:20:02,807 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 20:20:02,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:03,011 INFO ]: With dead ends: 2803 [2018-06-24 20:20:03,011 INFO ]: Without dead ends: 2803 [2018-06-24 20:20:03,011 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 20:20:03,013 INFO ]: Start minimizeSevpa. Operand 2803 states. [2018-06-24 20:20:03,605 INFO ]: Finished minimizeSevpa. Reduced states from 2803 to 2781. [2018-06-24 20:20:03,605 INFO ]: Start removeUnreachable. Operand 2781 states. [2018-06-24 20:20:05,125 INFO ]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 8936 transitions. [2018-06-24 20:20:05,125 INFO ]: Start accepts. Automaton has 2781 states and 8936 transitions. Word has length 10 [2018-06-24 20:20:05,125 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:05,125 INFO ]: Abstraction has 2781 states and 8936 transitions. [2018-06-24 20:20:05,125 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:20:05,125 INFO ]: Start isEmpty. Operand 2781 states and 8936 transitions. [2018-06-24 20:20:05,145 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:20:05,145 INFO ]: Found error trace [2018-06-24 20:20:05,145 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:05,145 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:05,145 INFO ]: Analyzing trace with hash 1919552351, now seen corresponding path program 1 times [2018-06-24 20:20:05,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:05,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:05,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:05,146 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:05,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:05,156 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:05,247 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:05,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:05,247 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:20:05,247 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:20:05,247 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:20:05,247 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:20:05,247 INFO ]: Start difference. First operand 2781 states and 8936 transitions. Second operand 6 states. [2018-06-24 20:20:07,788 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:07,788 INFO ]: Finished difference Result 5905 states and 27522 transitions. [2018-06-24 20:20:07,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:20:07,789 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:20:07,789 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:08,472 INFO ]: With dead ends: 5905 [2018-06-24 20:20:08,472 INFO ]: Without dead ends: 5905 [2018-06-24 20:20:08,472 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:20:08,475 INFO ]: Start minimizeSevpa. Operand 5905 states. [2018-06-24 20:20:10,593 INFO ]: Finished minimizeSevpa. Reduced states from 5905 to 2781. [2018-06-24 20:20:10,593 INFO ]: Start removeUnreachable. Operand 2781 states. [2018-06-24 20:20:10,717 INFO ]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 8936 transitions. [2018-06-24 20:20:10,718 INFO ]: Start accepts. Automaton has 2781 states and 8936 transitions. Word has length 10 [2018-06-24 20:20:10,718 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:10,718 INFO ]: Abstraction has 2781 states and 8936 transitions. [2018-06-24 20:20:10,718 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:20:10,718 INFO ]: Start isEmpty. Operand 2781 states and 8936 transitions. [2018-06-24 20:20:10,748 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:20:10,748 INFO ]: Found error trace [2018-06-24 20:20:10,748 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:10,748 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:10,748 INFO ]: Analyzing trace with hash 1926940519, now seen corresponding path program 1 times [2018-06-24 20:20:10,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:10,748 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:10,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:10,750 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:10,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:10,763 INFO ]: Conjunction of SSA is sat [2018-06-24 20:20:10,767 INFO ]: Counterexample might be feasible [2018-06-24 20:20:10,781 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:20:10,782 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:20:10 BasicIcfg [2018-06-24 20:20:10,782 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:20:10,783 INFO ]: Toolchain (without parser) took 37822.25 ms. Allocated memory was 306.7 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 250.1 MB in the beginning and 790.4 MB in the end (delta: -540.3 MB). Peak memory consumption was 783.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:20:10,785 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:20:10,786 INFO ]: ChcToBoogie took 86.64 ms. Allocated memory is still 306.7 MB. Free memory was 250.1 MB in the beginning and 247.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:20:10,786 INFO ]: Boogie Preprocessor took 75.09 ms. Allocated memory is still 306.7 MB. Free memory was 247.1 MB in the beginning and 245.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:20:10,787 INFO ]: RCFGBuilder took 1388.14 ms. Allocated memory was 306.7 MB in the beginning and 325.1 MB in the end (delta: 18.4 MB). Free memory was 244.2 MB in the beginning and 288.3 MB in the end (delta: -44.2 MB). Peak memory consumption was 65.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:20:10,787 INFO ]: BlockEncodingV2 took 912.23 ms. Allocated memory is still 325.1 MB. Free memory was 288.3 MB in the beginning and 249.0 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:20:10,788 INFO ]: TraceAbstraction took 35349.17 ms. Allocated memory was 325.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 249.0 MB in the beginning and 790.4 MB in the end (delta: -541.4 MB). Peak memory consumption was 763.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:20:10,794 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 145 locations, 284 edges - StatisticsResult: Encoded RCFG 133 locations, 271 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 86.64 ms. Allocated memory is still 306.7 MB. Free memory was 250.1 MB in the beginning and 247.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 75.09 ms. Allocated memory is still 306.7 MB. Free memory was 247.1 MB in the beginning and 245.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1388.14 ms. Allocated memory was 306.7 MB in the beginning and 325.1 MB in the end (delta: 18.4 MB). Free memory was 244.2 MB in the beginning and 288.3 MB in the end (delta: -44.2 MB). Peak memory consumption was 65.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 912.23 ms. Allocated memory is still 325.1 MB. Free memory was 288.3 MB in the beginning and 249.0 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 35349.17 ms. Allocated memory was 325.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 249.0 MB in the beginning and 790.4 MB in the end (delta: -541.4 MB). Peak memory consumption was 763.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assume true; [L0] CALL call gotoProc(1, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int); [L0] RET call gotoProc(1, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int); [L0] hhv_combined_lturn_0_Int, hhv_combined_lturn_1_Int, hhv_combined_lturn_2_Int, hhv_combined_lturn_3_Int, hhv_combined_lturn_4_Int, hhv_combined_lturn_5_Int, hhv_combined_lturn_6_Int, hhv_combined_lturn_7_Int, hhv_combined_lturn_8_Int, hhv_combined_lturn_9_Int, hhv_combined_lturn_10_Int, hhv_combined_lturn_11_Int := hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int; [L0] havoc hbv_False_4_Int, hbv_False_5_Int, hbv_False_8_Int, hbv_False_11_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_12_Int, hbv_False_6_Int, hbv_False_1_Int, hbv_False_3_Int, hbv_False_7_Int, hbv_False_2_Int; [L0] assume true; [L0] hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_8_Int, hhv_step_lturn_9_Int, hhv_step_lturn_10_Int, hhv_step_lturn_11_Int := hhv_lturn_0_Int, hhv_lturn_1_Int, hhv_lturn_2_Int, hhv_lturn_3_Int, hhv_lturn_4_Int, hhv_lturn_5_Int, hhv_lturn_6_Int, hhv_lturn_7_Int, hhv_lturn_9_Int, hhv_lturn_10_Int, hhv_lturn_8_Int, hhv_lturn_11_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 1 error locations. UNSAFE Result, 35.2s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 25.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7710 SDtfs, 1136 SDslu, 14206 SDs, 0 SdLazy, 11545 SolverSat, 3006 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2781occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 5694 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 1530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 19/19 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ch-triangle-location-nr.6.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-20-10-806.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ch-triangle-location-nr.6.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-20-10-806.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ch-triangle-location-nr.6.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-20-10-806.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ch-triangle-location-nr.6.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-20-10-806.csv Received shutdown request...