java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__nested-while.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:59:45,933 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:59:45,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:59:45,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:59:45,952 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:59:45,953 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:59:45,954 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:59:45,956 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:59:45,958 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:59:45,958 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:59:45,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:59:45,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:59:45,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:59:45,962 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:59:45,963 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:59:45,963 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:59:45,967 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:59:45,968 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:59:45,978 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:59:45,979 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:59:45,980 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:59:45,982 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:59:45,982 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:59:45,982 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:59:45,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:59:45,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:59:45,988 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:59:45,988 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:59:45,989 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:59:45,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:59:45,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:59:45,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:59:45,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:59:45,993 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:59:45,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:59:45,994 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:59:46,012 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:59:46,013 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:59:46,013 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:59:46,013 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:59:46,014 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:59:46,014 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:59:46,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:59:46,014 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:59:46,015 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:59:46,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:59:46,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:59:46,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:59:46,015 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:59:46,015 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:59:46,016 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:59:46,019 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:59:46,019 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:59:46,019 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:59:46,019 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:59:46,021 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:59:46,021 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:59:46,069 INFO ]: Repository-Root is: /tmp [2018-06-22 11:59:46,084 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:59:46,089 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:59:46,091 INFO ]: Initializing SmtParser... [2018-06-22 11:59:46,091 INFO ]: SmtParser initialized [2018-06-22 11:59:46,092 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__nested-while.smt2 [2018-06-22 11:59:46,093 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-22 11:59:46,163 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__nested-while.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@49d59bf3 [2018-06-22 11:59:46,361 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__nested-while.smt2 [2018-06-22 11:59:46,365 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:59:46,372 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:59:46,372 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:59:46,372 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:59:46,372 INFO ]: ChcToBoogie initialized [2018-06-22 11:59:46,375 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:59:46" (1/1) ... [2018-06-22 11:59:46,423 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:46 Unit [2018-06-22 11:59:46,423 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:59:46,424 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:59:46,424 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:59:46,424 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:59:46,447 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:46" (1/1) ... [2018-06-22 11:59:46,447 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:46" (1/1) ... [2018-06-22 11:59:46,456 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:46" (1/1) ... [2018-06-22 11:59:46,457 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:46" (1/1) ... [2018-06-22 11:59:46,461 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:46" (1/1) ... [2018-06-22 11:59:46,469 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:46" (1/1) ... [2018-06-22 11:59:46,470 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:46" (1/1) ... [2018-06-22 11:59:46,476 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:59:46,477 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:59:46,477 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:59:46,477 INFO ]: RCFGBuilder initialized [2018-06-22 11:59:46,478 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:46" (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-22 11:59:46,492 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:59:46,492 INFO ]: Found specification of procedure False [2018-06-22 11:59:46,492 INFO ]: Found implementation of procedure False [2018-06-22 11:59:46,492 INFO ]: Specification and implementation of procedure INV_MAIN_23 given in one single declaration [2018-06-22 11:59:46,492 INFO ]: Found specification of procedure INV_MAIN_23 [2018-06-22 11:59:46,493 INFO ]: Found implementation of procedure INV_MAIN_23 [2018-06-22 11:59:46,493 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:59:46,493 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:59:46,493 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:59:46,493 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:59:46,493 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:59:46,493 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-22 11:59:47,037 INFO ]: Using library mode [2018-06-22 11:59:47,041 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:59:47 BoogieIcfgContainer [2018-06-22 11:59:47,041 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:59:47,042 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:59:47,042 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:59:47,045 INFO ]: TraceAbstraction initialized [2018-06-22 11:59:47,045 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:59:46" (1/3) ... [2018-06-22 11:59:47,046 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe039f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:59:47, skipping insertion in model container [2018-06-22 11:59:47,046 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:46" (2/3) ... [2018-06-22 11:59:47,046 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe039f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:59:47, skipping insertion in model container [2018-06-22 11:59:47,046 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:59:47" (3/3) ... [2018-06-22 11:59:47,050 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:59:47,059 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:59:47,069 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:59:47,121 INFO ]: Using default assertion order modulation [2018-06-22 11:59:47,122 INFO ]: Interprodecural is true [2018-06-22 11:59:47,122 INFO ]: Hoare is false [2018-06-22 11:59:47,122 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:59:47,122 INFO ]: Backedges is TWOTRACK [2018-06-22 11:59:47,122 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:59:47,122 INFO ]: Difference is false [2018-06-22 11:59:47,122 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:59:47,122 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:59:47,142 INFO ]: Start isEmpty. Operand 28 states. [2018-06-22 11:59:47,163 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:59:47,163 INFO ]: Found error trace [2018-06-22 11:59:47,163 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:59:47,163 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:47,167 INFO ]: Analyzing trace with hash 117414136, now seen corresponding path program 1 times [2018-06-22 11:59:47,169 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:47,169 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:47,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:47,200 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:47,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:47,213 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:47,238 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:59:47,240 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:47,240 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:59:47,242 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:59:47,257 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:59:47,259 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:59:47,261 INFO ]: Start difference. First operand 28 states. Second operand 2 states. [2018-06-22 11:59:47,285 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:47,285 INFO ]: Finished difference Result 26 states and 49 transitions. [2018-06-22 11:59:47,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:59:47,286 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:59:47,286 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:47,299 INFO ]: With dead ends: 26 [2018-06-22 11:59:47,299 INFO ]: Without dead ends: 26 [2018-06-22 11:59:47,303 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:59:47,320 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:59:47,347 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 11:59:47,349 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:59:47,351 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 49 transitions. [2018-06-22 11:59:47,352 INFO ]: Start accepts. Automaton has 26 states and 49 transitions. Word has length 5 [2018-06-22 11:59:47,353 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:47,353 INFO ]: Abstraction has 26 states and 49 transitions. [2018-06-22 11:59:47,353 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:59:47,353 INFO ]: Start isEmpty. Operand 26 states and 49 transitions. [2018-06-22 11:59:47,356 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:59:47,356 INFO ]: Found error trace [2018-06-22 11:59:47,356 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:47,357 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:47,357 INFO ]: Analyzing trace with hash 1625135896, now seen corresponding path program 1 times [2018-06-22 11:59:47,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:47,357 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:47,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:47,358 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:47,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:47,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:47,540 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:59:47,541 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:47,541 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:47,542 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:47,542 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:47,542 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:47,542 INFO ]: Start difference. First operand 26 states and 49 transitions. Second operand 4 states. [2018-06-22 11:59:47,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:47,694 INFO ]: Finished difference Result 30 states and 58 transitions. [2018-06-22 11:59:47,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:47,695 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:59:47,695 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:47,696 INFO ]: With dead ends: 30 [2018-06-22 11:59:47,696 INFO ]: Without dead ends: 30 [2018-06-22 11:59:47,697 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:47,697 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:59:47,712 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-22 11:59:47,712 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:59:47,713 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 56 transitions. [2018-06-22 11:59:47,713 INFO ]: Start accepts. Automaton has 28 states and 56 transitions. Word has length 9 [2018-06-22 11:59:47,713 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:47,713 INFO ]: Abstraction has 28 states and 56 transitions. [2018-06-22 11:59:47,713 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:47,714 INFO ]: Start isEmpty. Operand 28 states and 56 transitions. [2018-06-22 11:59:47,718 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:59:47,718 INFO ]: Found error trace [2018-06-22 11:59:47,718 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:47,718 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:47,718 INFO ]: Analyzing trace with hash -770647373, now seen corresponding path program 1 times [2018-06-22 11:59:47,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:47,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:47,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:47,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:47,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:47,730 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:47,756 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:59:47,756 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:47,756 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:47,756 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:47,756 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:47,756 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:47,757 INFO ]: Start difference. First operand 28 states and 56 transitions. Second operand 4 states. [2018-06-22 11:59:47,894 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:47,894 INFO ]: Finished difference Result 30 states and 56 transitions. [2018-06-22 11:59:47,895 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:47,896 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:59:47,896 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:47,897 INFO ]: With dead ends: 30 [2018-06-22 11:59:47,897 INFO ]: Without dead ends: 29 [2018-06-22 11:59:47,897 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:47,897 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:59:47,907 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:59:47,907 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:59:47,908 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 52 transitions. [2018-06-22 11:59:47,908 INFO ]: Start accepts. Automaton has 27 states and 52 transitions. Word has length 9 [2018-06-22 11:59:47,908 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:47,908 INFO ]: Abstraction has 27 states and 52 transitions. [2018-06-22 11:59:47,908 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:47,908 INFO ]: Start isEmpty. Operand 27 states and 52 transitions. [2018-06-22 11:59:47,913 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:59:47,913 INFO ]: Found error trace [2018-06-22 11:59:47,913 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:47,913 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:47,913 INFO ]: Analyzing trace with hash 2121735138, now seen corresponding path program 1 times [2018-06-22 11:59:47,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:47,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:47,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:47,914 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:47,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:47,924 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:47,985 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:59:47,985 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:47,985 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:47,985 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:47,985 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:47,985 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:47,985 INFO ]: Start difference. First operand 27 states and 52 transitions. Second operand 4 states. [2018-06-22 11:59:48,111 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:48,111 INFO ]: Finished difference Result 29 states and 52 transitions. [2018-06-22 11:59:48,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:48,114 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:59:48,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:48,115 INFO ]: With dead ends: 29 [2018-06-22 11:59:48,115 INFO ]: Without dead ends: 28 [2018-06-22 11:59:48,116 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:48,116 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:59:48,124 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-06-22 11:59:48,124 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:59:48,125 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 48 transitions. [2018-06-22 11:59:48,130 INFO ]: Start accepts. Automaton has 26 states and 48 transitions. Word has length 9 [2018-06-22 11:59:48,131 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:48,131 INFO ]: Abstraction has 26 states and 48 transitions. [2018-06-22 11:59:48,131 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:48,131 INFO ]: Start isEmpty. Operand 26 states and 48 transitions. [2018-06-22 11:59:48,132 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:48,132 INFO ]: Found error trace [2018-06-22 11:59:48,132 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:48,132 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:48,132 INFO ]: Analyzing trace with hash -814687459, now seen corresponding path program 1 times [2018-06-22 11:59:48,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:48,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:48,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:48,133 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:48,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:48,156 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:48,273 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:59:48,273 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:48,273 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-22 11:59:48,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:48,320 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:48,328 INFO ]: Computing forward predicates... [2018-06-22 11:59:48,873 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:59:48,908 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:48,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:59:48,908 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:59:48,908 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:59:48,908 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:59:48,908 INFO ]: Start difference. First operand 26 states and 48 transitions. Second operand 8 states. [2018-06-22 11:59:49,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:49,494 INFO ]: Finished difference Result 36 states and 72 transitions. [2018-06-22 11:59:49,495 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:59:49,495 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:59:49,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:49,496 INFO ]: With dead ends: 36 [2018-06-22 11:59:49,496 INFO ]: Without dead ends: 36 [2018-06-22 11:59:49,497 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:59:49,497 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:59:49,506 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-22 11:59:49,506 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:59:49,507 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2018-06-22 11:59:49,507 INFO ]: Start accepts. Automaton has 28 states and 54 transitions. Word has length 13 [2018-06-22 11:59:49,507 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:49,507 INFO ]: Abstraction has 28 states and 54 transitions. [2018-06-22 11:59:49,507 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:59:49,507 INFO ]: Start isEmpty. Operand 28 states and 54 transitions. [2018-06-22 11:59:49,509 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:49,509 INFO ]: Found error trace [2018-06-22 11:59:49,509 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:49,509 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:49,509 INFO ]: Analyzing trace with hash -666911302, now seen corresponding path program 1 times [2018-06-22 11:59:49,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:49,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:49,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:49,510 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:49,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:49,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:49,809 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:59:49,809 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:49,809 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:59:49,809 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:59:49,809 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:59:49,809 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:49,810 INFO ]: Start difference. First operand 28 states and 54 transitions. Second operand 5 states. [2018-06-22 11:59:49,940 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:49,940 INFO ]: Finished difference Result 36 states and 72 transitions. [2018-06-22 11:59:49,940 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:59:49,940 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:59:49,940 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:49,941 INFO ]: With dead ends: 36 [2018-06-22 11:59:49,941 INFO ]: Without dead ends: 36 [2018-06-22 11:59:49,942 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:59:49,942 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:59:49,949 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-06-22 11:59:49,949 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:59:49,950 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 64 transitions. [2018-06-22 11:59:49,951 INFO ]: Start accepts. Automaton has 32 states and 64 transitions. Word has length 13 [2018-06-22 11:59:49,951 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:49,951 INFO ]: Abstraction has 32 states and 64 transitions. [2018-06-22 11:59:49,951 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:59:49,951 INFO ]: Start isEmpty. Operand 32 states and 64 transitions. [2018-06-22 11:59:49,952 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:49,952 INFO ]: Found error trace [2018-06-22 11:59:49,952 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:49,952 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:49,952 INFO ]: Analyzing trace with hash -569436606, now seen corresponding path program 1 times [2018-06-22 11:59:49,952 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:49,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:49,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:49,953 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:49,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:49,961 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:49,999 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:59:49,999 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:49,999 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:59:50,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:50,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:50,040 INFO ]: Computing forward predicates... [2018-06-22 11:59:50,089 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:59:50,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:50,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:59:50,108 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:59:50,108 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:59:50,109 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:59:50,109 INFO ]: Start difference. First operand 32 states and 64 transitions. Second operand 8 states. [2018-06-22 11:59:50,337 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:50,337 INFO ]: Finished difference Result 40 states and 82 transitions. [2018-06-22 11:59:50,337 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:59:50,337 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:59:50,338 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:50,339 INFO ]: With dead ends: 40 [2018-06-22 11:59:50,339 INFO ]: Without dead ends: 40 [2018-06-22 11:59:50,339 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:59:50,339 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:59:50,347 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-06-22 11:59:50,347 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:59:50,348 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2018-06-22 11:59:50,348 INFO ]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 13 [2018-06-22 11:59:50,348 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:50,348 INFO ]: Abstraction has 34 states and 70 transitions. [2018-06-22 11:59:50,348 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:59:50,348 INFO ]: Start isEmpty. Operand 34 states and 70 transitions. [2018-06-22 11:59:50,349 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:50,349 INFO ]: Found error trace [2018-06-22 11:59:50,349 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:50,349 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:50,349 INFO ]: Analyzing trace with hash -523865559, now seen corresponding path program 1 times [2018-06-22 11:59:50,349 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:50,349 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:50,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:50,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:50,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:50,363 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:50,403 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:59:50,403 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:50,403 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:50,403 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:50,403 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:50,403 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:50,404 INFO ]: Start difference. First operand 34 states and 70 transitions. Second operand 4 states. [2018-06-22 11:59:50,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:50,494 INFO ]: Finished difference Result 32 states and 56 transitions. [2018-06-22 11:59:50,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:50,494 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:59:50,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:50,495 INFO ]: With dead ends: 32 [2018-06-22 11:59:50,495 INFO ]: Without dead ends: 23 [2018-06-22 11:59:50,495 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:50,496 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:59:50,501 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 11:59:50,501 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:59:50,501 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2018-06-22 11:59:50,501 INFO ]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 13 [2018-06-22 11:59:50,501 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:50,501 INFO ]: Abstraction has 23 states and 40 transitions. [2018-06-22 11:59:50,501 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:50,501 INFO ]: Start isEmpty. Operand 23 states and 40 transitions. [2018-06-22 11:59:50,502 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:50,502 INFO ]: Found error trace [2018-06-22 11:59:50,502 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:50,502 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:50,503 INFO ]: Analyzing trace with hash -1494168705, now seen corresponding path program 1 times [2018-06-22 11:59:50,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:50,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:50,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:50,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:50,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:50,515 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:50,588 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:59:50,588 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:50,588 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:59:50,597 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:50,614 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:50,616 INFO ]: Computing forward predicates... [2018-06-22 11:59:50,912 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:59:50,945 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:50,945 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:59:50,945 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:59:50,945 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:59:50,945 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:59:50,945 INFO ]: Start difference. First operand 23 states and 40 transitions. Second operand 13 states. [2018-06-22 11:59:51,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:51,398 INFO ]: Finished difference Result 37 states and 67 transitions. [2018-06-22 11:59:51,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:59:51,398 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:59:51,398 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:51,399 INFO ]: With dead ends: 37 [2018-06-22 11:59:51,399 INFO ]: Without dead ends: 37 [2018-06-22 11:59:51,400 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:59:51,400 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:59:51,407 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-06-22 11:59:51,407 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:59:51,407 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2018-06-22 11:59:51,407 INFO ]: Start accepts. Automaton has 19 states and 30 transitions. Word has length 17 [2018-06-22 11:59:51,407 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:51,407 INFO ]: Abstraction has 19 states and 30 transitions. [2018-06-22 11:59:51,407 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:59:51,408 INFO ]: Start isEmpty. Operand 19 states and 30 transitions. [2018-06-22 11:59:51,409 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:51,409 INFO ]: Found error trace [2018-06-22 11:59:51,409 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:51,409 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:51,409 INFO ]: Analyzing trace with hash -406605468, now seen corresponding path program 1 times [2018-06-22 11:59:51,409 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:51,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:51,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:51,410 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:51,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:51,421 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:51,469 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:59:51,469 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:51,469 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:59:51,475 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:51,488 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:51,490 INFO ]: Computing forward predicates... [2018-06-22 11:59:51,681 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:59:51,699 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:51,700 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:59:51,700 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:59:51,700 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:59:51,700 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:59:51,700 INFO ]: Start difference. First operand 19 states and 30 transitions. Second operand 11 states. [2018-06-22 11:59:51,858 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:51,858 INFO ]: Finished difference Result 29 states and 51 transitions. [2018-06-22 11:59:51,858 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:59:51,858 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:59:51,858 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:51,859 INFO ]: With dead ends: 29 [2018-06-22 11:59:51,859 INFO ]: Without dead ends: 29 [2018-06-22 11:59:51,859 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:59:51,859 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:59:51,863 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 17. [2018-06-22 11:59:51,863 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:59:51,863 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2018-06-22 11:59:51,863 INFO ]: Start accepts. Automaton has 17 states and 26 transitions. Word has length 17 [2018-06-22 11:59:51,863 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:51,863 INFO ]: Abstraction has 17 states and 26 transitions. [2018-06-22 11:59:51,863 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:59:51,863 INFO ]: Start isEmpty. Operand 17 states and 26 transitions. [2018-06-22 11:59:51,864 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:51,864 INFO ]: Found error trace [2018-06-22 11:59:51,864 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:51,864 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:51,864 INFO ]: Analyzing trace with hash -2031300252, now seen corresponding path program 2 times [2018-06-22 11:59:51,864 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:51,864 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:51,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:51,865 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:51,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:51,874 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:51,971 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:59:51,971 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:51,971 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:59:51,982 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:59:51,996 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:59:51,996 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:51,998 INFO ]: Computing forward predicates... [2018-06-22 11:59:52,100 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:59:52,119 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:52,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:59:52,120 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:59:52,120 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:59:52,120 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:59:52,120 INFO ]: Start difference. First operand 17 states and 26 transitions. Second operand 13 states. [2018-06-22 11:59:52,421 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:52,421 INFO ]: Finished difference Result 27 states and 50 transitions. [2018-06-22 11:59:52,421 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:59:52,421 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:59:52,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:52,421 INFO ]: With dead ends: 27 [2018-06-22 11:59:52,421 INFO ]: Without dead ends: 0 [2018-06-22 11:59:52,422 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:59:52,422 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:59:52,422 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:59:52,422 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:59:52,422 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:59:52,422 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-22 11:59:52,422 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:52,422 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:59:52,422 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:59:52,422 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:59:52,422 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:59:52,426 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:59:52 BoogieIcfgContainer [2018-06-22 11:59:52,426 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:59:52,427 INFO ]: Toolchain (without parser) took 6061.31 ms. Allocated memory was 309.9 MB in the beginning and 362.3 MB in the end (delta: 52.4 MB). Free memory was 263.2 MB in the beginning and 305.1 MB in the end (delta: -41.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:52,429 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:59:52,429 INFO ]: ChcToBoogie took 51.55 ms. Allocated memory is still 309.9 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:52,429 INFO ]: Boogie Preprocessor took 52.35 ms. Allocated memory is still 309.9 MB. Free memory was 261.2 MB in the beginning and 260.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:52,430 INFO ]: RCFGBuilder took 563.89 ms. Allocated memory is still 309.9 MB. Free memory was 260.2 MB in the beginning and 247.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:52,430 INFO ]: TraceAbstraction took 5384.50 ms. Allocated memory was 309.9 MB in the beginning and 362.3 MB in the end (delta: 52.4 MB). Free memory was 247.0 MB in the beginning and 305.1 MB in the end (delta: -58.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:59:52,433 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 51.55 ms. Allocated memory is still 309.9 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 52.35 ms. Allocated memory is still 309.9 MB. Free memory was 261.2 MB in the beginning and 260.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 563.89 ms. Allocated memory is still 309.9 MB. Free memory was 260.2 MB in the beginning and 247.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5384.50 ms. Allocated memory was 309.9 MB in the beginning and 362.3 MB in the end (delta: 52.4 MB). Free memory was 247.0 MB in the beginning and 305.1 MB in the end (delta: -58.1 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 4 procedures, 28 locations, 1 error locations. SAFE Result, 5.3s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 375 SDtfs, 30 SDslu, 813 SDs, 0 SdLazy, 877 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=7, 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, 11 MinimizatonAttempts, 54 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 11040 SizeOfPredicates, 28 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 35/69 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/loop__nested-while.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-59-52-443.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__nested-while.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-59-52-443.csv Received shutdown request...