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__loop_unswitching.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:59:41,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:59:41,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:59:41,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:59:41,045 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:59:41,046 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:59:41,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:59:41,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:59:41,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:59:41,055 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:59:41,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:59:41,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:59:41,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:59:41,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:59:41,061 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:59:41,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:59:41,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:59:41,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:59:41,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:59:41,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:59:41,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:59:41,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:59:41,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:59:41,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:59:41,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:59:41,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:59:41,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:59:41,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:59:41,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:59:41,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:59:41,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:59:41,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:59:41,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:59:41,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:59:41,081 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:59:41,081 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:41,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:59:41,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:59:41,104 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:59:41,104 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:59:41,105 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:59:41,105 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:59:41,105 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:59:41,105 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:59:41,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:59:41,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:59:41,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:59:41,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:59:41,106 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:59:41,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:59:41,111 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:59:41,111 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:59:41,112 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:59:41,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:59:41,112 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:59:41,114 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:59:41,114 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:59:41,168 INFO ]: Repository-Root is: /tmp [2018-06-22 11:59:41,181 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:59:41,185 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:59:41,186 INFO ]: Initializing SmtParser... [2018-06-22 11:59:41,187 INFO ]: SmtParser initialized [2018-06-22 11:59:41,188 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__loop_unswitching.smt2 [2018-06-22 11:59:41,189 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:41,288 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__loop_unswitching.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@741e30b6 [2018-06-22 11:59:41,481 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__loop_unswitching.smt2 [2018-06-22 11:59:41,485 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:59:41,492 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:59:41,493 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:59:41,493 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:59:41,493 INFO ]: ChcToBoogie initialized [2018-06-22 11:59:41,496 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,542 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41 Unit [2018-06-22 11:59:41,542 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:59:41,543 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:59:41,543 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:59:41,543 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:59:41,565 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,565 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,574 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,574 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,578 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,580 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,581 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,583 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:59:41,583 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:59:41,583 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:59:41,583 INFO ]: RCFGBuilder initialized [2018-06-22 11:59:41,592 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (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:41,605 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:59:41,605 INFO ]: Found specification of procedure False [2018-06-22 11:59:41,605 INFO ]: Found implementation of procedure False [2018-06-22 11:59:41,605 INFO ]: Specification and implementation of procedure INV_MAIN_23 given in one single declaration [2018-06-22 11:59:41,605 INFO ]: Found specification of procedure INV_MAIN_23 [2018-06-22 11:59:41,605 INFO ]: Found implementation of procedure INV_MAIN_23 [2018-06-22 11:59:41,605 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:59:41,605 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:59:41,605 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:59:41,605 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:59:41,605 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:59:41,605 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:41,924 INFO ]: Using library mode [2018-06-22 11:59:41,925 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:59:41 BoogieIcfgContainer [2018-06-22 11:59:41,925 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:59:41,932 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:59:41,932 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:59:41,935 INFO ]: TraceAbstraction initialized [2018-06-22 11:59:41,935 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:59:41" (1/3) ... [2018-06-22 11:59:41,937 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c93364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:59:41, skipping insertion in model container [2018-06-22 11:59:41,938 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (2/3) ... [2018-06-22 11:59:41,938 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c93364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:59:41, skipping insertion in model container [2018-06-22 11:59:41,938 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:59:41" (3/3) ... [2018-06-22 11:59:41,940 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:59:41,949 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:59:41,962 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:59:42,002 INFO ]: Using default assertion order modulation [2018-06-22 11:59:42,002 INFO ]: Interprodecural is true [2018-06-22 11:59:42,002 INFO ]: Hoare is false [2018-06-22 11:59:42,002 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:59:42,002 INFO ]: Backedges is TWOTRACK [2018-06-22 11:59:42,002 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:59:42,002 INFO ]: Difference is false [2018-06-22 11:59:42,002 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:59:42,002 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:59:42,018 INFO ]: Start isEmpty. Operand 22 states. [2018-06-22 11:59:42,038 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:59:42,038 INFO ]: Found error trace [2018-06-22 11:59:42,039 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:42,039 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:42,044 INFO ]: Analyzing trace with hash 1845479064, now seen corresponding path program 1 times [2018-06-22 11:59:42,046 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:42,046 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:42,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,090 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:42,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,124 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:42,210 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:42,211 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:42,211 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:42,213 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:42,223 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:42,224 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:42,225 INFO ]: Start difference. First operand 22 states. Second operand 4 states. [2018-06-22 11:59:42,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:42,333 INFO ]: Finished difference Result 22 states and 36 transitions. [2018-06-22 11:59:42,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:42,334 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:59:42,334 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:42,345 INFO ]: With dead ends: 22 [2018-06-22 11:59:42,345 INFO ]: Without dead ends: 22 [2018-06-22 11:59:42,346 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:42,359 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:59:42,393 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 11:59:42,396 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:59:42,397 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2018-06-22 11:59:42,398 INFO ]: Start accepts. Automaton has 22 states and 36 transitions. Word has length 9 [2018-06-22 11:59:42,399 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:42,399 INFO ]: Abstraction has 22 states and 36 transitions. [2018-06-22 11:59:42,400 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:42,400 INFO ]: Start isEmpty. Operand 22 states and 36 transitions. [2018-06-22 11:59:42,403 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:59:42,403 INFO ]: Found error trace [2018-06-22 11:59:42,403 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:42,403 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:42,403 INFO ]: Analyzing trace with hash 946142045, now seen corresponding path program 1 times [2018-06-22 11:59:42,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:42,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:42,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:42,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,412 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:42,472 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:42,472 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:42,472 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:42,474 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:42,474 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:42,474 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:42,474 INFO ]: Start difference. First operand 22 states and 36 transitions. Second operand 4 states. [2018-06-22 11:59:42,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:42,601 INFO ]: Finished difference Result 24 states and 40 transitions. [2018-06-22 11:59:42,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:42,602 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:59:42,602 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:42,603 INFO ]: With dead ends: 24 [2018-06-22 11:59:42,603 INFO ]: Without dead ends: 24 [2018-06-22 11:59:42,604 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:42,604 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:59:42,611 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 11:59:42,611 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:59:42,612 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 40 transitions. [2018-06-22 11:59:42,612 INFO ]: Start accepts. Automaton has 24 states and 40 transitions. Word has length 9 [2018-06-22 11:59:42,612 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:42,612 INFO ]: Abstraction has 24 states and 40 transitions. [2018-06-22 11:59:42,612 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:42,613 INFO ]: Start isEmpty. Operand 24 states and 40 transitions. [2018-06-22 11:59:42,617 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:42,617 INFO ]: Found error trace [2018-06-22 11:59:42,617 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:42,617 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:42,618 INFO ]: Analyzing trace with hash 958128806, now seen corresponding path program 1 times [2018-06-22 11:59:42,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:42,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:42,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:42,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:43,054 WARN ]: Spent 247.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 12 [2018-06-22 11:59:43,126 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:43,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:43,126 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:43,134 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:43,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:43,170 INFO ]: Computing forward predicates... [2018-06-22 11:59:43,393 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:43,414 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:43,414 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:59:43,415 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:59:43,415 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:59:43,415 INFO ]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:59:43,415 INFO ]: Start difference. First operand 24 states and 40 transitions. Second operand 9 states. [2018-06-22 11:59:43,901 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:43,901 INFO ]: Finished difference Result 30 states and 53 transitions. [2018-06-22 11:59:43,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:59:43,903 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:59:43,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:43,904 INFO ]: With dead ends: 30 [2018-06-22 11:59:43,904 INFO ]: Without dead ends: 30 [2018-06-22 11:59:43,904 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:59:43,904 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:59:43,915 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-06-22 11:59:43,915 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:59:43,916 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 40 transitions. [2018-06-22 11:59:43,916 INFO ]: Start accepts. Automaton has 24 states and 40 transitions. Word has length 13 [2018-06-22 11:59:43,916 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:43,916 INFO ]: Abstraction has 24 states and 40 transitions. [2018-06-22 11:59:43,916 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:59:43,916 INFO ]: Start isEmpty. Operand 24 states and 40 transitions. [2018-06-22 11:59:43,917 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:43,917 INFO ]: Found error trace [2018-06-22 11:59:43,917 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:43,917 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:43,918 INFO ]: Analyzing trace with hash 712877953, now seen corresponding path program 1 times [2018-06-22 11:59:43,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:43,918 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:43,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:43,920 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:43,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:43,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:44,068 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:59:44,068 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:44,068 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:44,068 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:44,068 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:44,068 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:44,068 INFO ]: Start difference. First operand 24 states and 40 transitions. Second operand 4 states. [2018-06-22 11:59:44,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:44,424 INFO ]: Finished difference Result 35 states and 65 transitions. [2018-06-22 11:59:44,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:59:44,425 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:59:44,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:44,427 INFO ]: With dead ends: 35 [2018-06-22 11:59:44,427 INFO ]: Without dead ends: 35 [2018-06-22 11:59:44,427 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:44,427 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:59:44,436 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:59:44,436 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:59:44,438 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 59 transitions. [2018-06-22 11:59:44,438 INFO ]: Start accepts. Automaton has 33 states and 59 transitions. Word has length 13 [2018-06-22 11:59:44,438 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:44,438 INFO ]: Abstraction has 33 states and 59 transitions. [2018-06-22 11:59:44,438 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:44,438 INFO ]: Start isEmpty. Operand 33 states and 59 transitions. [2018-06-22 11:59:44,440 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:44,440 INFO ]: Found error trace [2018-06-22 11:59:44,440 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:44,440 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:44,440 INFO ]: Analyzing trace with hash 467627100, now seen corresponding path program 1 times [2018-06-22 11:59:44,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:44,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:44,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:44,441 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:44,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:44,447 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:44,476 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:59:44,476 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:44,476 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:44,476 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:44,476 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:44,476 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:44,477 INFO ]: Start difference. First operand 33 states and 59 transitions. Second operand 4 states. [2018-06-22 11:59:44,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:44,608 INFO ]: Finished difference Result 46 states and 83 transitions. [2018-06-22 11:59:44,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:59:44,609 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:59:44,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:44,610 INFO ]: With dead ends: 46 [2018-06-22 11:59:44,610 INFO ]: Without dead ends: 42 [2018-06-22 11:59:44,611 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 11:59:44,611 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:59:44,619 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-06-22 11:59:44,619 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:59:44,620 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 64 transitions. [2018-06-22 11:59:44,620 INFO ]: Start accepts. Automaton has 36 states and 64 transitions. Word has length 13 [2018-06-22 11:59:44,620 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:44,620 INFO ]: Abstraction has 36 states and 64 transitions. [2018-06-22 11:59:44,620 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:44,620 INFO ]: Start isEmpty. Operand 36 states and 64 transitions. [2018-06-22 11:59:44,621 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:44,621 INFO ]: Found error trace [2018-06-22 11:59:44,622 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:44,622 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:44,622 INFO ]: Analyzing trace with hash -715113269, now seen corresponding path program 1 times [2018-06-22 11:59:44,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:44,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:44,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:44,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:44,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:44,631 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:44,962 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:44,962 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:44,962 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:44,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:44,979 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:44,981 INFO ]: Computing forward predicates... [2018-06-22 11:59:45,033 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:45,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:45,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:59:45,053 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:59:45,053 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:59:45,053 INFO ]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:59:45,053 INFO ]: Start difference. First operand 36 states and 64 transitions. Second operand 9 states. [2018-06-22 11:59:45,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:45,291 INFO ]: Finished difference Result 42 states and 77 transitions. [2018-06-22 11:59:45,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:59:45,291 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:59:45,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:45,293 INFO ]: With dead ends: 42 [2018-06-22 11:59:45,293 INFO ]: Without dead ends: 42 [2018-06-22 11:59:45,293 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:59:45,293 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:59:45,302 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-06-22 11:59:45,302 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:59:45,303 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 64 transitions. [2018-06-22 11:59:45,303 INFO ]: Start accepts. Automaton has 36 states and 64 transitions. Word has length 13 [2018-06-22 11:59:45,303 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:45,303 INFO ]: Abstraction has 36 states and 64 transitions. [2018-06-22 11:59:45,303 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:59:45,303 INFO ]: Start isEmpty. Operand 36 states and 64 transitions. [2018-06-22 11:59:45,304 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:45,304 INFO ]: Found error trace [2018-06-22 11:59:45,304 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:45,304 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:45,304 INFO ]: Analyzing trace with hash -1746418142, now seen corresponding path program 1 times [2018-06-22 11:59:45,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:45,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:45,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:45,305 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:45,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:45,312 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:45,384 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:59:45,385 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:45,385 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:45,385 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:45,385 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:45,385 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:45,385 INFO ]: Start difference. First operand 36 states and 64 transitions. Second operand 4 states. [2018-06-22 11:59:45,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:45,448 INFO ]: Finished difference Result 42 states and 76 transitions. [2018-06-22 11:59:45,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:45,448 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:59:45,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:45,450 INFO ]: With dead ends: 42 [2018-06-22 11:59:45,450 INFO ]: Without dead ends: 42 [2018-06-22 11:59:45,450 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:45,450 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:59:45,461 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-06-22 11:59:45,461 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:59:45,464 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 71 transitions. [2018-06-22 11:59:45,464 INFO ]: Start accepts. Automaton has 40 states and 71 transitions. Word has length 13 [2018-06-22 11:59:45,465 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:45,465 INFO ]: Abstraction has 40 states and 71 transitions. [2018-06-22 11:59:45,465 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:45,465 INFO ]: Start isEmpty. Operand 40 states and 71 transitions. [2018-06-22 11:59:45,466 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:45,466 INFO ]: Found error trace [2018-06-22 11:59:45,466 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:45,466 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:45,466 INFO ]: Analyzing trace with hash -1598641985, now seen corresponding path program 1 times [2018-06-22 11:59:45,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:45,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:45,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:45,467 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:45,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:45,480 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:45,500 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:59:45,500 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:45,500 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:45,500 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:45,500 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:45,500 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:45,500 INFO ]: Start difference. First operand 40 states and 71 transitions. Second operand 4 states. [2018-06-22 11:59:45,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:45,534 INFO ]: Finished difference Result 42 states and 74 transitions. [2018-06-22 11:59:45,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:45,535 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:59:45,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:45,535 INFO ]: With dead ends: 42 [2018-06-22 11:59:45,536 INFO ]: Without dead ends: 42 [2018-06-22 11:59:45,536 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:45,536 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:59:45,543 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:59:45,543 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:59:45,544 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 74 transitions. [2018-06-22 11:59:45,544 INFO ]: Start accepts. Automaton has 42 states and 74 transitions. Word has length 13 [2018-06-22 11:59:45,544 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:45,544 INFO ]: Abstraction has 42 states and 74 transitions. [2018-06-22 11:59:45,544 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:45,545 INFO ]: Start isEmpty. Operand 42 states and 74 transitions. [2018-06-22 11:59:45,546 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:45,546 INFO ]: Found error trace [2018-06-22 11:59:45,546 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:45,546 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:45,546 INFO ]: Analyzing trace with hash 1701900688, now seen corresponding path program 1 times [2018-06-22 11:59:45,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:45,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:45,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:45,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:45,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:45,555 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:45,595 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:59:45,595 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:45,595 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:59:45,595 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:59:45,595 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:59:45,595 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:45,595 INFO ]: Start difference. First operand 42 states and 74 transitions. Second operand 5 states. [2018-06-22 11:59:45,690 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:45,690 INFO ]: Finished difference Result 40 states and 68 transitions. [2018-06-22 11:59:45,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:59:45,690 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:59:45,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:45,691 INFO ]: With dead ends: 40 [2018-06-22 11:59:45,691 INFO ]: Without dead ends: 39 [2018-06-22 11:59:45,691 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:59:45,691 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:59:45,704 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-06-22 11:59:45,704 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:59:45,704 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 62 transitions. [2018-06-22 11:59:45,704 INFO ]: Start accepts. Automaton has 37 states and 62 transitions. Word has length 17 [2018-06-22 11:59:45,704 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:45,705 INFO ]: Abstraction has 37 states and 62 transitions. [2018-06-22 11:59:45,705 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:59:45,705 INFO ]: Start isEmpty. Operand 37 states and 62 transitions. [2018-06-22 11:59:45,707 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:45,707 INFO ]: Found error trace [2018-06-22 11:59:45,707 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:45,707 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:45,707 INFO ]: Analyzing trace with hash -344322899, now seen corresponding path program 1 times [2018-06-22 11:59:45,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:45,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:45,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:45,708 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:45,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:45,720 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:45,775 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:59:45,775 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:45,775 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:59:45,775 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:59:45,775 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:59:45,775 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:45,775 INFO ]: Start difference. First operand 37 states and 62 transitions. Second operand 5 states. [2018-06-22 11:59:45,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:45,804 INFO ]: Finished difference Result 35 states and 57 transitions. [2018-06-22 11:59:45,804 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:59:45,804 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:59:45,804 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:45,804 INFO ]: With dead ends: 35 [2018-06-22 11:59:45,804 INFO ]: Without dead ends: 27 [2018-06-22 11:59:45,805 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:59:45,805 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:59:45,809 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 11:59:45,809 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:59:45,814 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2018-06-22 11:59:45,814 INFO ]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 17 [2018-06-22 11:59:45,814 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:45,814 INFO ]: Abstraction has 27 states and 46 transitions. [2018-06-22 11:59:45,814 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:59:45,814 INFO ]: Start isEmpty. Operand 27 states and 46 transitions. [2018-06-22 11:59:45,815 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:45,815 INFO ]: Found error trace [2018-06-22 11:59:45,815 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:45,815 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:45,815 INFO ]: Analyzing trace with hash -791645681, now seen corresponding path program 1 times [2018-06-22 11:59:45,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:45,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:45,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:45,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:45,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:45,828 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:46,063 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:59:46,063 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:46,063 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:59:46,063 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:59:46,063 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:59:46,064 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:46,064 INFO ]: Start difference. First operand 27 states and 46 transitions. Second operand 5 states. [2018-06-22 11:59:46,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:46,164 INFO ]: Finished difference Result 27 states and 43 transitions. [2018-06-22 11:59:46,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:59:46,164 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:59:46,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:46,165 INFO ]: With dead ends: 27 [2018-06-22 11:59:46,165 INFO ]: Without dead ends: 22 [2018-06-22 11:59:46,165 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:59:46,165 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:59:46,168 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-22 11:59:46,168 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:59:46,169 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-06-22 11:59:46,169 INFO ]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 17 [2018-06-22 11:59:46,169 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:46,169 INFO ]: Abstraction has 20 states and 29 transitions. [2018-06-22 11:59:46,169 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:59:46,169 INFO ]: Start isEmpty. Operand 20 states and 29 transitions. [2018-06-22 11:59:46,169 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:46,169 INFO ]: Found error trace [2018-06-22 11:59:46,169 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:46,169 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:46,170 INFO ]: Analyzing trace with hash 445980778, now seen corresponding path program 1 times [2018-06-22 11:59:46,170 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:46,170 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:46,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:46,170 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:46,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:46,177 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:46,209 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:59:46,209 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:46,209 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:59:46,209 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:59:46,209 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:59:46,209 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:46,209 INFO ]: Start difference. First operand 20 states and 29 transitions. Second operand 5 states. [2018-06-22 11:59:46,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:46,391 INFO ]: Finished difference Result 14 states and 19 transitions. [2018-06-22 11:59:46,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:59:46,391 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:59:46,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:46,391 INFO ]: With dead ends: 14 [2018-06-22 11:59:46,391 INFO ]: Without dead ends: 0 [2018-06-22 11:59:46,391 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:59:46,391 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:59:46,391 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:59:46,391 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:59:46,391 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:59:46,391 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-22 11:59:46,391 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:46,392 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:59:46,392 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:59:46,392 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:59:46,392 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:59:46,396 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:59:46 BoogieIcfgContainer [2018-06-22 11:59:46,396 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:59:46,396 INFO ]: Toolchain (without parser) took 4910.85 ms. Allocated memory was 306.2 MB in the beginning and 337.6 MB in the end (delta: 31.5 MB). Free memory was 261.6 MB in the beginning and 298.7 MB in the end (delta: -37.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:59:46,398 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:59:46,398 INFO ]: ChcToBoogie took 49.39 ms. Allocated memory is still 306.2 MB. Free memory was 261.6 MB in the beginning and 259.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:46,399 INFO ]: Boogie Preprocessor took 39.89 ms. Allocated memory is still 306.2 MB. Free memory was 259.5 MB in the beginning and 258.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:59:46,399 INFO ]: RCFGBuilder took 341.96 ms. Allocated memory is still 306.2 MB. Free memory was 258.5 MB in the beginning and 248.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:46,400 INFO ]: TraceAbstraction took 4464.26 ms. Allocated memory was 306.2 MB in the beginning and 337.6 MB in the end (delta: 31.5 MB). Free memory was 248.5 MB in the beginning and 298.7 MB in the end (delta: -50.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:59:46,408 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 49.39 ms. Allocated memory is still 306.2 MB. Free memory was 261.6 MB in the beginning and 259.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.89 ms. Allocated memory is still 306.2 MB. Free memory was 259.5 MB in the beginning and 258.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 341.96 ms. Allocated memory is still 306.2 MB. Free memory was 258.5 MB in the beginning and 248.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4464.26 ms. Allocated memory was 306.2 MB in the beginning and 337.6 MB in the end (delta: 31.5 MB). Free memory was 248.5 MB in the beginning and 298.7 MB in the end (delta: -50.2 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, 22 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 328 SDtfs, 30 SDslu, 545 SDs, 0 SdLazy, 396 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 6400 SizeOfPredicates, 12 NumberOfNonLiveVariables, 116 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 52/60 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__loop_unswitching.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-59-46-420.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__loop_unswitching.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-59-46-420.csv Received shutdown request...