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/nested3.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:37:39,851 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:37:39,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:37:39,866 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:37:39,867 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:37:39,867 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:37:39,871 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:37:39,877 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:37:39,878 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:37:39,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:37:39,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:37:39,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:37:39,883 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:37:39,883 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:37:39,884 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:37:39,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:37:39,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:37:39,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:37:39,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:37:39,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:37:39,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:37:39,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:37:39,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:37:39,909 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:37:39,909 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:37:39,910 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:37:39,911 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:37:39,911 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:37:39,919 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:37:39,920 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:37:39,923 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:37:39,924 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:37:39,924 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:37:39,924 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:37:39,925 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:37:39,926 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:37:39,926 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:37:39,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:37:39,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:37:39,951 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:37:39,952 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:37:39,953 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:37:39,953 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:37:39,953 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:37:39,953 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:37:39,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:37:39,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:37:39,954 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:37:39,954 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:37:39,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:37:39,954 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:37:39,955 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:37:39,956 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:37:39,956 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:37:39,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:37:39,956 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:37:39,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:37:39,957 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:37:39,958 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:37:39,958 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:37:40,016 INFO ]: Repository-Root is: /tmp [2018-06-26 21:37:40,033 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:37:40,039 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:37:40,040 INFO ]: Initializing SmtParser... [2018-06-26 21:37:40,040 INFO ]: SmtParser initialized [2018-06-26 21:37:40,041 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested3.c.smt2 [2018-06-26 21:37:40,042 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:37:40,125 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested3.c.smt2 unknown [2018-06-26 21:37:40,353 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested3.c.smt2 [2018-06-26 21:37:40,357 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:37:40,363 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:37:40,363 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:37:40,363 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:37:40,364 INFO ]: ChcToBoogie initialized [2018-06-26 21:37:40,367 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:37:40" (1/1) ... [2018-06-26 21:37:40,417 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:40 Unit [2018-06-26 21:37:40,417 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:37:40,418 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:37:40,418 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:37:40,418 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:37:40,439 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:40" (1/1) ... [2018-06-26 21:37:40,439 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:40" (1/1) ... [2018-06-26 21:37:40,447 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:40" (1/1) ... [2018-06-26 21:37:40,447 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:40" (1/1) ... [2018-06-26 21:37:40,461 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:40" (1/1) ... [2018-06-26 21:37:40,463 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:40" (1/1) ... [2018-06-26 21:37:40,464 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:40" (1/1) ... [2018-06-26 21:37:40,478 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:37:40,478 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:37:40,478 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:37:40,478 INFO ]: RCFGBuilder initialized [2018-06-26 21:37:40,479 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:40" (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:37:40,502 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:37:40,502 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:37:40,502 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:37:40,502 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:37:40,502 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:37:40,502 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:37:40,747 INFO ]: Using library mode [2018-06-26 21:37:40,747 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:37:40 BoogieIcfgContainer [2018-06-26 21:37:40,747 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:37:40,748 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:37:40,748 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:37:40,750 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:37:40,751 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:37:40" (1/1) ... [2018-06-26 21:37:40,765 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:37:40,766 INFO ]: Using Remove infeasible edges [2018-06-26 21:37:40,767 INFO ]: Using Maximize final states [2018-06-26 21:37:40,768 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:37:40,768 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:37:40,769 INFO ]: Using Remove sink states [2018-06-26 21:37:40,770 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:37:40,770 INFO ]: Using Use SBE [2018-06-26 21:37:40,783 WARN ]: expecting exponential blowup for input size 23 [2018-06-26 21:37:51,379 INFO ]: SBE split 1 edges [2018-06-26 21:37:51,387 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:37:51,390 INFO ]: 0 new accepting states [2018-06-26 21:37:51,414 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 21:37:51,415 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:37:51,420 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:37:51,420 INFO ]: 0 new accepting states [2018-06-26 21:37:51,420 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:37:51,420 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:37:51,424 INFO ]: Encoded RCFG 6 locations, 101 edges [2018-06-26 21:37:51,424 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:37:51 BasicIcfg [2018-06-26 21:37:51,425 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:37:51,426 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:37:51,426 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:37:51,429 INFO ]: TraceAbstraction initialized [2018-06-26 21:37:51,429 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:37:40" (1/4) ... [2018-06-26 21:37:51,430 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e42add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:37:51, skipping insertion in model container [2018-06-26 21:37:51,430 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:40" (2/4) ... [2018-06-26 21:37:51,430 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e42add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:37:51, skipping insertion in model container [2018-06-26 21:37:51,430 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:37:40" (3/4) ... [2018-06-26 21:37:51,430 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e42add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:37:51, skipping insertion in model container [2018-06-26 21:37:51,430 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:37:51" (4/4) ... [2018-06-26 21:37:51,433 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:37:51,441 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:37:51,447 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:37:51,488 INFO ]: Using default assertion order modulation [2018-06-26 21:37:51,488 INFO ]: Interprodecural is true [2018-06-26 21:37:51,488 INFO ]: Hoare is false [2018-06-26 21:37:51,488 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:37:51,488 INFO ]: Backedges is TWOTRACK [2018-06-26 21:37:51,488 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:37:51,488 INFO ]: Difference is false [2018-06-26 21:37:51,488 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:37:51,488 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:37:51,498 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:37:51,510 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:37:51,510 INFO ]: Found error trace [2018-06-26 21:37:51,511 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:37:51,511 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:51,514 INFO ]: Analyzing trace with hash 38354754, now seen corresponding path program 1 times [2018-06-26 21:37:51,515 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:51,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:51,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:51,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:51,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:51,587 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:51,686 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:37:51,688 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:51,688 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:51,690 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:51,714 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:51,715 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:51,717 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:37:53,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:53,113 INFO ]: Finished difference Result 7 states and 149 transitions. [2018-06-26 21:37:53,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:53,114 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:37:53,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:53,123 INFO ]: With dead ends: 7 [2018-06-26 21:37:53,123 INFO ]: Without dead ends: 7 [2018-06-26 21:37:53,125 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:37:53,143 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:37:53,161 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:37:53,162 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:37:53,163 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2018-06-26 21:37:53,164 INFO ]: Start accepts. Automaton has 7 states and 149 transitions. Word has length 5 [2018-06-26 21:37:53,165 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:53,165 INFO ]: Abstraction has 7 states and 149 transitions. [2018-06-26 21:37:53,165 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:53,165 INFO ]: Start isEmpty. Operand 7 states and 149 transitions. [2018-06-26 21:37:53,165 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:37:53,165 INFO ]: Found error trace [2018-06-26 21:37:53,165 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:37:53,166 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:53,166 INFO ]: Analyzing trace with hash 1187989444, now seen corresponding path program 1 times [2018-06-26 21:37:53,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:53,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:53,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:53,167 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:53,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:53,175 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:53,224 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:37:53,224 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:53,224 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:53,225 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:53,225 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:53,225 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:53,225 INFO ]: Start difference. First operand 7 states and 149 transitions. Second operand 3 states. [2018-06-26 21:37:53,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:53,832 INFO ]: Finished difference Result 9 states and 229 transitions. [2018-06-26 21:37:53,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:53,832 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:37:53,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:53,833 INFO ]: With dead ends: 9 [2018-06-26 21:37:53,833 INFO ]: Without dead ends: 9 [2018-06-26 21:37:53,834 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:37:53,834 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:37:53,838 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 21:37:53,838 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:37:53,839 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2018-06-26 21:37:53,839 INFO ]: Start accepts. Automaton has 9 states and 229 transitions. Word has length 6 [2018-06-26 21:37:53,839 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:53,839 INFO ]: Abstraction has 9 states and 229 transitions. [2018-06-26 21:37:53,839 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:53,839 INFO ]: Start isEmpty. Operand 9 states and 229 transitions. [2018-06-26 21:37:53,840 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:37:53,840 INFO ]: Found error trace [2018-06-26 21:37:53,840 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:37:53,840 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:53,840 INFO ]: Analyzing trace with hash 1186738222, now seen corresponding path program 1 times [2018-06-26 21:37:53,840 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:53,840 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:53,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:53,841 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:53,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:53,851 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:53,872 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:37:53,872 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:53,872 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:53,872 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:53,873 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:53,873 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:53,873 INFO ]: Start difference. First operand 9 states and 229 transitions. Second operand 3 states. [2018-06-26 21:37:54,201 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:54,201 INFO ]: Finished difference Result 13 states and 297 transitions. [2018-06-26 21:37:54,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:54,201 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:37:54,201 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:54,203 INFO ]: With dead ends: 13 [2018-06-26 21:37:54,203 INFO ]: Without dead ends: 13 [2018-06-26 21:37:54,203 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:37:54,203 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:37:54,207 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:37:54,207 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:37:54,208 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 297 transitions. [2018-06-26 21:37:54,208 INFO ]: Start accepts. Automaton has 13 states and 297 transitions. Word has length 6 [2018-06-26 21:37:54,208 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:54,208 INFO ]: Abstraction has 13 states and 297 transitions. [2018-06-26 21:37:54,208 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:54,208 INFO ]: Start isEmpty. Operand 13 states and 297 transitions. [2018-06-26 21:37:54,208 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:37:54,209 INFO ]: Found error trace [2018-06-26 21:37:54,209 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:37:54,209 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:54,209 INFO ]: Analyzing trace with hash 2030253796, now seen corresponding path program 1 times [2018-06-26 21:37:54,209 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:54,209 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:54,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:54,210 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:54,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:54,223 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:54,246 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 21:37:54,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:54,247 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:54,247 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:54,247 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:54,247 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:54,247 INFO ]: Start difference. First operand 13 states and 297 transitions. Second operand 3 states. [2018-06-26 21:37:54,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:54,473 INFO ]: Finished difference Result 13 states and 210 transitions. [2018-06-26 21:37:54,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:54,473 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:37:54,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:54,474 INFO ]: With dead ends: 13 [2018-06-26 21:37:54,474 INFO ]: Without dead ends: 13 [2018-06-26 21:37:54,474 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:37:54,474 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:37:54,477 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:37:54,477 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:37:54,478 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 210 transitions. [2018-06-26 21:37:54,478 INFO ]: Start accepts. Automaton has 13 states and 210 transitions. Word has length 8 [2018-06-26 21:37:54,478 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:54,478 INFO ]: Abstraction has 13 states and 210 transitions. [2018-06-26 21:37:54,478 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:54,478 INFO ]: Start isEmpty. Operand 13 states and 210 transitions. [2018-06-26 21:37:54,478 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 21:37:54,478 INFO ]: Found error trace [2018-06-26 21:37:54,478 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:37:54,478 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:54,479 INFO ]: Analyzing trace with hash -1598274684, now seen corresponding path program 1 times [2018-06-26 21:37:54,479 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:54,479 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:54,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:54,479 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:54,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:54,489 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:54,507 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 21:37:54,507 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:54,507 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:54,507 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:54,507 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:54,507 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:54,507 INFO ]: Start difference. First operand 13 states and 210 transitions. Second operand 3 states. [2018-06-26 21:37:54,780 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:54,780 INFO ]: Finished difference Result 18 states and 224 transitions. [2018-06-26 21:37:54,780 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:54,780 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 21:37:54,780 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:54,781 INFO ]: With dead ends: 18 [2018-06-26 21:37:54,781 INFO ]: Without dead ends: 17 [2018-06-26 21:37:54,781 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:37:54,781 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 21:37:54,783 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 21:37:54,783 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 21:37:54,784 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 155 transitions. [2018-06-26 21:37:54,784 INFO ]: Start accepts. Automaton has 17 states and 155 transitions. Word has length 9 [2018-06-26 21:37:54,784 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:54,784 INFO ]: Abstraction has 17 states and 155 transitions. [2018-06-26 21:37:54,784 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:54,784 INFO ]: Start isEmpty. Operand 17 states and 155 transitions. [2018-06-26 21:37:54,785 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 21:37:54,785 INFO ]: Found error trace [2018-06-26 21:37:54,785 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:37:54,785 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:54,785 INFO ]: Analyzing trace with hash 1805839173, now seen corresponding path program 1 times [2018-06-26 21:37:54,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:54,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:54,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:54,786 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:54,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:54,804 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:54,827 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 21:37:54,827 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:54,827 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:54,827 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:54,827 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:54,827 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:54,827 INFO ]: Start difference. First operand 17 states and 155 transitions. Second operand 3 states. [2018-06-26 21:37:54,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:54,913 INFO ]: Finished difference Result 17 states and 122 transitions. [2018-06-26 21:37:54,913 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:54,913 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 21:37:54,913 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:54,913 INFO ]: With dead ends: 17 [2018-06-26 21:37:54,913 INFO ]: Without dead ends: 17 [2018-06-26 21:37:54,914 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:37:54,914 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 21:37:54,916 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 21:37:54,916 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 21:37:54,916 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 122 transitions. [2018-06-26 21:37:54,916 INFO ]: Start accepts. Automaton has 17 states and 122 transitions. Word has length 10 [2018-06-26 21:37:54,916 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:54,916 INFO ]: Abstraction has 17 states and 122 transitions. [2018-06-26 21:37:54,916 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:54,916 INFO ]: Start isEmpty. Operand 17 states and 122 transitions. [2018-06-26 21:37:54,917 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 21:37:54,917 INFO ]: Found error trace [2018-06-26 21:37:54,917 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:37:54,917 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:54,917 INFO ]: Analyzing trace with hash 1350943184, now seen corresponding path program 1 times [2018-06-26 21:37:54,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:54,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:54,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:54,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:54,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:54,937 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:54,993 INFO ]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 21:37:54,993 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:37:54,993 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:37:55,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:55,062 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:55,070 INFO ]: Computing forward predicates... [2018-06-26 21:37:55,094 INFO ]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 21:37:55,129 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:37:55,129 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 21:37:55,129 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:37:55,129 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:37:55,130 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:37:55,130 INFO ]: Start difference. First operand 17 states and 122 transitions. Second operand 4 states. [2018-06-26 21:37:56,382 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:56,382 INFO ]: Finished difference Result 31 states and 282 transitions. [2018-06-26 21:37:56,385 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 21:37:56,385 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-26 21:37:56,385 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:56,385 INFO ]: With dead ends: 31 [2018-06-26 21:37:56,385 INFO ]: Without dead ends: 0 [2018-06-26 21:37:56,386 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:37:56,386 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 21:37:56,386 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 21:37:56,386 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 21:37:56,386 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 21:37:56,386 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-06-26 21:37:56,386 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:56,386 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 21:37:56,386 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:37:56,386 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 21:37:56,386 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 21:37:56,388 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:37:56,390 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:37:56 BasicIcfg [2018-06-26 21:37:56,390 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:37:56,391 INFO ]: Toolchain (without parser) took 16033.03 ms. Allocated memory was 306.7 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 261.0 MB in the beginning and 1.2 GB in the end (delta: -905.6 MB). Peak memory consumption was 680.4 MB. Max. memory is 3.6 GB. [2018-06-26 21:37:56,392 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:37:56,393 INFO ]: ChcToBoogie took 53.92 ms. Allocated memory is still 306.7 MB. Free memory was 260.0 MB in the beginning and 258.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:37:56,393 INFO ]: Boogie Preprocessor took 59.98 ms. Allocated memory is still 306.7 MB. Free memory was 258.0 MB in the beginning and 257.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 21:37:56,394 INFO ]: RCFGBuilder took 268.92 ms. Allocated memory is still 306.7 MB. Free memory was 257.0 MB in the beginning and 248.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:37:56,394 INFO ]: BlockEncodingV2 took 10676.92 ms. Allocated memory was 306.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 248.0 MB in the beginning and 696.2 MB in the end (delta: -448.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 21:37:56,395 INFO ]: TraceAbstraction took 4964.44 ms. Allocated memory was 1.8 GB in the beginning and 1.9 GB in the end (delta: 88.6 MB). Free memory was 696.2 MB in the beginning and 1.2 GB in the end (delta: -470.4 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:37:56,399 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, 101 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.92 ms. Allocated memory is still 306.7 MB. Free memory was 260.0 MB in the beginning and 258.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 59.98 ms. Allocated memory is still 306.7 MB. Free memory was 258.0 MB in the beginning and 257.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 268.92 ms. Allocated memory is still 306.7 MB. Free memory was 257.0 MB in the beginning and 248.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 10676.92 ms. Allocated memory was 306.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 248.0 MB in the beginning and 696.2 MB in the end (delta: -448.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. * TraceAbstraction took 4964.44 ms. Allocated memory was 1.8 GB in the beginning and 1.9 GB in the end (delta: 88.6 MB). Free memory was 696.2 MB in the beginning and 1.2 GB in the end (delta: -470.4 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 29 SDtfs, 3 SDslu, 20 SDs, 0 SdLazy, 964 SolverSat, 798 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=5, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 66/75 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested3.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_21-37-56-412.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested3.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_21-37-56-412.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested3.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_21-37-56-412.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested3.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_21-37-56-412.csv Received shutdown request...