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/lustre/ex8_e7_55.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-27 00:07:18,792 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-27 00:07:18,794 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-27 00:07:18,809 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-27 00:07:18,810 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-27 00:07:18,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-27 00:07:18,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-27 00:07:18,817 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-27 00:07:18,819 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-27 00:07:18,820 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-27 00:07:18,822 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-27 00:07:18,822 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-27 00:07:18,823 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-27 00:07:18,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-27 00:07:18,829 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-27 00:07:18,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-27 00:07:18,831 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-27 00:07:18,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-27 00:07:18,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-27 00:07:18,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-27 00:07:18,847 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-27 00:07:18,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-27 00:07:18,850 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-27 00:07:18,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-27 00:07:18,851 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-27 00:07:18,851 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-27 00:07:18,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-27 00:07:18,856 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-27 00:07:18,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-27 00:07:18,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-27 00:07:18,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-27 00:07:18,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-27 00:07:18,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-27 00:07:18,859 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-27 00:07:18,863 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-27 00:07:18,864 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-27 00:07:18,864 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-27 00:07:18,890 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-27 00:07:18,890 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-27 00:07:18,890 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-27 00:07:18,890 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-27 00:07:18,891 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-27 00:07:18,892 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-27 00:07:18,892 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-27 00:07:18,892 INFO L133 SettingsManager]: * Use SBE=true [2018-06-27 00:07:18,892 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-27 00:07:18,892 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-27 00:07:18,892 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-27 00:07:18,893 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-27 00:07:18,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 00:07:18,893 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-27 00:07:18,894 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-27 00:07:18,894 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-27 00:07:18,894 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-27 00:07:18,894 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-27 00:07:18,894 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-27 00:07:18,894 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-27 00:07:18,895 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-27 00:07:18,896 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-27 00:07:18,896 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-27 00:07:18,941 INFO ]: Repository-Root is: /tmp [2018-06-27 00:07:18,956 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-27 00:07:18,961 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-27 00:07:18,962 INFO ]: Initializing SmtParser... [2018-06-27 00:07:18,962 INFO ]: SmtParser initialized [2018-06-27 00:07:18,963 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e7_55.smt2 [2018-06-27 00:07:18,964 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-27 00:07:19,046 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e7_55.smt2 unknown [2018-06-27 00:07:19,309 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e7_55.smt2 [2018-06-27 00:07:19,315 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-27 00:07:19,320 INFO ]: Walking toolchain with 5 elements. [2018-06-27 00:07:19,321 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-27 00:07:19,321 INFO ]: Initializing ChcToBoogie... [2018-06-27 00:07:19,321 INFO ]: ChcToBoogie initialized [2018-06-27 00:07:19,324 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 12:07:19" (1/1) ... [2018-06-27 00:07:19,388 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:07:19 Unit [2018-06-27 00:07:19,388 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-27 00:07:19,389 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-27 00:07:19,389 INFO ]: Initializing Boogie Preprocessor... [2018-06-27 00:07:19,389 INFO ]: Boogie Preprocessor initialized [2018-06-27 00:07:19,411 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:07:19" (1/1) ... [2018-06-27 00:07:19,411 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:07:19" (1/1) ... [2018-06-27 00:07:19,421 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:07:19" (1/1) ... [2018-06-27 00:07:19,421 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:07:19" (1/1) ... [2018-06-27 00:07:19,426 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:07:19" (1/1) ... [2018-06-27 00:07:19,427 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:07:19" (1/1) ... [2018-06-27 00:07:19,429 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:07:19" (1/1) ... [2018-06-27 00:07:19,432 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-27 00:07:19,432 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-27 00:07:19,432 INFO ]: Initializing RCFGBuilder... [2018-06-27 00:07:19,432 INFO ]: RCFGBuilder initialized [2018-06-27 00:07:19,433 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:07:19" (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-27 00:07:19,451 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-27 00:07:19,451 INFO ]: Found specification of procedure gotoProc [2018-06-27 00:07:19,451 INFO ]: Found implementation of procedure gotoProc [2018-06-27 00:07:19,451 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-27 00:07:19,451 INFO ]: Found specification of procedure Ultimate.START [2018-06-27 00:07:19,451 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-27 00:07:19,737 INFO ]: Using library mode [2018-06-27 00:07:19,737 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:07:19 BoogieIcfgContainer [2018-06-27 00:07:19,737 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-27 00:07:19,738 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-27 00:07:19,738 INFO ]: Initializing BlockEncodingV2... [2018-06-27 00:07:19,739 INFO ]: BlockEncodingV2 initialized [2018-06-27 00:07:19,739 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:07:19" (1/1) ... [2018-06-27 00:07:19,756 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-27 00:07:19,758 INFO ]: Using Remove infeasible edges [2018-06-27 00:07:19,758 INFO ]: Using Maximize final states [2018-06-27 00:07:19,759 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-27 00:07:19,759 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-27 00:07:19,760 INFO ]: Using Remove sink states [2018-06-27 00:07:19,761 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-27 00:07:19,761 INFO ]: Using Use SBE [2018-06-27 00:07:19,770 WARN ]: expecting exponential blowup for input size 12 [2018-06-27 00:07:20,398 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 00:07:20,399 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 00:07:20,780 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 00:07:20,781 INFO ]: SBE split 2 edges [2018-06-27 00:07:20,799 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-27 00:07:20,802 INFO ]: 0 new accepting states [2018-06-27 00:07:32,352 INFO ]: Removed 2066 edges and 2 locations by large block encoding [2018-06-27 00:07:32,354 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:07:32,367 INFO ]: Removed 12 edges and 0 locations because of local infeasibility [2018-06-27 00:07:32,368 INFO ]: 0 new accepting states [2018-06-27 00:07:32,369 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 00:07:32,370 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:07:32,376 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-27 00:07:32,377 INFO ]: 0 new accepting states [2018-06-27 00:07:32,382 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 00:07:32,382 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:07:32,391 INFO ]: Encoded RCFG 6 locations, 2056 edges [2018-06-27 00:07:32,391 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 12:07:32 BasicIcfg [2018-06-27 00:07:32,391 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-27 00:07:32,392 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-27 00:07:32,392 INFO ]: Initializing TraceAbstraction... [2018-06-27 00:07:32,395 INFO ]: TraceAbstraction initialized [2018-06-27 00:07:32,395 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 12:07:19" (1/4) ... [2018-06-27 00:07:32,396 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6625248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 27.06 12:07:32, skipping insertion in model container [2018-06-27 00:07:32,396 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:07:19" (2/4) ... [2018-06-27 00:07:32,396 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6625248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 12:07:32, skipping insertion in model container [2018-06-27 00:07:32,396 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:07:19" (3/4) ... [2018-06-27 00:07:32,397 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6625248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 12:07:32, skipping insertion in model container [2018-06-27 00:07:32,397 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 12:07:32" (4/4) ... [2018-06-27 00:07:32,398 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-27 00:07:32,409 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-27 00:07:32,417 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-27 00:07:32,459 INFO ]: Using default assertion order modulation [2018-06-27 00:07:32,460 INFO ]: Interprodecural is true [2018-06-27 00:07:32,460 INFO ]: Hoare is false [2018-06-27 00:07:32,460 INFO ]: Compute interpolants for FPandBP [2018-06-27 00:07:32,460 INFO ]: Backedges is TWOTRACK [2018-06-27 00:07:32,460 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-27 00:07:32,460 INFO ]: Difference is false [2018-06-27 00:07:32,460 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-27 00:07:32,460 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-27 00:07:32,484 INFO ]: Start isEmpty. Operand 6 states. [2018-06-27 00:07:32,511 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:07:32,512 INFO ]: Found error trace [2018-06-27 00:07:32,512 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:07:32,513 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:32,518 INFO ]: Analyzing trace with hash 161085025, now seen corresponding path program 1 times [2018-06-27 00:07:32,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:32,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:32,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:32,567 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:32,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:32,607 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:07:32,697 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:07:32,698 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:07:32,699 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:07:32,700 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:07:32,709 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:07:32,710 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:07:32,712 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-27 00:07:35,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:07:35,819 INFO ]: Finished difference Result 8 states and 2060 transitions. [2018-06-27 00:07:35,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:07:35,820 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:07:35,820 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:07:35,842 INFO ]: With dead ends: 8 [2018-06-27 00:07:35,842 INFO ]: Without dead ends: 8 [2018-06-27 00:07:35,844 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-27 00:07:35,861 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:07:35,919 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-27 00:07:35,920 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:07:35,925 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2059 transitions. [2018-06-27 00:07:35,926 INFO ]: Start accepts. Automaton has 7 states and 2059 transitions. Word has length 5 [2018-06-27 00:07:35,927 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:07:35,927 INFO ]: Abstraction has 7 states and 2059 transitions. [2018-06-27 00:07:35,927 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:07:35,927 INFO ]: Start isEmpty. Operand 7 states and 2059 transitions. [2018-06-27 00:07:35,928 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:07:35,928 INFO ]: Found error trace [2018-06-27 00:07:35,928 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:07:35,928 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:35,929 INFO ]: Analyzing trace with hash 161085986, now seen corresponding path program 1 times [2018-06-27 00:07:35,929 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:35,929 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:35,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:35,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:35,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:35,956 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:07:35,988 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:07:35,988 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:07:35,988 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:07:35,990 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:07:35,990 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:07:35,990 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:07:35,990 INFO ]: Start difference. First operand 7 states and 2059 transitions. Second operand 3 states. [2018-06-27 00:07:38,399 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:07:38,399 INFO ]: Finished difference Result 8 states and 2058 transitions. [2018-06-27 00:07:38,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:07:38,437 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:07:38,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:07:38,439 INFO ]: With dead ends: 8 [2018-06-27 00:07:38,439 INFO ]: Without dead ends: 8 [2018-06-27 00:07:38,440 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-27 00:07:38,440 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:07:38,451 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-27 00:07:38,451 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:07:38,455 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-27 00:07:38,455 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-27 00:07:38,455 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:07:38,455 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-27 00:07:38,455 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:07:38,455 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-27 00:07:38,456 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:07:38,456 INFO ]: Found error trace [2018-06-27 00:07:38,456 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:07:38,456 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:38,456 INFO ]: Analyzing trace with hash 579679540, now seen corresponding path program 1 times [2018-06-27 00:07:38,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:38,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:38,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:38,457 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:38,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:38,493 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:07:38,553 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:07:38,553 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:07:38,553 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:07:38,553 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:07:38,553 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:07:38,553 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:07:38,553 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-27 00:07:41,561 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:07:41,561 INFO ]: Finished difference Result 8 states and 2057 transitions. [2018-06-27 00:07:41,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:07:41,561 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:07:41,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:07:41,563 INFO ]: With dead ends: 8 [2018-06-27 00:07:41,564 INFO ]: Without dead ends: 7 [2018-06-27 00:07:41,564 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-27 00:07:41,564 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:07:41,574 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:07:41,574 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:07:41,578 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1545 transitions. [2018-06-27 00:07:41,578 INFO ]: Start accepts. Automaton has 7 states and 1545 transitions. Word has length 6 [2018-06-27 00:07:41,578 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:07:41,578 INFO ]: Abstraction has 7 states and 1545 transitions. [2018-06-27 00:07:41,578 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:07:41,578 INFO ]: Start isEmpty. Operand 7 states and 1545 transitions. [2018-06-27 00:07:41,579 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:07:41,579 INFO ]: Found error trace [2018-06-27 00:07:41,579 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:07:41,579 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:41,579 INFO ]: Analyzing trace with hash 580603061, now seen corresponding path program 1 times [2018-06-27 00:07:41,580 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:41,580 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:41,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:41,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:41,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:41,620 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:07:41,679 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:07:41,679 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:07:41,679 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:07:41,679 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:07:41,679 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:07:41,679 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:07:41,679 INFO ]: Start difference. First operand 7 states and 1545 transitions. Second operand 3 states. [2018-06-27 00:07:43,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:07:43,119 INFO ]: Finished difference Result 8 states and 1545 transitions. [2018-06-27 00:07:43,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:07:43,119 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:07:43,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:07:43,121 INFO ]: With dead ends: 8 [2018-06-27 00:07:43,121 INFO ]: Without dead ends: 7 [2018-06-27 00:07:43,121 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-27 00:07:43,121 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:07:43,128 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:07:43,128 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:07:43,130 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1161 transitions. [2018-06-27 00:07:43,130 INFO ]: Start accepts. Automaton has 7 states and 1161 transitions. Word has length 6 [2018-06-27 00:07:43,130 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:07:43,130 INFO ]: Abstraction has 7 states and 1161 transitions. [2018-06-27 00:07:43,130 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:07:43,130 INFO ]: Start isEmpty. Operand 7 states and 1161 transitions. [2018-06-27 00:07:43,131 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:07:43,131 INFO ]: Found error trace [2018-06-27 00:07:43,131 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:07:43,131 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:43,131 INFO ]: Analyzing trace with hash 582450103, now seen corresponding path program 1 times [2018-06-27 00:07:43,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:43,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:43,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:43,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:43,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:43,159 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:07:43,261 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:07:43,261 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:07:43,261 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:07:43,261 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:07:43,261 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:07:43,261 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:07:43,262 INFO ]: Start difference. First operand 7 states and 1161 transitions. Second operand 3 states. [2018-06-27 00:07:44,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:07:44,226 INFO ]: Finished difference Result 8 states and 1161 transitions. [2018-06-27 00:07:44,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:07:44,226 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:07:44,226 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:07:44,227 INFO ]: With dead ends: 8 [2018-06-27 00:07:44,227 INFO ]: Without dead ends: 7 [2018-06-27 00:07:44,227 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-27 00:07:44,227 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:07:44,230 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:07:44,230 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:07:44,232 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2018-06-27 00:07:44,232 INFO ]: Start accepts. Automaton has 7 states and 777 transitions. Word has length 6 [2018-06-27 00:07:44,232 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:07:44,232 INFO ]: Abstraction has 7 states and 777 transitions. [2018-06-27 00:07:44,232 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:07:44,232 INFO ]: Start isEmpty. Operand 7 states and 777 transitions. [2018-06-27 00:07:44,233 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:07:44,233 INFO ]: Found error trace [2018-06-27 00:07:44,233 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:07:44,233 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:44,233 INFO ]: Analyzing trace with hash -362311880, now seen corresponding path program 1 times [2018-06-27 00:07:44,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:44,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:44,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:44,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:44,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:44,267 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:07:44,321 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:07:44,321 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:07:44,321 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:07:44,322 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:07:44,322 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:07:44,322 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:07:44,322 INFO ]: Start difference. First operand 7 states and 777 transitions. Second operand 3 states. [2018-06-27 00:07:44,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:07:44,969 INFO ]: Finished difference Result 8 states and 777 transitions. [2018-06-27 00:07:44,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:07:44,970 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:07:44,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:07:44,971 INFO ]: With dead ends: 8 [2018-06-27 00:07:44,971 INFO ]: Without dead ends: 7 [2018-06-27 00:07:44,971 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-27 00:07:44,971 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:07:44,973 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:07:44,973 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:07:44,975 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 521 transitions. [2018-06-27 00:07:44,975 INFO ]: Start accepts. Automaton has 7 states and 521 transitions. Word has length 6 [2018-06-27 00:07:44,975 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:07:44,975 INFO ]: Abstraction has 7 states and 521 transitions. [2018-06-27 00:07:44,975 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:07:44,975 INFO ]: Start isEmpty. Operand 7 states and 521 transitions. [2018-06-27 00:07:44,975 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:07:44,975 INFO ]: Found error trace [2018-06-27 00:07:44,975 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:07:44,976 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:44,976 INFO ]: Analyzing trace with hash 586144187, now seen corresponding path program 1 times [2018-06-27 00:07:44,976 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:44,976 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:44,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:44,976 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:44,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:44,995 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:07:45,090 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:07:45,091 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:07:45,091 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:07:45,091 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:07:45,091 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:07:45,091 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:07:45,091 INFO ]: Start difference. First operand 7 states and 521 transitions. Second operand 3 states. [2018-06-27 00:07:45,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:07:45,522 INFO ]: Finished difference Result 8 states and 521 transitions. [2018-06-27 00:07:45,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:07:45,523 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:07:45,523 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:07:45,524 INFO ]: With dead ends: 8 [2018-06-27 00:07:45,524 INFO ]: Without dead ends: 7 [2018-06-27 00:07:45,524 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-27 00:07:45,524 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:07:45,526 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:07:45,526 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:07:45,527 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 393 transitions. [2018-06-27 00:07:45,527 INFO ]: Start accepts. Automaton has 7 states and 393 transitions. Word has length 6 [2018-06-27 00:07:45,530 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:07:45,530 INFO ]: Abstraction has 7 states and 393 transitions. [2018-06-27 00:07:45,530 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:07:45,530 INFO ]: Start isEmpty. Operand 7 states and 393 transitions. [2018-06-27 00:07:45,530 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:07:45,530 INFO ]: Found error trace [2018-06-27 00:07:45,530 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:07:45,530 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:45,530 INFO ]: Analyzing trace with hash -837925195, now seen corresponding path program 1 times [2018-06-27 00:07:45,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:45,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:45,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:45,531 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:45,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:45,544 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:07:45,623 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:07:45,623 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:07:45,623 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:07:45,624 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:07:45,624 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:07:45,624 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:07:45,624 INFO ]: Start difference. First operand 7 states and 393 transitions. Second operand 3 states. [2018-06-27 00:07:45,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:07:45,952 INFO ]: Finished difference Result 8 states and 393 transitions. [2018-06-27 00:07:45,952 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:07:45,952 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:07:45,952 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:07:45,952 INFO ]: With dead ends: 8 [2018-06-27 00:07:45,952 INFO ]: Without dead ends: 7 [2018-06-27 00:07:45,953 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-27 00:07:45,953 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:07:45,954 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:07:45,954 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:07:45,954 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 265 transitions. [2018-06-27 00:07:45,954 INFO ]: Start accepts. Automaton has 7 states and 265 transitions. Word has length 6 [2018-06-27 00:07:45,955 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:07:45,955 INFO ]: Abstraction has 7 states and 265 transitions. [2018-06-27 00:07:45,955 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:07:45,955 INFO ]: Start isEmpty. Operand 7 states and 265 transitions. [2018-06-27 00:07:45,955 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:07:45,955 INFO ]: Found error trace [2018-06-27 00:07:45,955 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:07:45,955 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:45,955 INFO ]: Analyzing trace with hash -837001674, now seen corresponding path program 1 times [2018-06-27 00:07:45,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:45,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:45,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:45,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:45,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:45,971 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:07:46,015 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:07:46,015 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:07:46,015 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:07:46,015 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:07:46,015 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:07:46,015 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:07:46,015 INFO ]: Start difference. First operand 7 states and 265 transitions. Second operand 3 states. [2018-06-27 00:07:46,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:07:46,266 INFO ]: Finished difference Result 8 states and 265 transitions. [2018-06-27 00:07:46,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:07:46,267 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:07:46,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:07:46,267 INFO ]: With dead ends: 8 [2018-06-27 00:07:46,267 INFO ]: Without dead ends: 7 [2018-06-27 00:07:46,267 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-27 00:07:46,267 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:07:46,269 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:07:46,269 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:07:46,269 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2018-06-27 00:07:46,269 INFO ]: Start accepts. Automaton has 7 states and 169 transitions. Word has length 6 [2018-06-27 00:07:46,269 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:07:46,269 INFO ]: Abstraction has 7 states and 169 transitions. [2018-06-27 00:07:46,269 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:07:46,269 INFO ]: Start isEmpty. Operand 7 states and 169 transitions. [2018-06-27 00:07:46,269 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:07:46,269 INFO ]: Found error trace [2018-06-27 00:07:46,269 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:07:46,269 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:46,269 INFO ]: Analyzing trace with hash -600580298, now seen corresponding path program 1 times [2018-06-27 00:07:46,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:46,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:46,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:46,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:46,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:46,279 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:07:46,386 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:07:46,387 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:07:46,387 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:07:46,387 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:07:46,387 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:07:46,387 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:07:46,387 INFO ]: Start difference. First operand 7 states and 169 transitions. Second operand 3 states. [2018-06-27 00:07:46,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:07:46,569 INFO ]: Finished difference Result 8 states and 169 transitions. [2018-06-27 00:07:46,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:07:46,569 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:07:46,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:07:46,569 INFO ]: With dead ends: 8 [2018-06-27 00:07:46,569 INFO ]: Without dead ends: 7 [2018-06-27 00:07:46,569 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-27 00:07:46,570 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:07:46,570 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:07:46,570 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:07:46,571 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-06-27 00:07:46,571 INFO ]: Start accepts. Automaton has 7 states and 129 transitions. Word has length 6 [2018-06-27 00:07:46,571 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:07:46,571 INFO ]: Abstraction has 7 states and 129 transitions. [2018-06-27 00:07:46,571 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:07:46,571 INFO ]: Start isEmpty. Operand 7 states and 129 transitions. [2018-06-27 00:07:46,571 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:07:46,571 INFO ]: Found error trace [2018-06-27 00:07:46,571 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:07:46,571 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:46,571 INFO ]: Analyzing trace with hash -1071576008, now seen corresponding path program 1 times [2018-06-27 00:07:46,571 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:46,571 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:46,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:46,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:46,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:46,581 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:07:46,607 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:07:46,607 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:07:46,607 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:07:46,607 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:07:46,608 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:07:46,608 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:07:46,608 INFO ]: Start difference. First operand 7 states and 129 transitions. Second operand 3 states. [2018-06-27 00:07:46,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:07:46,718 INFO ]: Finished difference Result 8 states and 129 transitions. [2018-06-27 00:07:46,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:07:46,718 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:07:46,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:07:46,719 INFO ]: With dead ends: 8 [2018-06-27 00:07:46,719 INFO ]: Without dead ends: 7 [2018-06-27 00:07:46,719 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-27 00:07:46,719 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:07:46,720 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:07:46,720 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:07:46,720 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-06-27 00:07:46,720 INFO ]: Start accepts. Automaton has 7 states and 105 transitions. Word has length 6 [2018-06-27 00:07:46,720 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:07:46,720 INFO ]: Abstraction has 7 states and 105 transitions. [2018-06-27 00:07:46,720 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:07:46,720 INFO ]: Start isEmpty. Operand 7 states and 105 transitions. [2018-06-27 00:07:46,720 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:07:46,720 INFO ]: Found error trace [2018-06-27 00:07:46,720 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:07:46,721 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:46,721 INFO ]: Analyzing trace with hash -718790986, now seen corresponding path program 1 times [2018-06-27 00:07:46,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:46,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:46,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:46,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:46,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:46,728 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:07:46,816 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:07:46,816 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:07:46,816 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:07:46,816 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:07:46,816 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:07:46,816 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:07:46,816 INFO ]: Start difference. First operand 7 states and 105 transitions. Second operand 3 states. [2018-06-27 00:07:46,910 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:07:46,910 INFO ]: Finished difference Result 8 states and 105 transitions. [2018-06-27 00:07:46,910 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:07:46,910 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:07:46,910 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:07:46,910 INFO ]: With dead ends: 8 [2018-06-27 00:07:46,910 INFO ]: Without dead ends: 7 [2018-06-27 00:07:46,911 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-27 00:07:46,911 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:07:46,911 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:07:46,911 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:07:46,912 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2018-06-27 00:07:46,912 INFO ]: Start accepts. Automaton has 7 states and 73 transitions. Word has length 6 [2018-06-27 00:07:46,912 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:07:46,912 INFO ]: Abstraction has 7 states and 73 transitions. [2018-06-27 00:07:46,912 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:07:46,912 INFO ]: Start isEmpty. Operand 7 states and 73 transitions. [2018-06-27 00:07:46,912 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:07:46,912 INFO ]: Found error trace [2018-06-27 00:07:46,912 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:07:46,912 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:07:46,912 INFO ]: Analyzing trace with hash -4909253, now seen corresponding path program 1 times [2018-06-27 00:07:46,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:07:46,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:07:46,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:46,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:07:46,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:07:46,929 INFO ]: Conjunction of SSA is sat [2018-06-27 00:07:46,932 INFO ]: Counterexample might be feasible [2018-06-27 00:07:46,947 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-27 00:07:46,948 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 12:07:46 BasicIcfg [2018-06-27 00:07:46,948 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-27 00:07:46,949 INFO ]: Toolchain (without parser) took 27633.29 ms. Allocated memory was 308.8 MB in the beginning and 1.2 GB in the end (delta: 846.7 MB). Free memory was 261.2 MB in the beginning and 606.8 MB in the end (delta: -345.6 MB). Peak memory consumption was 501.1 MB. Max. memory is 3.6 GB. [2018-06-27 00:07:46,951 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 00:07:46,951 INFO ]: ChcToBoogie took 67.77 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 257.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-27 00:07:46,951 INFO ]: Boogie Preprocessor took 42.73 ms. Allocated memory is still 308.8 MB. Free memory is still 257.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 00:07:46,952 INFO ]: RCFGBuilder took 305.03 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 243.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-27 00:07:46,952 INFO ]: BlockEncodingV2 took 12653.52 ms. Allocated memory was 308.8 MB in the beginning and 805.8 MB in the end (delta: 497.0 MB). Free memory was 243.2 MB in the beginning and 565.8 MB in the end (delta: -322.7 MB). Peak memory consumption was 441.9 MB. Max. memory is 3.6 GB. [2018-06-27 00:07:46,953 INFO ]: TraceAbstraction took 14555.80 ms. Allocated memory was 805.8 MB in the beginning and 1.2 GB in the end (delta: 349.7 MB). Free memory was 565.8 MB in the beginning and 606.8 MB in the end (delta: -41.0 MB). Peak memory consumption was 308.7 MB. Max. memory is 3.6 GB. [2018-06-27 00:07:46,956 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, 2056 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.77 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 257.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.73 ms. Allocated memory is still 308.8 MB. Free memory is still 257.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 305.03 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 243.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 12653.52 ms. Allocated memory was 308.8 MB in the beginning and 805.8 MB in the end (delta: 497.0 MB). Free memory was 243.2 MB in the beginning and 565.8 MB in the end (delta: -322.7 MB). Peak memory consumption was 441.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 14555.80 ms. Allocated memory was 805.8 MB in the beginning and 1.2 GB in the end (delta: 349.7 MB). Free memory was 565.8 MB in the beginning and 606.8 MB in the end (delta: -41.0 MB). Peak memory consumption was 308.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assume !hbv_False_1_Bool; [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_False_2_Int, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Bool, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Bool, hbv_False_14_Bool, hbv_False_15_Int, hbv_False_16_Bool, hbv_False_17_Bool, hbv_False_18_Bool, hbv_False_19_Bool, hbv_False_1_Bool, hbv_False_20_Bool, hbv_False_21_Bool; [L0] havoc hbv_False_2_Int, hbv_False_14_Bool, hbv_False_5_Bool, hbv_False_9_Int, hbv_False_4_Bool, hbv_False_18_Bool, hbv_False_19_Bool, hbv_False_11_Int, hbv_False_8_Int, hbv_False_15_Int, hbv_False_20_Bool, hbv_False_10_Int, hbv_False_13_Bool, hbv_False_1_Bool, hbv_False_6_Int, hbv_False_16_Bool, hbv_False_7_Int, hbv_False_3_Bool, hbv_False_17_Bool, hbv_False_12_Int, hbv_False_21_Bool; [L0] assume ((((((((((((((((((((((((((((((((((((((!(((hbv_state_2_Bool && !hhv_state_17_Bool) || hhv_state_3_Bool) && ((!hhv_state_3_Bool || !hbv_state_2_Bool) || hhv_state_17_Bool)) && !((hbv_state_9_Bool && !hbv_state_10_Bool) && !(hbv_state_15_Int == 2))) && !((!hbv_state_11_Bool || !hbv_state_12_Bool) && (hbv_state_11_Bool || hbv_state_12_Bool))) && !((!(hbv_state_8_Int == hbv_state_6_Int) && !hbv_state_10_Bool) && !hbv_state_9_Bool)) && !(!(hbv_state_15_Int == 0) && (hbv_state_10_Bool || !hbv_state_9_Bool))) && !((!hbv_state_18_Bool || !hbv_state_1_Bool) && (hbv_state_1_Bool || hbv_state_18_Bool))) && hhv_state_7_Int == hhv_state_10_Int) && !((hbv_state_3_Bool || hbv_state_13_Bool) && (!hbv_state_3_Bool || !hbv_state_13_Bool))) && hbv_state_16_Int == hbv_state_8_Int) && hbv_state_14_Int == hbv_state_7_Int) && hbv_state_4_Int == hbv_state_5_Int) && hhv_state_4_Int == hhv_state_7_Int) && hbv_state_16_Int == hbv_state_4_Int) && hbv_state_19_Int == hbv_state_6_Int) && hhv_state_6_Int == hhv_state_0_Int) && !((!hhv_state_16_Bool || !hhv_state_11_Bool) && (hhv_state_16_Bool || hhv_state_11_Bool))) && !((!(hhv_state_8_Int == hhv_state_13_Int) && !hhv_state_15_Bool) && hhv_state_14_Bool)) && hhv_state_5_Int == hhv_state_4_Int) && !((!hhv_state_18_Bool || !hhv_state_3_Bool) && (hhv_state_3_Bool || hhv_state_18_Bool))) && !(!(hhv_state_13_Int == 0) && (!hhv_state_14_Bool || hhv_state_15_Bool))) && !((hhv_state_1_Bool || hhv_state_12_Bool) && (!hhv_state_1_Bool || !hhv_state_12_Bool))) && hhv_state_9_Int == hhv_state_8_Int) && !((hbv_state_1_Bool || hbv_state_17_Bool) && (!hbv_state_17_Bool || !hbv_state_1_Bool))) && !(((hhv_state_19_Bool || 10 <= hhv_state_10_Int) && !hbv_state_3_Bool) && (!hhv_state_19_Bool || !(10 <= hhv_state_10_Int)))) && !(((!(hhv_state_10_Int <= -10) || !hhv_state_20_Bool) && (hhv_state_20_Bool || hhv_state_10_Int <= -10)) && !hbv_state_1_Bool)) && !(!(hhv_state_8_Int == 1) && (!hhv_state_14_Bool || hhv_state_15_Bool))) && !((!hhv_state_12_Bool || !hhv_state_17_Bool) && (hhv_state_17_Bool || hhv_state_12_Bool))) && hbv_state_4_Int == hhv_state_0_Int) && !(((!(hhv_state_10_Int <= 0) || hhv_state_19_Bool) && hbv_state_3_Bool) && (hhv_state_10_Int <= 0 || !hhv_state_19_Bool))) && !(((hhv_state_20_Bool || !(0 <= hhv_state_10_Int)) && hbv_state_1_Bool) && (0 <= hhv_state_10_Int || !hhv_state_20_Bool))) && !((hbv_state_9_Bool && !hbv_state_10_Bool) && !(hbv_state_14_Int == hbv_state_15_Int))) && !((!hhv_state_2_Bool || !hhv_state_11_Bool) && (hhv_state_11_Bool || hhv_state_2_Bool))) && !(!(hbv_state_8_Int + (-1 * hbv_state_6_Int + -1 * hbv_state_7_Int) == 0) && (hbv_state_9_Bool || hbv_state_10_Bool))) && !((!(hhv_state_13_Int == 2) && !hhv_state_15_Bool) && hhv_state_14_Bool)) && !((!hhv_state_15_Bool && !(hhv_state_5_Int == hhv_state_6_Int)) && !hhv_state_14_Bool)) && !((!hhv_state_19_Bool || !hhv_state_2_Bool) && (hhv_state_2_Bool || hhv_state_19_Bool))) && !((hhv_state_14_Bool || hhv_state_15_Bool) && !(hhv_state_5_Int + (-1 * hhv_state_6_Int + -1 * hhv_state_9_Int) == 0))) && !(!(hbv_state_14_Int == 1) && (hbv_state_10_Bool || !hbv_state_9_Bool))) && !((hhv_state_20_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_20_Bool))) && !((hbv_state_2_Bool || hbv_state_3_Bool) && (!hbv_state_3_Bool || !hbv_state_2_Bool)); [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_state_19_Int, hbv_state_18_Bool, hbv_state_13_Bool, hbv_state_11_Bool, hbv_state_16_Int, hbv_state_8_Int, hbv_state_6_Int, hbv_state_4_Int, hbv_state_14_Int, hbv_state_7_Int, hbv_state_5_Int, hbv_state_3_Bool, hbv_state_1_Bool, hbv_state_15_Int, hbv_state_9_Bool, hbv_state_10_Bool, hbv_state_2_Bool, hbv_state_17_Bool, hbv_state_12_Bool, hbv_state_20_Bool, hbv_state_21_Bool; [L0] havoc hbv_state_16_Int, hbv_state_21_Bool, hbv_state_1_Bool, hbv_state_6_Int, hbv_state_3_Bool, hbv_state_4_Int, hbv_state_5_Int, hbv_state_8_Int, hbv_state_13_Bool, hbv_state_18_Bool, hbv_state_19_Int, hbv_state_20_Bool, hbv_state_2_Bool, hbv_state_7_Int, hbv_state_12_Bool, hbv_state_15_Int, hbv_state_9_Bool, hbv_state_10_Bool, hbv_state_14_Int, hbv_state_11_Bool, hbv_state_17_Bool; [L0] RET call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. UNSAFE Result, 14.4s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11220 SDtfs, 2 SDslu, 36 SDs, 0 SdLazy, 6134 SolverSat, 5050 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 10/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e7_55.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-27_00-07-46-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e7_55.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-27_00-07-46-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e7_55.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-27_00-07-46-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e7_55.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-27_00-07-46-971.csv Received shutdown request...