java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd1.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:57:16,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:57:16,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:57:16,643 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:57:16,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:57:16,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:57:16,649 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:57:16,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:57:16,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:57:16,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:57:16,654 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:57:16,654 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:57:16,655 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:57:16,656 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:57:16,662 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:57:16,662 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:57:16,663 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:57:16,665 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:57:16,666 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:57:16,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:57:16,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:57:16,671 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:57:16,673 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:57:16,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:57:16,673 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:57:16,679 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:57:16,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:57:16,680 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:57:16,681 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:57:16,686 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:57:16,686 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:57:16,687 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:57:16,687 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:57:16,687 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:57:16,688 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:57:16,689 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:57:16,690 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 21:57:16,716 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:57:16,716 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:57:16,719 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:57:16,719 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:57:16,720 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:57:16,720 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:57:16,720 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:57:16,720 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:57:16,721 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:57:16,721 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:57:16,721 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:57:16,721 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:57:16,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:57:16,722 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:57:16,722 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:57:16,723 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:57:16,723 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:57:16,723 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:57:16,723 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:57:16,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:57:16,723 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:57:16,725 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:57:16,725 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:57:16,774 INFO ]: Repository-Root is: /tmp [2018-06-26 21:57:16,790 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:57:16,795 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:57:16,796 INFO ]: Initializing SmtParser... [2018-06-26 21:57:16,796 INFO ]: SmtParser initialized [2018-06-26 21:57:16,797 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd1.c.smt2 [2018-06-26 21:57:16,798 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 21:57:16,883 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd1.c.smt2 unknown [2018-06-26 21:57:17,407 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd1.c.smt2 [2018-06-26 21:57:17,412 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:57:17,418 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:57:17,418 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:57:17,418 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:57:17,419 INFO ]: ChcToBoogie initialized [2018-06-26 21:57:17,422 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:57:17" (1/1) ... [2018-06-26 21:57:17,495 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:57:17 Unit [2018-06-26 21:57:17,495 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:57:17,496 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:57:17,496 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:57:17,496 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:57:17,520 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:57:17" (1/1) ... [2018-06-26 21:57:17,520 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:57:17" (1/1) ... [2018-06-26 21:57:17,535 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:57:17" (1/1) ... [2018-06-26 21:57:17,535 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:57:17" (1/1) ... [2018-06-26 21:57:17,548 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:57:17" (1/1) ... [2018-06-26 21:57:17,550 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:57:17" (1/1) ... [2018-06-26 21:57:17,554 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:57:17" (1/1) ... [2018-06-26 21:57:17,559 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:57:17,560 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:57:17,560 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:57:17,560 INFO ]: RCFGBuilder initialized [2018-06-26 21:57:17,561 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:57:17" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 21:57:17,583 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:57:17,583 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:57:17,583 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:57:17,583 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:57:17,583 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:57:17,583 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:57:18,015 INFO ]: Using library mode [2018-06-26 21:57:18,015 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:57:18 BoogieIcfgContainer [2018-06-26 21:57:18,016 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:57:18,016 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:57:18,016 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:57:18,019 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:57:18,019 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:57:18" (1/1) ... [2018-06-26 21:57:18,037 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:57:18,038 INFO ]: Using Remove infeasible edges [2018-06-26 21:57:18,039 INFO ]: Using Maximize final states [2018-06-26 21:57:18,039 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:57:18,039 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:57:18,042 INFO ]: Using Remove sink states [2018-06-26 21:57:18,043 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:57:18,043 INFO ]: Using Use SBE [2018-06-26 21:57:18,050 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:57:18,209 WARN ]: aborting because of expected exponential blowup for input size 145 [2018-06-26 21:57:18,223 WARN ]: aborting because of expected exponential blowup for input size 145 [2018-06-26 21:57:18,223 INFO ]: SBE split 1 edges [2018-06-26 21:57:18,230 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:57:18,232 INFO ]: 0 new accepting states [2018-06-26 21:57:18,641 INFO ]: Removed 27 edges and 2 locations by large block encoding [2018-06-26 21:57:18,643 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:57:18,644 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:57:18,644 INFO ]: 0 new accepting states [2018-06-26 21:57:18,645 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:57:18,645 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:57:18,645 INFO ]: Encoded RCFG 6 locations, 29 edges [2018-06-26 21:57:18,645 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:57:18 BasicIcfg [2018-06-26 21:57:18,645 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:57:18,647 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:57:18,647 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:57:18,650 INFO ]: TraceAbstraction initialized [2018-06-26 21:57:18,651 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:57:17" (1/4) ... [2018-06-26 21:57:18,652 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bca663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:57:18, skipping insertion in model container [2018-06-26 21:57:18,652 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:57:17" (2/4) ... [2018-06-26 21:57:18,652 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bca663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:57:18, skipping insertion in model container [2018-06-26 21:57:18,652 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:57:18" (3/4) ... [2018-06-26 21:57:18,652 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bca663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:57:18, skipping insertion in model container [2018-06-26 21:57:18,652 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:57:18" (4/4) ... [2018-06-26 21:57:18,654 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:57:18,665 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:57:18,672 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:57:18,730 INFO ]: Using default assertion order modulation [2018-06-26 21:57:18,731 INFO ]: Interprodecural is true [2018-06-26 21:57:18,731 INFO ]: Hoare is false [2018-06-26 21:57:18,731 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:57:18,731 INFO ]: Backedges is TWOTRACK [2018-06-26 21:57:18,731 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:57:18,731 INFO ]: Difference is false [2018-06-26 21:57:18,731 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:57:18,731 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:57:18,744 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:57:18,756 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:57:18,756 INFO ]: Found error trace [2018-06-26 21:57:18,757 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:57:18,757 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:18,762 INFO ]: Analyzing trace with hash 36162713, now seen corresponding path program 1 times [2018-06-26 21:57:18,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:18,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:18,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:18,809 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:18,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:18,853 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:18,935 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:18,937 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:57:18,937 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:57:18,938 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:57:18,948 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:57:18,948 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:57:18,950 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:57:19,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:19,275 INFO ]: Finished difference Result 7 states and 30 transitions. [2018-06-26 21:57:19,275 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:57:19,276 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:57:19,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:19,284 INFO ]: With dead ends: 7 [2018-06-26 21:57:19,285 INFO ]: Without dead ends: 7 [2018-06-26 21:57:19,286 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:57:19,303 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:57:19,319 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:57:19,320 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:57:19,321 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-26 21:57:19,322 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 5 [2018-06-26 21:57:19,323 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:19,323 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-26 21:57:19,323 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:57:19,323 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-26 21:57:19,324 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:57:19,324 INFO ]: Found error trace [2018-06-26 21:57:19,324 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:57:19,324 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:19,324 INFO ]: Analyzing trace with hash 36192504, now seen corresponding path program 1 times [2018-06-26 21:57:19,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:19,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:19,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:19,326 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:19,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:19,333 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:19,395 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:19,396 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:57:19,396 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:57:19,397 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:57:19,397 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:57:19,397 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:57:19,397 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 3 states. [2018-06-26 21:57:19,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:19,760 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-26 21:57:19,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:57:19,760 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:57:19,760 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:19,761 INFO ]: With dead ends: 9 [2018-06-26 21:57:19,761 INFO ]: Without dead ends: 9 [2018-06-26 21:57:19,762 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:57:19,762 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:57:19,763 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:57:19,764 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:57:19,764 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-26 21:57:19,764 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 5 [2018-06-26 21:57:19,764 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:19,764 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-26 21:57:19,764 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:57:19,764 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-26 21:57:19,765 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:57:19,765 INFO ]: Found error trace [2018-06-26 21:57:19,765 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:57:19,766 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:19,766 INFO ]: Analyzing trace with hash 36252086, now seen corresponding path program 1 times [2018-06-26 21:57:19,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:19,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:19,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:19,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:19,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:19,774 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:19,832 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:19,832 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:57:19,832 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:57:19,833 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:57:19,833 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:57:19,833 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:57:19,833 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 3 states. [2018-06-26 21:57:20,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:20,036 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-26 21:57:20,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:57:20,036 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:57:20,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:20,037 INFO ]: With dead ends: 9 [2018-06-26 21:57:20,037 INFO ]: Without dead ends: 9 [2018-06-26 21:57:20,037 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:57:20,037 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:57:20,040 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:57:20,040 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:57:20,040 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-26 21:57:20,040 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 5 [2018-06-26 21:57:20,040 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:20,041 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-26 21:57:20,041 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:57:20,041 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-26 21:57:20,041 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:57:20,041 INFO ]: Found error trace [2018-06-26 21:57:20,041 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:57:20,041 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:20,041 INFO ]: Analyzing trace with hash 36341459, now seen corresponding path program 1 times [2018-06-26 21:57:20,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:20,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:20,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:20,042 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:20,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:20,048 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:20,068 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:20,068 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:57:20,068 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:57:20,068 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:57:20,068 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:57:20,068 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:57:20,069 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 3 states. [2018-06-26 21:57:20,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:20,199 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-26 21:57:20,199 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:57:20,199 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:57:20,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:20,200 INFO ]: With dead ends: 9 [2018-06-26 21:57:20,200 INFO ]: Without dead ends: 9 [2018-06-26 21:57:20,200 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:57:20,200 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:57:20,202 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:57:20,202 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:57:20,202 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-26 21:57:20,203 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 5 [2018-06-26 21:57:20,203 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:20,203 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-26 21:57:20,203 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:57:20,203 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-26 21:57:20,203 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:57:20,203 INFO ]: Found error trace [2018-06-26 21:57:20,203 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:57:20,203 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:20,203 INFO ]: Analyzing trace with hash 36728742, now seen corresponding path program 1 times [2018-06-26 21:57:20,203 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:20,203 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:20,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:20,204 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:20,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:20,209 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:20,244 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:20,244 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:57:20,244 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:57:20,244 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:57:20,245 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:57:20,245 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:57:20,245 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 3 states. [2018-06-26 21:57:20,368 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:20,368 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-26 21:57:20,368 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:57:20,368 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:57:20,368 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:20,369 INFO ]: With dead ends: 9 [2018-06-26 21:57:20,369 INFO ]: Without dead ends: 9 [2018-06-26 21:57:20,369 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:57:20,369 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:57:20,371 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:57:20,371 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:57:20,371 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-26 21:57:20,371 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 5 [2018-06-26 21:57:20,371 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:20,371 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-26 21:57:20,371 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:57:20,371 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-26 21:57:20,372 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:57:20,372 INFO ]: Found error trace [2018-06-26 21:57:20,372 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:57:20,372 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:20,372 INFO ]: Analyzing trace with hash 36788324, now seen corresponding path program 1 times [2018-06-26 21:57:20,372 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:20,372 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:20,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:20,373 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:20,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:20,378 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:20,406 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:20,407 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:57:20,407 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:57:20,407 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:57:20,407 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:57:20,407 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:57:20,407 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 3 states. [2018-06-26 21:57:20,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:20,503 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-26 21:57:20,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:57:20,504 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:57:20,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:20,504 INFO ]: With dead ends: 9 [2018-06-26 21:57:20,504 INFO ]: Without dead ends: 9 [2018-06-26 21:57:20,504 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:57:20,504 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:57:20,506 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:57:20,506 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:57:20,506 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-26 21:57:20,506 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 5 [2018-06-26 21:57:20,506 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:20,506 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-26 21:57:20,506 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:57:20,507 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-26 21:57:20,507 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:57:20,507 INFO ]: Found error trace [2018-06-26 21:57:20,509 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:57:20,509 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:20,509 INFO ]: Analyzing trace with hash 1119393264, now seen corresponding path program 1 times [2018-06-26 21:57:20,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:20,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:20,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:20,510 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:20,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:20,633 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:20,895 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:20,895 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:57:20,895 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:57:20,904 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:20,969 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:20,975 INFO ]: Computing forward predicates... [2018-06-26 21:57:26,931 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:26,950 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:57:26,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 21:57:26,951 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:57:26,951 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:57:26,951 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:57:26,951 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 5 states. [2018-06-26 21:57:27,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:27,053 INFO ]: Finished difference Result 11 states and 34 transitions. [2018-06-26 21:57:27,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:57:27,053 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 21:57:27,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:27,054 INFO ]: With dead ends: 11 [2018-06-26 21:57:27,054 INFO ]: Without dead ends: 11 [2018-06-26 21:57:27,054 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:57:27,054 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 21:57:27,055 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-26 21:57:27,055 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:57:27,055 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-06-26 21:57:27,055 INFO ]: Start accepts. Automaton has 8 states and 31 transitions. Word has length 6 [2018-06-26 21:57:27,055 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:27,055 INFO ]: Abstraction has 8 states and 31 transitions. [2018-06-26 21:57:27,055 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:57:27,055 INFO ]: Start isEmpty. Operand 8 states and 31 transitions. [2018-06-26 21:57:27,056 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:57:27,056 INFO ]: Found error trace [2018-06-26 21:57:27,056 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:57:27,056 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:27,056 INFO ]: Analyzing trace with hash 1120316785, now seen corresponding path program 1 times [2018-06-26 21:57:27,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:27,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:27,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:27,057 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:27,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:27,106 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:27,452 WARN ]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-26 21:57:27,452 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:27,452 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:57:27,453 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) [2018-06-26 21:57:27,467 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:57:27,526 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:27,529 INFO ]: Computing forward predicates... [2018-06-26 21:57:29,511 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:29,531 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:57:29,532 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 21:57:29,532 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:57:29,532 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:57:29,532 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:57:29,532 INFO ]: Start difference. First operand 8 states and 31 transitions. Second operand 5 states. [2018-06-26 21:57:29,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:29,621 INFO ]: Finished difference Result 16 states and 39 transitions. [2018-06-26 21:57:29,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:57:29,621 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 21:57:29,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:29,622 INFO ]: With dead ends: 16 [2018-06-26 21:57:29,622 INFO ]: Without dead ends: 16 [2018-06-26 21:57:29,622 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:57:29,622 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 21:57:29,624 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 8. [2018-06-26 21:57:29,624 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:57:29,625 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-06-26 21:57:29,625 INFO ]: Start accepts. Automaton has 8 states and 31 transitions. Word has length 6 [2018-06-26 21:57:29,625 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:29,625 INFO ]: Abstraction has 8 states and 31 transitions. [2018-06-26 21:57:29,625 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:57:29,625 INFO ]: Start isEmpty. Operand 8 states and 31 transitions. [2018-06-26 21:57:29,625 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:57:29,625 INFO ]: Found error trace [2018-06-26 21:57:29,625 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:57:29,625 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:29,625 INFO ]: Analyzing trace with hash 1121240306, now seen corresponding path program 1 times [2018-06-26 21:57:29,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:29,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:29,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:29,626 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:29,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:29,653 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:29,739 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:29,739 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:57:29,739 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:57:29,745 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:29,788 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:29,792 INFO ]: Computing forward predicates... [2018-06-26 21:57:30,514 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 21:57:35,414 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:35,435 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:57:35,435 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 21:57:35,435 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:57:35,435 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:57:35,435 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:57:35,436 INFO ]: Start difference. First operand 8 states and 31 transitions. Second operand 5 states. [2018-06-26 21:57:35,495 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:35,495 INFO ]: Finished difference Result 14 states and 37 transitions. [2018-06-26 21:57:35,495 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 21:57:35,495 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 21:57:35,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:35,496 INFO ]: With dead ends: 14 [2018-06-26 21:57:35,496 INFO ]: Without dead ends: 14 [2018-06-26 21:57:35,496 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:57:35,496 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 21:57:35,499 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 8. [2018-06-26 21:57:35,499 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:57:35,500 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-06-26 21:57:35,500 INFO ]: Start accepts. Automaton has 8 states and 31 transitions. Word has length 6 [2018-06-26 21:57:35,500 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:35,500 INFO ]: Abstraction has 8 states and 31 transitions. [2018-06-26 21:57:35,500 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:57:35,500 INFO ]: Start isEmpty. Operand 8 states and 31 transitions. [2018-06-26 21:57:35,500 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:57:35,500 INFO ]: Found error trace [2018-06-26 21:57:35,500 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:57:35,500 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:35,500 INFO ]: Analyzing trace with hash 1140634247, now seen corresponding path program 1 times [2018-06-26 21:57:35,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:35,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:35,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:35,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:35,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:35,525 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:35,676 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:35,676 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:57:35,676 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:57:35,684 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:35,727 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:35,729 INFO ]: Computing forward predicates... [2018-06-26 21:57:36,199 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:36,219 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:57:36,219 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 21:57:36,219 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:57:36,219 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:57:36,219 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:57:36,219 INFO ]: Start difference. First operand 8 states and 31 transitions. Second operand 5 states. [2018-06-26 21:57:36,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:36,266 INFO ]: Finished difference Result 14 states and 37 transitions. [2018-06-26 21:57:36,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:57:36,267 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 21:57:36,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:36,267 INFO ]: With dead ends: 14 [2018-06-26 21:57:36,267 INFO ]: Without dead ends: 14 [2018-06-26 21:57:36,268 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:57:36,268 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 21:57:36,269 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 8. [2018-06-26 21:57:36,269 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:57:36,269 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-06-26 21:57:36,269 INFO ]: Start accepts. Automaton has 8 states and 31 transitions. Word has length 6 [2018-06-26 21:57:36,269 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:36,270 INFO ]: Abstraction has 8 states and 31 transitions. [2018-06-26 21:57:36,270 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:57:36,270 INFO ]: Start isEmpty. Operand 8 states and 31 transitions. [2018-06-26 21:57:36,270 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:57:36,270 INFO ]: Found error trace [2018-06-26 21:57:36,270 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 21:57:36,270 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:36,270 INFO ]: Analyzing trace with hash 339801977, now seen corresponding path program 2 times [2018-06-26 21:57:36,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:36,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:36,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:36,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:36,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:36,346 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:36,488 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:36,488 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:57:36,488 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:57:36,495 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:57:36,587 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:57:36,587 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:36,590 INFO ]: Computing forward predicates... [2018-06-26 21:57:43,246 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:43,267 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:57:43,267 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 21:57:43,267 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:57:43,267 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:57:43,267 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:57:43,268 INFO ]: Start difference. First operand 8 states and 31 transitions. Second operand 5 states. [2018-06-26 21:57:43,382 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:43,382 INFO ]: Finished difference Result 11 states and 34 transitions. [2018-06-26 21:57:43,382 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:57:43,382 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 21:57:43,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:43,382 INFO ]: With dead ends: 11 [2018-06-26 21:57:43,382 INFO ]: Without dead ends: 11 [2018-06-26 21:57:43,382 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:57:43,382 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 21:57:43,384 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-26 21:57:43,384 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:57:43,384 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-06-26 21:57:43,384 INFO ]: Start accepts. Automaton has 9 states and 32 transitions. Word has length 7 [2018-06-26 21:57:43,384 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:43,384 INFO ]: Abstraction has 9 states and 32 transitions. [2018-06-26 21:57:43,384 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:57:43,384 INFO ]: Start isEmpty. Operand 9 states and 32 transitions. [2018-06-26 21:57:43,384 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:57:43,384 INFO ]: Found error trace [2018-06-26 21:57:43,384 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 21:57:43,384 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:43,384 INFO ]: Analyzing trace with hash 368431128, now seen corresponding path program 2 times [2018-06-26 21:57:43,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:43,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:43,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:43,385 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:57:43,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:43,441 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:43,663 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:43,663 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:57:43,663 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:57:43,671 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:57:43,730 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:57:43,730 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:43,732 INFO ]: Computing forward predicates... [2018-06-26 21:57:44,617 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:44,636 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:57:44,636 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 21:57:44,636 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:57:44,637 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:57:44,637 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:57:44,637 INFO ]: Start difference. First operand 9 states and 32 transitions. Second operand 5 states. [2018-06-26 21:57:44,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:44,720 INFO ]: Finished difference Result 15 states and 38 transitions. [2018-06-26 21:57:44,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:57:44,720 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 21:57:44,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:44,721 INFO ]: With dead ends: 15 [2018-06-26 21:57:44,721 INFO ]: Without dead ends: 15 [2018-06-26 21:57:44,721 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:57:44,721 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 21:57:44,723 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 9. [2018-06-26 21:57:44,723 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:57:44,723 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-06-26 21:57:44,723 INFO ]: Start accepts. Automaton has 9 states and 32 transitions. Word has length 7 [2018-06-26 21:57:44,723 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:44,723 INFO ]: Abstraction has 9 states and 32 transitions. [2018-06-26 21:57:44,723 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:57:44,723 INFO ]: Start isEmpty. Operand 9 states and 32 transitions. [2018-06-26 21:57:44,723 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:57:44,723 INFO ]: Found error trace [2018-06-26 21:57:44,723 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 21:57:44,724 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:44,724 INFO ]: Analyzing trace with hash 397060279, now seen corresponding path program 2 times [2018-06-26 21:57:44,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:44,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:44,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:44,724 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:57:44,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:44,757 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:44,907 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:44,908 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:57:44,908 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:57:44,916 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:57:44,975 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:57:44,975 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:44,978 INFO ]: Computing forward predicates... [2018-06-26 21:57:45,086 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 21:57:47,599 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:47,619 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:57:47,619 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 21:57:47,620 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:57:47,620 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:57:47,620 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:57:47,621 INFO ]: Start difference. First operand 9 states and 32 transitions. Second operand 6 states. [2018-06-26 21:57:47,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:57:47,776 INFO ]: Finished difference Result 19 states and 42 transitions. [2018-06-26 21:57:47,777 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 21:57:47,777 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 21:57:47,777 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:57:47,777 INFO ]: With dead ends: 19 [2018-06-26 21:57:47,777 INFO ]: Without dead ends: 19 [2018-06-26 21:57:47,777 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:57:47,777 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 21:57:47,779 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 9. [2018-06-26 21:57:47,779 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:57:47,779 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-06-26 21:57:47,779 INFO ]: Start accepts. Automaton has 9 states and 32 transitions. Word has length 7 [2018-06-26 21:57:47,779 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:57:47,779 INFO ]: Abstraction has 9 states and 32 transitions. [2018-06-26 21:57:47,779 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:57:47,779 INFO ]: Start isEmpty. Operand 9 states and 32 transitions. [2018-06-26 21:57:47,779 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:57:47,779 INFO ]: Found error trace [2018-06-26 21:57:47,779 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 21:57:47,780 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:57:47,780 INFO ]: Analyzing trace with hash 654722638, now seen corresponding path program 1 times [2018-06-26 21:57:47,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:57:47,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:57:47,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:47,780 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:57:47,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:57:47,820 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:47,999 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:57:47,999 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:57:47,999 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:57:48,020 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:57:48,077 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:57:48,080 INFO ]: Computing forward predicates... [2018-06-26 21:57:48,123 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 21:58:00,265 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:58:00,290 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:58:00,290 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 21:58:00,291 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:58:00,291 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:58:00,291 INFO ]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:58:00,291 INFO ]: Start difference. First operand 9 states and 32 transitions. Second operand 6 states. [2018-06-26 21:58:00,395 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:58:00,395 INFO ]: Finished difference Result 17 states and 40 transitions. [2018-06-26 21:58:00,395 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:58:00,395 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 21:58:00,395 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:58:00,395 INFO ]: With dead ends: 17 [2018-06-26 21:58:00,395 INFO ]: Without dead ends: 17 [2018-06-26 21:58:00,396 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:58:00,396 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 21:58:00,397 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 9. [2018-06-26 21:58:00,397 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:58:00,398 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-06-26 21:58:00,398 INFO ]: Start accepts. Automaton has 9 states and 32 transitions. Word has length 7 [2018-06-26 21:58:00,398 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:58:00,398 INFO ]: Abstraction has 9 states and 32 transitions. [2018-06-26 21:58:00,398 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:58:00,398 INFO ]: Start isEmpty. Operand 9 states and 32 transitions. [2018-06-26 21:58:00,398 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:58:00,398 INFO ]: Found error trace [2018-06-26 21:58:00,398 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 21:58:00,398 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:58:00,398 INFO ]: Analyzing trace with hash 683351789, now seen corresponding path program 1 times [2018-06-26 21:58:00,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:58:00,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:58:00,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:58:00,399 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:58:00,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:58:00,427 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:58:00,956 WARN ]: Spent 329.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-26 21:58:00,965 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:58:00,966 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:58:00,966 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:58:00,972 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:58:01,028 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:58:01,031 INFO ]: Computing forward predicates... [2018-06-26 21:58:02,540 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:58:02,560 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:58:02,560 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 21:58:02,560 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:58:02,560 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:58:02,560 INFO ]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:58:02,560 INFO ]: Start difference. First operand 9 states and 32 transitions. Second operand 6 states. [2018-06-26 21:58:02,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:58:02,666 INFO ]: Finished difference Result 16 states and 39 transitions. [2018-06-26 21:58:02,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:58:02,667 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 21:58:02,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:58:02,667 INFO ]: With dead ends: 16 [2018-06-26 21:58:02,667 INFO ]: Without dead ends: 16 [2018-06-26 21:58:02,667 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:58:02,667 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 21:58:02,669 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 9. [2018-06-26 21:58:02,669 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:58:02,669 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-06-26 21:58:02,669 INFO ]: Start accepts. Automaton has 9 states and 32 transitions. Word has length 7 [2018-06-26 21:58:02,669 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:58:02,669 INFO ]: Abstraction has 9 states and 32 transitions. [2018-06-26 21:58:02,669 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:58:02,669 INFO ]: Start isEmpty. Operand 9 states and 32 transitions. [2018-06-26 21:58:02,669 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:58:02,669 INFO ]: Found error trace [2018-06-26 21:58:02,670 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-26 21:58:02,670 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:58:02,670 INFO ]: Analyzing trace with hash 1942275856, now seen corresponding path program 3 times [2018-06-26 21:58:02,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:58:02,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:58:02,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:58:02,670 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:58:02,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:58:02,734 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:58:02,992 WARN ]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-26 21:58:03,066 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:58:03,066 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:58:03,066 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:58:03,072 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 21:58:03,156 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 21:58:03,156 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:58:03,159 INFO ]: Computing forward predicates... [2018-06-26 21:58:06,663 WARN ]: expecting exponential blowup for input size 6 Received shutdown request... [2018-06-26 21:58:17,189 INFO ]: Timeout while computing interpolants [2018-06-26 21:58:17,415 WARN ]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:58:17,415 WARN ]: Verification canceled [2018-06-26 21:58:17,417 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:58:17,418 WARN ]: Timeout [2018-06-26 21:58:17,418 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:58:17 BasicIcfg [2018-06-26 21:58:17,418 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:58:17,419 INFO ]: Toolchain (without parser) took 60006.68 ms. Allocated memory was 300.4 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 232.5 MB in the beginning and 920.2 MB in the end (delta: -687.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 21:58:17,420 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 300.4 MB. Free memory is still 266.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:58:17,421 INFO ]: ChcToBoogie took 76.96 ms. Allocated memory is still 300.4 MB. Free memory was 232.5 MB in the beginning and 229.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:58:17,421 INFO ]: Boogie Preprocessor took 62.79 ms. Allocated memory is still 300.4 MB. Free memory was 229.6 MB in the beginning and 227.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-26 21:58:17,421 INFO ]: RCFGBuilder took 455.91 ms. Allocated memory is still 300.4 MB. Free memory was 227.5 MB in the beginning and 201.2 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 3.6 GB. [2018-06-26 21:58:17,421 INFO ]: BlockEncodingV2 took 629.35 ms. Allocated memory was 300.4 MB in the beginning and 323.5 MB in the end (delta: 23.1 MB). Free memory was 201.2 MB in the beginning and 263.3 MB in the end (delta: -62.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 3.6 GB. [2018-06-26 21:58:17,422 INFO ]: TraceAbstraction took 58771.63 ms. Allocated memory was 323.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 263.3 MB in the beginning and 920.2 MB in the end (delta: -657.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 21:58:17,424 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 29 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 300.4 MB. Free memory is still 266.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 76.96 ms. Allocated memory is still 300.4 MB. Free memory was 232.5 MB in the beginning and 229.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 62.79 ms. Allocated memory is still 300.4 MB. Free memory was 229.6 MB in the beginning and 227.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 455.91 ms. Allocated memory is still 300.4 MB. Free memory was 227.5 MB in the beginning and 201.2 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 629.35 ms. Allocated memory was 300.4 MB in the beginning and 323.5 MB in the end (delta: 23.1 MB). Free memory was 201.2 MB in the beginning and 263.3 MB in the end (delta: -62.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58771.63 ms. Allocated memory was 323.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 263.3 MB in the beginning and 920.2 MB in the end (delta: -657.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 9 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 24 quantified variables from 10 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 58.7s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 424 SDtfs, 0 SDslu, 99 SDs, 0 SdLazy, 388 SolverSat, 428 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred 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: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 66 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 40.2s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 2010 SizeOfPredicates, 63 NumberOfNonLiveVariables, 2692 ConjunctsInSsa, 202 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 0/38 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/svd1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_21-58-17-436.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/svd1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_21-58-17-436.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/svd1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_21-58-17-436.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/svd1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_21-58-17-436.csv Completed graceful shutdown