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/point-location.44.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:34:43,581 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:34:43,583 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:34:43,596 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:34:43,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:34:43,597 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:34:43,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:34:43,602 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:34:43,603 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:34:43,604 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:34:43,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:34:43,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:34:43,607 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:34:43,608 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:34:43,608 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:34:43,609 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:34:43,612 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:34:43,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:34:43,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:34:43,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:34:43,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:34:43,628 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:34:43,628 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:34:43,628 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:34:43,631 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:34:43,632 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:34:43,632 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:34:43,633 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:34:43,634 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:34:43,634 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:34:43,635 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:34:43,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:34:43,636 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:34:43,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:34:43,637 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:34:43,638 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:34:43,651 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:34:43,651 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:34:43,651 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:34:43,652 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:34:43,652 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:34:43,653 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:34:43,653 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:34:43,653 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:34:43,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:34:43,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:34:43,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:34:43,654 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:34:43,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:34:43,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:34:43,654 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:34:43,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:34:43,655 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:34:43,655 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:34:43,655 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:34:43,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:34:43,655 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:34:43,656 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:34:43,657 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:34:43,702 INFO ]: Repository-Root is: /tmp [2018-06-24 20:34:43,715 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:34:43,718 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:34:43,719 INFO ]: Initializing SmtParser... [2018-06-24 20:34:43,720 INFO ]: SmtParser initialized [2018-06-24 20:34:43,720 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.44.smt2 [2018-06-24 20:34:43,721 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:34:43,807 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.44.smt2 unknown [2018-06-24 20:34:44,380 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.44.smt2 [2018-06-24 20:34:44,384 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:34:44,391 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:34:44,391 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:34:44,391 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:34:44,392 INFO ]: ChcToBoogie initialized [2018-06-24 20:34:44,395 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:34:44" (1/1) ... [2018-06-24 20:34:44,494 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:44 Unit [2018-06-24 20:34:44,494 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:34:44,494 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:34:44,494 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:34:44,494 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:34:44,515 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:44" (1/1) ... [2018-06-24 20:34:44,515 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:44" (1/1) ... [2018-06-24 20:34:44,536 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:44" (1/1) ... [2018-06-24 20:34:44,536 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:44" (1/1) ... [2018-06-24 20:34:44,568 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:44" (1/1) ... [2018-06-24 20:34:44,572 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:44" (1/1) ... [2018-06-24 20:34:44,576 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:44" (1/1) ... [2018-06-24 20:34:44,581 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:34:44,582 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:34:44,582 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:34:44,582 INFO ]: RCFGBuilder initialized [2018-06-24 20:34:44,582 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:44" (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:34:44,601 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:34:44,602 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:34:44,602 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:34:44,602 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:34:44,602 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:34:44,602 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:34:46,389 INFO ]: Using library mode [2018-06-24 20:34:46,390 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:34:46 BoogieIcfgContainer [2018-06-24 20:34:46,390 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:34:46,390 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:34:46,390 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:34:46,391 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:34:46,392 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:34:46" (1/1) ... [2018-06-24 20:34:46,445 INFO ]: Initial Icfg 147 locations, 287 edges [2018-06-24 20:34:46,447 INFO ]: Using Remove infeasible edges [2018-06-24 20:34:46,448 INFO ]: Using Maximize final states [2018-06-24 20:34:46,449 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:34:46,449 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:34:46,453 INFO ]: Using Remove sink states [2018-06-24 20:34:46,453 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:34:46,453 INFO ]: Using Use SBE [2018-06-24 20:34:46,469 INFO ]: SBE split 0 edges [2018-06-24 20:34:46,476 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:34:46,479 INFO ]: 0 new accepting states [2018-06-24 20:34:47,355 INFO ]: Removed 64 edges and 9 locations by large block encoding [2018-06-24 20:34:47,359 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:34:47,363 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:34:47,365 INFO ]: 0 new accepting states [2018-06-24 20:34:47,367 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:34:47,368 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:34:47,373 INFO ]: Encoded RCFG 135 locations, 274 edges [2018-06-24 20:34:47,374 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:34:47 BasicIcfg [2018-06-24 20:34:47,374 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:34:47,377 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:34:47,377 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:34:47,381 INFO ]: TraceAbstraction initialized [2018-06-24 20:34:47,381 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:34:44" (1/4) ... [2018-06-24 20:34:47,382 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4112840a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:34:47, skipping insertion in model container [2018-06-24 20:34:47,382 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:34:44" (2/4) ... [2018-06-24 20:34:47,382 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4112840a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:34:47, skipping insertion in model container [2018-06-24 20:34:47,382 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:34:46" (3/4) ... [2018-06-24 20:34:47,382 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4112840a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:34:47, skipping insertion in model container [2018-06-24 20:34:47,382 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:34:47" (4/4) ... [2018-06-24 20:34:47,386 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:34:47,397 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:34:47,412 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:34:47,461 INFO ]: Using default assertion order modulation [2018-06-24 20:34:47,461 INFO ]: Interprodecural is true [2018-06-24 20:34:47,461 INFO ]: Hoare is false [2018-06-24 20:34:47,461 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:34:47,461 INFO ]: Backedges is TWOTRACK [2018-06-24 20:34:47,461 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:34:47,461 INFO ]: Difference is false [2018-06-24 20:34:47,461 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:34:47,461 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:34:47,486 INFO ]: Start isEmpty. Operand 135 states. [2018-06-24 20:34:47,545 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 20:34:47,552 INFO ]: Found error trace [2018-06-24 20:34:47,553 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 20:34:47,553 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:34:47,558 INFO ]: Analyzing trace with hash 5884409, now seen corresponding path program 1 times [2018-06-24 20:34:47,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:34:47,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:34:47,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:47,605 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:34:47,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:47,678 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:34:47,839 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:34:47,841 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:34:47,842 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:34:47,843 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:34:47,856 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:34:47,857 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:34:47,859 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-24 20:34:49,240 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:34:49,240 INFO ]: Finished difference Result 136 states and 372 transitions. [2018-06-24 20:34:49,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:34:49,241 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 20:34:49,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:34:49,277 INFO ]: With dead ends: 136 [2018-06-24 20:34:49,277 INFO ]: Without dead ends: 136 [2018-06-24 20:34:49,279 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:34:49,298 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-24 20:34:49,401 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-06-24 20:34:49,402 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-24 20:34:49,415 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 372 transitions. [2018-06-24 20:34:49,417 INFO ]: Start accepts. Automaton has 136 states and 372 transitions. Word has length 4 [2018-06-24 20:34:49,418 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:34:49,418 INFO ]: Abstraction has 136 states and 372 transitions. [2018-06-24 20:34:49,418 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:34:49,418 INFO ]: Start isEmpty. Operand 136 states and 372 transitions. [2018-06-24 20:34:49,426 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:34:49,426 INFO ]: Found error trace [2018-06-24 20:34:49,426 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:34:49,426 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:34:49,426 INFO ]: Analyzing trace with hash 181653231, now seen corresponding path program 1 times [2018-06-24 20:34:49,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:34:49,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:34:49,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:49,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:34:49,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:49,445 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:34:49,539 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:34:49,539 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:34:49,539 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:34:49,541 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:34:49,541 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:34:49,541 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:34:49,541 INFO ]: Start difference. First operand 136 states and 372 transitions. Second operand 3 states. [2018-06-24 20:34:51,668 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:34:51,668 INFO ]: Finished difference Result 269 states and 739 transitions. [2018-06-24 20:34:51,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:34:51,710 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:34:51,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:34:51,745 INFO ]: With dead ends: 269 [2018-06-24 20:34:51,745 INFO ]: Without dead ends: 269 [2018-06-24 20:34:51,746 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:34:51,747 INFO ]: Start minimizeSevpa. Operand 269 states. [2018-06-24 20:34:51,849 INFO ]: Finished minimizeSevpa. Reduced states from 269 to 268. [2018-06-24 20:34:51,849 INFO ]: Start removeUnreachable. Operand 268 states. [2018-06-24 20:34:51,859 INFO ]: Finished removeUnreachable. Reduced from 268 states to 268 states and 581 transitions. [2018-06-24 20:34:51,859 INFO ]: Start accepts. Automaton has 268 states and 581 transitions. Word has length 5 [2018-06-24 20:34:51,859 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:34:51,859 INFO ]: Abstraction has 268 states and 581 transitions. [2018-06-24 20:34:51,859 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:34:51,859 INFO ]: Start isEmpty. Operand 268 states and 581 transitions. [2018-06-24 20:34:51,871 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:34:51,871 INFO ]: Found error trace [2018-06-24 20:34:51,871 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:34:51,871 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:34:51,871 INFO ]: Analyzing trace with hash 182333619, now seen corresponding path program 1 times [2018-06-24 20:34:51,871 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:34:51,871 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:34:51,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:51,872 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:34:51,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:51,886 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:34:51,993 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:34:51,993 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:34:51,993 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:34:51,994 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:34:51,994 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:34:51,994 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:34:51,994 INFO ]: Start difference. First operand 268 states and 581 transitions. Second operand 3 states. [2018-06-24 20:34:53,151 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:34:53,151 INFO ]: Finished difference Result 400 states and 816 transitions. [2018-06-24 20:34:53,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:34:53,152 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:34:53,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:34:53,170 INFO ]: With dead ends: 400 [2018-06-24 20:34:53,170 INFO ]: Without dead ends: 400 [2018-06-24 20:34:53,171 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:34:53,171 INFO ]: Start minimizeSevpa. Operand 400 states. [2018-06-24 20:34:53,251 INFO ]: Finished minimizeSevpa. Reduced states from 400 to 400. [2018-06-24 20:34:53,251 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-24 20:34:53,264 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 816 transitions. [2018-06-24 20:34:53,264 INFO ]: Start accepts. Automaton has 400 states and 816 transitions. Word has length 5 [2018-06-24 20:34:53,264 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:34:53,265 INFO ]: Abstraction has 400 states and 816 transitions. [2018-06-24 20:34:53,265 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:34:53,265 INFO ]: Start isEmpty. Operand 400 states and 816 transitions. [2018-06-24 20:34:53,304 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:34:53,304 INFO ]: Found error trace [2018-06-24 20:34:53,304 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:34:53,304 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:34:53,305 INFO ]: Analyzing trace with hash -709682432, now seen corresponding path program 1 times [2018-06-24 20:34:53,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:34:53,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:34:53,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:53,305 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:34:53,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:53,326 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:34:53,418 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:34:53,418 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:34:53,418 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:34:53,418 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:34:53,418 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:34:53,418 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:34:53,418 INFO ]: Start difference. First operand 400 states and 816 transitions. Second operand 3 states. [2018-06-24 20:34:54,279 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:34:54,279 INFO ]: Finished difference Result 532 states and 1085 transitions. [2018-06-24 20:34:54,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:34:54,282 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 20:34:54,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:34:54,312 INFO ]: With dead ends: 532 [2018-06-24 20:34:54,312 INFO ]: Without dead ends: 532 [2018-06-24 20:34:54,312 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:34:54,313 INFO ]: Start minimizeSevpa. Operand 532 states. [2018-06-24 20:34:54,383 INFO ]: Finished minimizeSevpa. Reduced states from 532 to 532. [2018-06-24 20:34:54,383 INFO ]: Start removeUnreachable. Operand 532 states. [2018-06-24 20:34:54,398 INFO ]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1085 transitions. [2018-06-24 20:34:54,398 INFO ]: Start accepts. Automaton has 532 states and 1085 transitions. Word has length 9 [2018-06-24 20:34:54,399 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:34:54,399 INFO ]: Abstraction has 532 states and 1085 transitions. [2018-06-24 20:34:54,399 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:34:54,399 INFO ]: Start isEmpty. Operand 532 states and 1085 transitions. [2018-06-24 20:34:54,426 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:34:54,426 INFO ]: Found error trace [2018-06-24 20:34:54,426 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:34:54,426 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:34:54,426 INFO ]: Analyzing trace with hash 1657782069, now seen corresponding path program 1 times [2018-06-24 20:34:54,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:34:54,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:34:54,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:54,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:34:54,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:54,453 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:34:54,721 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:34:54,721 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:34:54,721 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:34:54,721 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:34:54,721 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:34:54,721 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:34:54,721 INFO ]: Start difference. First operand 532 states and 1085 transitions. Second operand 5 states. [2018-06-24 20:34:57,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:34:57,108 INFO ]: Finished difference Result 1440 states and 3992 transitions. [2018-06-24 20:34:57,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:34:57,177 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:34:57,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:34:57,277 INFO ]: With dead ends: 1440 [2018-06-24 20:34:57,277 INFO ]: Without dead ends: 1440 [2018-06-24 20:34:57,277 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:34:57,278 INFO ]: Start minimizeSevpa. Operand 1440 states. [2018-06-24 20:34:57,565 INFO ]: Finished minimizeSevpa. Reduced states from 1440 to 1117. [2018-06-24 20:34:57,565 INFO ]: Start removeUnreachable. Operand 1117 states. [2018-06-24 20:34:57,597 INFO ]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 2311 transitions. [2018-06-24 20:34:57,597 INFO ]: Start accepts. Automaton has 1117 states and 2311 transitions. Word has length 9 [2018-06-24 20:34:57,598 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:34:57,598 INFO ]: Abstraction has 1117 states and 2311 transitions. [2018-06-24 20:34:57,598 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:34:57,599 INFO ]: Start isEmpty. Operand 1117 states and 2311 transitions. [2018-06-24 20:34:57,652 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:34:57,652 INFO ]: Found error trace [2018-06-24 20:34:57,652 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:34:57,652 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:34:57,652 INFO ]: Analyzing trace with hash 121199966, now seen corresponding path program 1 times [2018-06-24 20:34:57,652 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:34:57,652 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:34:57,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:57,655 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:34:57,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:34:57,688 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:34:57,891 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:34:57,891 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:34:57,891 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:34:57,891 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:34:57,891 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:34:57,891 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:34:57,891 INFO ]: Start difference. First operand 1117 states and 2311 transitions. Second operand 5 states. [2018-06-24 20:34:59,373 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:34:59,374 INFO ]: Finished difference Result 1861 states and 5196 transitions. [2018-06-24 20:34:59,377 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:34:59,377 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:34:59,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:34:59,520 INFO ]: With dead ends: 1861 [2018-06-24 20:34:59,520 INFO ]: Without dead ends: 1622 [2018-06-24 20:34:59,520 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:34:59,521 INFO ]: Start minimizeSevpa. Operand 1622 states. [2018-06-24 20:35:00,026 INFO ]: Finished minimizeSevpa. Reduced states from 1622 to 1132. [2018-06-24 20:35:00,026 INFO ]: Start removeUnreachable. Operand 1132 states. [2018-06-24 20:35:00,060 INFO ]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2393 transitions. [2018-06-24 20:35:00,060 INFO ]: Start accepts. Automaton has 1132 states and 2393 transitions. Word has length 9 [2018-06-24 20:35:00,061 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:00,061 INFO ]: Abstraction has 1132 states and 2393 transitions. [2018-06-24 20:35:00,061 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:35:00,061 INFO ]: Start isEmpty. Operand 1132 states and 2393 transitions. [2018-06-24 20:35:00,110 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:35:00,110 INFO ]: Found error trace [2018-06-24 20:35:00,110 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:00,111 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:00,111 INFO ]: Analyzing trace with hash -230120624, now seen corresponding path program 1 times [2018-06-24 20:35:00,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:00,111 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:00,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:00,112 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:00,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:00,138 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:00,554 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:35:00,554 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:35:00,554 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:35:00,554 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:35:00,554 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:35:00,554 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:35:00,554 INFO ]: Start difference. First operand 1132 states and 2393 transitions. Second operand 6 states. [2018-06-24 20:35:06,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:35:06,517 INFO ]: Finished difference Result 2580 states and 10272 transitions. [2018-06-24 20:35:06,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:35:06,520 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:35:06,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:35:06,923 INFO ]: With dead ends: 2580 [2018-06-24 20:35:06,923 INFO ]: Without dead ends: 2580 [2018-06-24 20:35:06,923 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:35:06,925 INFO ]: Start minimizeSevpa. Operand 2580 states. [2018-06-24 20:35:07,782 INFO ]: Finished minimizeSevpa. Reduced states from 2580 to 1678. [2018-06-24 20:35:07,782 INFO ]: Start removeUnreachable. Operand 1678 states. [2018-06-24 20:35:07,850 INFO ]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 4549 transitions. [2018-06-24 20:35:07,850 INFO ]: Start accepts. Automaton has 1678 states and 4549 transitions. Word has length 10 [2018-06-24 20:35:07,851 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:07,851 INFO ]: Abstraction has 1678 states and 4549 transitions. [2018-06-24 20:35:07,851 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:35:07,851 INFO ]: Start isEmpty. Operand 1678 states and 4549 transitions. [2018-06-24 20:35:07,892 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:35:07,892 INFO ]: Found error trace [2018-06-24 20:35:07,892 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:07,892 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:07,893 INFO ]: Analyzing trace with hash -1448149644, now seen corresponding path program 1 times [2018-06-24 20:35:07,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:07,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:07,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:07,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:07,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:07,924 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:08,329 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:35:08,329 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:35:08,329 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:35:08,330 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:35:08,330 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:35:08,330 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:35:08,330 INFO ]: Start difference. First operand 1678 states and 4549 transitions. Second operand 6 states. [2018-06-24 20:35:11,399 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:35:11,399 INFO ]: Finished difference Result 3226 states and 12469 transitions. [2018-06-24 20:35:11,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:35:11,400 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:35:11,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:35:11,612 INFO ]: With dead ends: 3226 [2018-06-24 20:35:11,612 INFO ]: Without dead ends: 3226 [2018-06-24 20:35:11,612 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:35:11,614 INFO ]: Start minimizeSevpa. Operand 3226 states. [2018-06-24 20:35:12,487 INFO ]: Finished minimizeSevpa. Reduced states from 3226 to 2091. [2018-06-24 20:35:12,487 INFO ]: Start removeUnreachable. Operand 2091 states. [2018-06-24 20:35:12,588 INFO ]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 5842 transitions. [2018-06-24 20:35:12,588 INFO ]: Start accepts. Automaton has 2091 states and 5842 transitions. Word has length 10 [2018-06-24 20:35:12,588 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:12,588 INFO ]: Abstraction has 2091 states and 5842 transitions. [2018-06-24 20:35:12,588 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:35:12,588 INFO ]: Start isEmpty. Operand 2091 states and 5842 transitions. [2018-06-24 20:35:12,629 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:35:12,629 INFO ]: Found error trace [2018-06-24 20:35:12,629 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:12,629 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:12,630 INFO ]: Analyzing trace with hash -156013387, now seen corresponding path program 1 times [2018-06-24 20:35:12,630 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:12,630 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:12,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:12,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:12,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:12,646 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:13,031 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:35:13,031 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:35:13,031 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:35:13,045 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:13,115 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:13,126 INFO ]: Computing forward predicates... [2018-06-24 20:35:13,160 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:35:13,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:35:13,193 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:35:13,194 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:35:13,194 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:35:13,194 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:35:13,194 INFO ]: Start difference. First operand 2091 states and 5842 transitions. Second operand 6 states. [2018-06-24 20:35:17,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:35:17,019 INFO ]: Finished difference Result 3514 states and 15338 transitions. [2018-06-24 20:35:17,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:35:17,020 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:35:17,020 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:35:17,390 INFO ]: With dead ends: 3514 [2018-06-24 20:35:17,390 INFO ]: Without dead ends: 3514 [2018-06-24 20:35:17,390 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:35:17,392 INFO ]: Start minimizeSevpa. Operand 3514 states. [2018-06-24 20:35:19,268 INFO ]: Finished minimizeSevpa. Reduced states from 3514 to 2088. [2018-06-24 20:35:19,268 INFO ]: Start removeUnreachable. Operand 2088 states. [2018-06-24 20:35:19,342 INFO ]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 5958 transitions. [2018-06-24 20:35:19,342 INFO ]: Start accepts. Automaton has 2088 states and 5958 transitions. Word has length 10 [2018-06-24 20:35:19,342 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:19,342 INFO ]: Abstraction has 2088 states and 5958 transitions. [2018-06-24 20:35:19,342 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:35:19,342 INFO ]: Start isEmpty. Operand 2088 states and 5958 transitions. [2018-06-24 20:35:19,403 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:35:19,403 INFO ]: Found error trace [2018-06-24 20:35:19,403 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:19,403 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:19,404 INFO ]: Analyzing trace with hash -538119529, now seen corresponding path program 1 times [2018-06-24 20:35:19,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:19,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:19,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:19,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:19,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:19,429 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:19,659 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:35:19,659 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:35:19,659 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:35:19,659 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:35:19,659 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:35:19,660 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:35:19,660 INFO ]: Start difference. First operand 2088 states and 5958 transitions. Second operand 6 states. [2018-06-24 20:35:20,557 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:35:20,557 INFO ]: Finished difference Result 3510 states and 15472 transitions. [2018-06-24 20:35:20,557 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:35:20,557 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:35:20,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:35:20,904 INFO ]: With dead ends: 3510 [2018-06-24 20:35:20,904 INFO ]: Without dead ends: 3510 [2018-06-24 20:35:20,904 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:35:20,906 INFO ]: Start minimizeSevpa. Operand 3510 states. [2018-06-24 20:35:22,942 INFO ]: Finished minimizeSevpa. Reduced states from 3510 to 2098. [2018-06-24 20:35:22,942 INFO ]: Start removeUnreachable. Operand 2098 states. [2018-06-24 20:35:23,032 INFO ]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 6058 transitions. [2018-06-24 20:35:23,032 INFO ]: Start accepts. Automaton has 2098 states and 6058 transitions. Word has length 10 [2018-06-24 20:35:23,032 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:23,032 INFO ]: Abstraction has 2098 states and 6058 transitions. [2018-06-24 20:35:23,032 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:35:23,032 INFO ]: Start isEmpty. Operand 2098 states and 6058 transitions. [2018-06-24 20:35:23,074 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:35:23,074 INFO ]: Found error trace [2018-06-24 20:35:23,074 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:23,074 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:23,075 INFO ]: Analyzing trace with hash -544256475, now seen corresponding path program 1 times [2018-06-24 20:35:23,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:23,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:23,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:23,076 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:23,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:23,102 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:23,472 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:35:23,472 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:35:23,472 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:35:23,473 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:35:23,473 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:35:23,473 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:35:23,473 INFO ]: Start difference. First operand 2098 states and 6058 transitions. Second operand 6 states. [2018-06-24 20:35:26,193 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:35:26,193 INFO ]: Finished difference Result 5542 states and 31133 transitions. [2018-06-24 20:35:26,193 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:35:26,193 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:35:26,193 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:35:27,007 INFO ]: With dead ends: 5542 [2018-06-24 20:35:27,007 INFO ]: Without dead ends: 5542 [2018-06-24 20:35:27,007 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:35:27,011 INFO ]: Start minimizeSevpa. Operand 5542 states. [2018-06-24 20:35:28,950 INFO ]: Finished minimizeSevpa. Reduced states from 5542 to 3340. [2018-06-24 20:35:28,950 INFO ]: Start removeUnreachable. Operand 3340 states. [2018-06-24 20:35:29,091 INFO ]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 9639 transitions. [2018-06-24 20:35:29,091 INFO ]: Start accepts. Automaton has 3340 states and 9639 transitions. Word has length 10 [2018-06-24 20:35:29,091 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:29,091 INFO ]: Abstraction has 3340 states and 9639 transitions. [2018-06-24 20:35:29,091 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:35:29,091 INFO ]: Start isEmpty. Operand 3340 states and 9639 transitions. [2018-06-24 20:35:29,136 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:35:29,136 INFO ]: Found error trace [2018-06-24 20:35:29,136 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:29,136 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:29,137 INFO ]: Analyzing trace with hash 1448545274, now seen corresponding path program 1 times [2018-06-24 20:35:29,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:29,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:29,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:29,137 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:29,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:29,163 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:29,361 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:35:29,361 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:35:29,361 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 20:35:29,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:29,414 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:29,417 INFO ]: Computing forward predicates... [2018-06-24 20:35:29,503 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:35:29,523 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:35:29,523 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 20:35:29,523 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:35:29,523 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:35:29,523 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:35:29,523 INFO ]: Start difference. First operand 3340 states and 9639 transitions. Second operand 12 states. [2018-06-24 20:35:30,085 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 20:35:33,454 WARN ]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 21 Received shutdown request... [2018-06-24 20:35:35,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-06-24 20:35:35,645 WARN ]: Verification canceled [2018-06-24 20:35:35,649 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:35:35,650 WARN ]: Timeout [2018-06-24 20:35:35,650 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:35:35 BasicIcfg [2018-06-24 20:35:35,650 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:35:35,651 INFO ]: Toolchain (without parser) took 51266.01 ms. Allocated memory was 302.0 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 230.6 MB in the beginning and 566.8 MB in the end (delta: -336.2 MB). Peak memory consumption was 969.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:35:35,652 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:35:35,652 INFO ]: ChcToBoogie took 102.67 ms. Allocated memory is still 302.0 MB. Free memory was 230.6 MB in the beginning and 226.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:35:35,653 INFO ]: Boogie Preprocessor took 86.60 ms. Allocated memory is still 302.0 MB. Free memory was 226.6 MB in the beginning and 224.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:35:35,653 INFO ]: RCFGBuilder took 1808.36 ms. Allocated memory was 302.0 MB in the beginning and 321.4 MB in the end (delta: 19.4 MB). Free memory was 224.5 MB in the beginning and 254.0 MB in the end (delta: -29.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:35:35,653 INFO ]: BlockEncodingV2 took 983.47 ms. Allocated memory is still 321.4 MB. Free memory was 254.0 MB in the beginning and 191.8 MB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:35:35,654 INFO ]: TraceAbstraction took 48273.13 ms. Allocated memory was 321.4 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 191.8 MB in the beginning and 566.8 MB in the end (delta: -374.9 MB). Peak memory consumption was 911.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:35:35,657 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 147 locations, 287 edges - StatisticsResult: Encoded RCFG 135 locations, 274 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 102.67 ms. Allocated memory is still 302.0 MB. Free memory was 230.6 MB in the beginning and 226.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 86.60 ms. Allocated memory is still 302.0 MB. Free memory was 226.6 MB in the beginning and 224.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1808.36 ms. Allocated memory was 302.0 MB in the beginning and 321.4 MB in the end (delta: 19.4 MB). Free memory was 224.5 MB in the beginning and 254.0 MB in the end (delta: -29.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 983.47 ms. Allocated memory is still 321.4 MB. Free memory was 254.0 MB in the beginning and 191.8 MB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 48273.13 ms. Allocated memory was 321.4 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 191.8 MB in the beginning and 566.8 MB in the end (delta: -374.9 MB). Peak memory consumption was 911.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 (3340states) and interpolant automaton (currently 55 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (2031 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. TIMEOUT Result, 48.1s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 34.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8978 SDtfs, 1472 SDslu, 20015 SDs, 0 SdLazy, 17010 SolverSat, 3584 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3340occurred in iteration=11, 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: 9.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 7891 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 2355 SizeOfPredicates, 20 NumberOfNonLiveVariables, 784 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 22/26 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/point-location.44.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-35-35-678.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.44.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-35-35-678.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.44.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-35-35-678.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.44.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-35-35-678.csv Completed graceful shutdown