java -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/chccomp2018/chcToBoogie_automizer.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig05.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 13:14:29,020 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 13:14:29,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 13:14:29,038 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 13:14:29,039 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 13:14:29,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 13:14:29,041 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 13:14:29,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 13:14:29,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 13:14:29,048 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 13:14:29,049 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 13:14:29,049 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 13:14:29,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 13:14:29,053 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 13:14:29,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 13:14:29,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 13:14:29,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 13:14:29,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 13:14:29,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 13:14:29,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 13:14:29,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 13:14:29,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 13:14:29,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 13:14:29,094 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 13:14:29,095 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 13:14:29,096 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 13:14:29,099 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 13:14:29,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 13:14:29,101 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 13:14:29,101 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 13:14:29,105 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 13:14:29,106 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 13:14:29,106 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 13:14:29,107 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 13:14:29,107 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 13:14:29,108 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 13:14:29,125 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 13:14:29,125 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 13:14:29,125 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 13:14:29,125 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 13:14:29,127 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 13:14:29,127 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 13:14:29,127 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 13:14:29,127 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 13:14:29,127 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 13:14:29,128 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 13:14:29,128 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 13:14:29,128 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 13:14:29,128 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 13:14:29,128 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 13:14:29,129 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 13:14:29,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 13:14:29,130 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 13:14:29,131 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 13:14:29,131 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 13:14:29,171 INFO ]: Repository-Root is: /tmp [2018-06-18 13:14:29,183 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 13:14:29,187 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 13:14:29,189 INFO ]: Initializing SmtParser... [2018-06-18 13:14:29,189 INFO ]: SmtParser initialized [2018-06-18 13:14:29,190 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig05.c.smt2 [2018-06-18 13:14:29,191 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-18 13:14:29,290 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig05.c.smt2 unknown [2018-06-18 13:14:29,567 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig05.c.smt2 [2018-06-18 13:14:29,572 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 13:14:29,580 INFO ]: Walking toolchain with 4 elements. [2018-06-18 13:14:29,580 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 13:14:29,580 INFO ]: Initializing ChcToBoogie... [2018-06-18 13:14:29,580 INFO ]: ChcToBoogie initialized [2018-06-18 13:14:29,588 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:14:29" (1/1) ... [2018-06-18 13:14:29,663 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:14:29 Unit [2018-06-18 13:14:29,663 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 13:14:29,665 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 13:14:29,665 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 13:14:29,666 INFO ]: Boogie Preprocessor initialized [2018-06-18 13:14:29,688 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:14:29" (1/1) ... [2018-06-18 13:14:29,689 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:14:29" (1/1) ... [2018-06-18 13:14:29,699 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:14:29" (1/1) ... [2018-06-18 13:14:29,700 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:14:29" (1/1) ... [2018-06-18 13:14:29,715 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:14:29" (1/1) ... [2018-06-18 13:14:29,716 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:14:29" (1/1) ... [2018-06-18 13:14:29,718 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:14:29" (1/1) ... [2018-06-18 13:14:29,719 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 13:14:29,720 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 13:14:29,720 INFO ]: Initializing RCFGBuilder... [2018-06-18 13:14:29,720 INFO ]: RCFGBuilder initialized [2018-06-18 13:14:29,721 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:14:29" (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-18 13:14:29,751 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 13:14:29,751 INFO ]: Found specification of procedure False [2018-06-18 13:14:29,751 INFO ]: Found implementation of procedure False [2018-06-18 13:14:29,751 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-18 13:14:29,751 INFO ]: Found specification of procedure state [2018-06-18 13:14:29,751 INFO ]: Found implementation of procedure state [2018-06-18 13:14:29,751 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 13:14:29,751 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 13:14:29,751 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-18 13:14:30,037 INFO ]: Using library mode [2018-06-18 13:14:30,037 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:14:30 BoogieIcfgContainer [2018-06-18 13:14:30,037 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 13:14:30,047 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 13:14:30,047 INFO ]: Initializing TraceAbstraction... [2018-06-18 13:14:30,051 INFO ]: TraceAbstraction initialized [2018-06-18 13:14:30,051 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:14:29" (1/3) ... [2018-06-18 13:14:30,061 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304db232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 01:14:30, skipping insertion in model container [2018-06-18 13:14:30,061 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:14:29" (2/3) ... [2018-06-18 13:14:30,061 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304db232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 01:14:30, skipping insertion in model container [2018-06-18 13:14:30,061 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:14:30" (3/3) ... [2018-06-18 13:14:30,063 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 13:14:30,077 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 13:14:30,094 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 13:14:30,152 INFO ]: Using default assertion order modulation [2018-06-18 13:14:30,153 INFO ]: Interprodecural is true [2018-06-18 13:14:30,153 INFO ]: Hoare is false [2018-06-18 13:14:30,153 INFO ]: Compute interpolants for FPandBP [2018-06-18 13:14:30,153 INFO ]: Backedges is TWOTRACK [2018-06-18 13:14:30,153 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 13:14:30,153 INFO ]: Difference is false [2018-06-18 13:14:30,153 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 13:14:30,153 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 13:14:30,172 INFO ]: Start isEmpty. Operand 13 states. [2018-06-18 13:14:30,183 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 13:14:30,183 INFO ]: Found error trace [2018-06-18 13:14:30,184 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:14:30,184 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:14:30,192 INFO ]: Analyzing trace with hash -683425083, now seen corresponding path program 1 times [2018-06-18 13:14:30,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:14:30,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:14:30,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:30,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:14:30,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:30,265 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:30,272 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:14:30,324 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 13:14:30,326 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 13:14:30,326 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 13:14:30,328 INFO ]: Interpolant automaton has 4 states [2018-06-18 13:14:30,341 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 13:14:30,341 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:14:30,343 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-18 13:14:30,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:14:30,412 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-18 13:14:30,413 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 13:14:30,414 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 13:14:30,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:14:30,423 INFO ]: With dead ends: 13 [2018-06-18 13:14:30,423 INFO ]: Without dead ends: 13 [2018-06-18 13:14:30,424 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-18 13:14:30,439 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-18 13:14:30,465 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-18 13:14:30,467 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-18 13:14:30,467 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-18 13:14:30,471 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-18 13:14:30,471 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:14:30,471 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-18 13:14:30,471 INFO ]: Interpolant automaton has 4 states. [2018-06-18 13:14:30,471 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-18 13:14:30,472 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 13:14:30,472 INFO ]: Found error trace [2018-06-18 13:14:30,473 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:14:30,474 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:14:30,474 INFO ]: Analyzing trace with hash 204343015, now seen corresponding path program 1 times [2018-06-18 13:14:30,474 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:14:30,474 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:14:30,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:30,475 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:14:30,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:30,517 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:30,517 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:14:30,764 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 13:14:30,765 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:14:30,765 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-18 13:14:30,774 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:14:30,818 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:30,828 INFO ]: Computing forward predicates... [2018-06-18 13:14:31,196 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 13:14:31,220 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:14:31,220 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-18 13:14:31,220 INFO ]: Interpolant automaton has 9 states [2018-06-18 13:14:31,220 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-18 13:14:31,221 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-18 13:14:31,221 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-06-18 13:14:31,585 WARN ]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-18 13:14:31,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:14:31,730 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-18 13:14:31,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 13:14:31,731 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-18 13:14:31,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:14:31,732 INFO ]: With dead ends: 15 [2018-06-18 13:14:31,732 INFO ]: Without dead ends: 15 [2018-06-18 13:14:31,733 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-18 13:14:31,733 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-18 13:14:31,736 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-18 13:14:31,736 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-18 13:14:31,736 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-18 13:14:31,736 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-18 13:14:31,736 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:14:31,736 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-18 13:14:31,737 INFO ]: Interpolant automaton has 9 states. [2018-06-18 13:14:31,737 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-18 13:14:31,737 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 13:14:31,737 INFO ]: Found error trace [2018-06-18 13:14:31,737 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:14:31,737 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:14:31,737 INFO ]: Analyzing trace with hash -1649658231, now seen corresponding path program 2 times [2018-06-18 13:14:31,737 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:14:31,737 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:14:31,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:31,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:14:31,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:31,797 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:31,799 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:14:32,126 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 13:14:32,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:14:32,126 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-18 13:14:32,134 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 13:14:32,171 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:14:32,171 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:32,174 INFO ]: Computing forward predicates... [2018-06-18 13:14:32,583 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-18 13:14:32,818 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 13:14:32,839 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:14:32,839 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-18 13:14:32,839 INFO ]: Interpolant automaton has 11 states [2018-06-18 13:14:32,839 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-18 13:14:32,839 INFO ]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-06-18 13:14:32,840 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 11 states. [2018-06-18 13:14:33,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:14:33,109 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-18 13:14:33,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 13:14:33,110 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-18 13:14:33,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:14:33,110 INFO ]: With dead ends: 17 [2018-06-18 13:14:33,110 INFO ]: Without dead ends: 17 [2018-06-18 13:14:33,111 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-06-18 13:14:33,111 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-18 13:14:33,114 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-18 13:14:33,114 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 13:14:33,115 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-18 13:14:33,115 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-18 13:14:33,115 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:14:33,115 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-18 13:14:33,115 INFO ]: Interpolant automaton has 11 states. [2018-06-18 13:14:33,115 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-18 13:14:33,116 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 13:14:33,116 INFO ]: Found error trace [2018-06-18 13:14:33,116 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:14:33,116 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:14:33,116 INFO ]: Analyzing trace with hash 2119922091, now seen corresponding path program 3 times [2018-06-18 13:14:33,116 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:14:33,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:14:33,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:33,117 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:14:33,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:33,174 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:33,175 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:14:33,675 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 13:14:33,675 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:14:33,675 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) [2018-06-18 13:14:33,689 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:14:33,737 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-18 13:14:33,737 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:33,741 INFO ]: Computing forward predicates... [2018-06-18 13:14:34,244 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 13:14:34,279 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:14:34,279 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-06-18 13:14:34,280 INFO ]: Interpolant automaton has 17 states [2018-06-18 13:14:34,280 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-18 13:14:34,280 INFO ]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-06-18 13:14:34,280 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 17 states. [2018-06-18 13:14:34,426 WARN ]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-06-18 13:14:34,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:14:34,907 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-18 13:14:34,908 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 13:14:34,908 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-18 13:14:34,908 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:14:34,909 INFO ]: With dead ends: 19 [2018-06-18 13:14:34,909 INFO ]: Without dead ends: 19 [2018-06-18 13:14:34,910 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-06-18 13:14:34,910 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 13:14:34,915 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-18 13:14:34,916 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-18 13:14:34,917 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-18 13:14:34,917 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21 [2018-06-18 13:14:34,917 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:14:34,917 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-18 13:14:34,917 INFO ]: Interpolant automaton has 17 states. [2018-06-18 13:14:34,917 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-18 13:14:34,918 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 13:14:34,918 INFO ]: Found error trace [2018-06-18 13:14:34,918 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:14:34,918 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:14:34,919 INFO ]: Analyzing trace with hash 1762711629, now seen corresponding path program 4 times [2018-06-18 13:14:34,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:14:34,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:14:34,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:34,925 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:14:34,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:34,991 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:34,992 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:14:35,365 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-18 13:14:35,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:14:35,365 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-18 13:14:35,373 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 13:14:35,415 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 13:14:35,415 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:35,419 INFO ]: Computing forward predicates... [2018-06-18 13:14:35,905 WARN ]: Spent 346.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-06-18 13:14:36,049 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-06-18 13:14:36,530 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-18 13:14:36,550 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:14:36,551 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-18 13:14:36,551 INFO ]: Interpolant automaton has 20 states [2018-06-18 13:14:36,551 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-18 13:14:36,551 INFO ]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-06-18 13:14:36,551 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 20 states. [2018-06-18 13:14:36,792 WARN ]: Spent 197.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-06-18 13:14:37,890 WARN ]: Spent 947.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2018-06-18 13:14:38,198 WARN ]: Spent 252.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2018-06-18 13:14:38,433 WARN ]: Spent 214.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2018-06-18 13:14:38,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:14:38,466 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-18 13:14:38,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 13:14:38,468 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-18 13:14:38,470 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:14:38,470 INFO ]: With dead ends: 21 [2018-06-18 13:14:38,470 INFO ]: Without dead ends: 21 [2018-06-18 13:14:38,471 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2018-06-18 13:14:38,471 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-18 13:14:38,474 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-18 13:14:38,474 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 13:14:38,474 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-18 13:14:38,474 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2018-06-18 13:14:38,475 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:14:38,475 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-18 13:14:38,475 INFO ]: Interpolant automaton has 20 states. [2018-06-18 13:14:38,475 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-18 13:14:38,475 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 13:14:38,476 INFO ]: Found error trace [2018-06-18 13:14:38,476 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:14:38,476 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:14:38,476 INFO ]: Analyzing trace with hash 853117551, now seen corresponding path program 5 times [2018-06-18 13:14:38,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:14:38,476 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:14:38,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:38,478 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:14:38,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:38,565 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:38,565 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:14:38,913 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-18 13:14:38,913 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:14:38,913 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-18 13:14:38,922 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-18 13:14:39,028 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-18 13:14:39,028 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:39,033 INFO ]: Computing forward predicates... [2018-06-18 13:14:39,790 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-18 13:14:39,810 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:14:39,810 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-18 13:14:39,810 INFO ]: Interpolant automaton has 20 states [2018-06-18 13:14:39,810 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-18 13:14:39,811 INFO ]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-06-18 13:14:39,811 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 20 states. [2018-06-18 13:14:40,372 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 26 [2018-06-18 13:14:40,497 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-06-18 13:14:40,646 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:14:40,646 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-18 13:14:40,646 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-18 13:14:40,646 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-18 13:14:40,646 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:14:40,647 INFO ]: With dead ends: 23 [2018-06-18 13:14:40,647 INFO ]: Without dead ends: 23 [2018-06-18 13:14:40,647 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2018-06-18 13:14:40,647 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 13:14:40,651 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-18 13:14:40,651 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-18 13:14:40,651 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-18 13:14:40,651 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 29 [2018-06-18 13:14:40,652 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:14:40,652 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-18 13:14:40,652 INFO ]: Interpolant automaton has 20 states. [2018-06-18 13:14:40,652 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-18 13:14:40,653 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-18 13:14:40,653 INFO ]: Found error trace [2018-06-18 13:14:40,653 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:14:40,653 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:14:40,653 INFO ]: Analyzing trace with hash -1661294575, now seen corresponding path program 6 times [2018-06-18 13:14:40,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:14:40,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:14:40,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:40,654 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:14:40,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:40,695 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:40,696 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:14:41,095 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-06-18 13:14:41,408 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-18 13:14:41,409 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:14:41,409 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-18 13:14:41,424 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:14:41,499 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-18 13:14:41,499 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:41,518 INFO ]: Computing forward predicates... [2018-06-18 13:14:41,933 WARN ]: Spent 318.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2018-06-18 13:14:43,343 WARN ]: Spent 1.08 s on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2018-06-18 13:14:43,513 WARN ]: Spent 131.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2018-06-18 13:14:43,881 WARN ]: Spent 316.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-06-18 13:14:44,755 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-18 13:14:44,775 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:14:44,775 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-06-18 13:14:44,775 INFO ]: Interpolant automaton has 26 states [2018-06-18 13:14:44,776 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-18 13:14:44,776 INFO ]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2018-06-18 13:14:44,776 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 26 states. [2018-06-18 13:14:45,649 WARN ]: Spent 737.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-06-18 13:14:45,893 WARN ]: Spent 185.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 27 [2018-06-18 13:14:46,063 WARN ]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 28 [2018-06-18 13:14:46,308 WARN ]: Spent 220.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 34 [2018-06-18 13:14:46,645 WARN ]: Spent 286.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 27 [2018-06-18 13:14:46,991 WARN ]: Spent 305.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 34 [2018-06-18 13:14:47,356 WARN ]: Spent 336.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 35 [2018-06-18 13:14:47,409 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:14:47,409 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-18 13:14:47,410 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-18 13:14:47,410 INFO ]: Start accepts. Automaton has 26 states. Word has length 33 [2018-06-18 13:14:47,410 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:14:47,411 INFO ]: With dead ends: 25 [2018-06-18 13:14:47,411 INFO ]: Without dead ends: 25 [2018-06-18 13:14:47,411 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2018-06-18 13:14:47,411 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 13:14:47,414 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-18 13:14:47,414 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 13:14:47,415 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-18 13:14:47,415 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 33 [2018-06-18 13:14:47,415 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:14:47,415 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-18 13:14:47,415 INFO ]: Interpolant automaton has 26 states. [2018-06-18 13:14:47,415 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-18 13:14:47,416 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-18 13:14:47,416 INFO ]: Found error trace [2018-06-18 13:14:47,416 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:14:47,416 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:14:47,416 INFO ]: Analyzing trace with hash -1494134477, now seen corresponding path program 7 times [2018-06-18 13:14:47,416 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:14:47,416 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:14:47,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:47,417 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:14:47,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:14:47,536 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:47,537 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:14:47,956 WARN ]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-18 13:14:48,280 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-18 13:14:48,280 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:14:48,280 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:14:48,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:14:48,340 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:14:48,347 INFO ]: Computing forward predicates... [2018-06-18 13:14:52,229 WARN ]: Spent 3.39 s on a formula simplification. DAG size of input: 518 DAG size of output: 74 [2018-06-18 13:14:53,274 WARN ]: Spent 900.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 63 [2018-06-18 13:15:04,047 WARN ]: Spent 9.97 s on a formula simplification. DAG size of input: 695 DAG size of output: 139 [2018-06-18 13:15:04,581 WARN ]: Spent 398.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2018-06-18 13:15:04,772 WARN ]: Spent 152.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-06-18 13:15:05,384 WARN ]: expecting exponential blowup for input size 6 [2018-06-18 13:15:05,404 WARN ]: expecting exponential blowup for input size 6 [2018-06-18 13:15:05,460 WARN ]: expecting exponential blowup for input size 6 [2018-06-18 13:15:05,468 WARN ]: expecting exponential blowup for input size 6 [2018-06-18 13:15:08,196 WARN ]: Spent 186.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-06-18 13:15:08,206 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-18 13:15:08,226 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:15:08,226 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 28 [2018-06-18 13:15:08,227 INFO ]: Interpolant automaton has 28 states [2018-06-18 13:15:08,227 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-18 13:15:08,227 INFO ]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2018-06-18 13:15:08,227 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 28 states. [2018-06-18 13:15:10,223 WARN ]: Spent 1.89 s on a formula simplification. DAG size of input: 232 DAG size of output: 128 [2018-06-18 13:15:11,131 WARN ]: Spent 787.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 28 [2018-06-18 13:15:12,809 WARN ]: Spent 1.62 s on a formula simplification. DAG size of input: 232 DAG size of output: 28 [2018-06-18 13:15:13,656 WARN ]: Spent 788.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 36 [2018-06-18 13:15:14,554 WARN ]: Spent 749.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 30 [2018-06-18 13:15:15,685 WARN ]: Spent 1.06 s on a formula simplification. DAG size of input: 233 DAG size of output: 50 [2018-06-18 13:15:16,774 WARN ]: Spent 1.03 s on a formula simplification. DAG size of input: 234 DAG size of output: 37 [2018-06-18 13:15:18,143 WARN ]: Spent 1.30 s on a formula simplification. DAG size of input: 235 DAG size of output: 73 [2018-06-18 13:15:18,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:15:18,200 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-18 13:15:18,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 13:15:18,202 INFO ]: Start accepts. Automaton has 28 states. Word has length 37 [2018-06-18 13:15:18,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:15:18,203 INFO ]: With dead ends: 27 [2018-06-18 13:15:18,203 INFO ]: Without dead ends: 27 [2018-06-18 13:15:18,203 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=239, Invalid=1021, Unknown=0, NotChecked=0, Total=1260 [2018-06-18 13:15:18,203 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 13:15:18,207 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-18 13:15:18,207 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 13:15:18,208 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-18 13:15:18,208 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 37 [2018-06-18 13:15:18,208 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:15:18,208 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-18 13:15:18,208 INFO ]: Interpolant automaton has 28 states. [2018-06-18 13:15:18,208 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-18 13:15:18,209 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-18 13:15:18,209 INFO ]: Found error trace [2018-06-18 13:15:18,209 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:15:18,209 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:15:18,209 INFO ]: Analyzing trace with hash 1618126293, now seen corresponding path program 8 times [2018-06-18 13:15:18,210 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:15:18,210 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:15:18,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:15:18,210 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:15:18,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:15:18,265 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:15:18,265 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:15:19,295 WARN ]: Spent 814.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 17 [2018-06-18 13:15:20,008 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-18 13:15:20,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:15:20,008 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:15:20,020 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 13:15:20,069 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:15:20,069 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:15:20,075 INFO ]: Computing forward predicates... [2018-06-18 13:15:26,266 WARN ]: Spent 5.54 s on a formula simplification. DAG size of input: 700 DAG size of output: 81 [2018-06-18 13:15:26,725 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-06-18 13:15:26,994 WARN ]: Spent 198.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-06-18 13:15:27,516 WARN ]: Spent 463.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2018-06-18 13:15:28,469 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-18 13:15:28,489 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:15:28,489 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2018-06-18 13:15:28,490 INFO ]: Interpolant automaton has 31 states [2018-06-18 13:15:28,490 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-18 13:15:28,490 INFO ]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-06-18 13:15:28,490 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 31 states. [2018-06-18 13:15:29,391 WARN ]: Spent 846.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 82 [2018-06-18 13:15:29,783 WARN ]: Spent 344.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 32 [2018-06-18 13:15:30,098 WARN ]: Spent 280.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 31 [2018-06-18 13:15:30,452 WARN ]: Spent 317.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 35 [2018-06-18 13:15:30,763 WARN ]: Spent 273.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 23 [2018-06-18 13:15:31,225 WARN ]: Spent 355.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 40 [2018-06-18 13:15:31,633 WARN ]: Spent 371.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 28 [2018-06-18 13:15:32,069 WARN ]: Spent 374.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 42 [2018-06-18 13:15:32,734 WARN ]: Spent 627.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 61 [2018-06-18 13:15:32,773 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:15:32,773 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-18 13:15:32,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-18 13:15:32,773 INFO ]: Start accepts. Automaton has 31 states. Word has length 41 [2018-06-18 13:15:32,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:15:32,774 INFO ]: With dead ends: 29 [2018-06-18 13:15:32,774 INFO ]: Without dead ends: 29 [2018-06-18 13:15:32,774 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=267, Invalid=1293, Unknown=0, NotChecked=0, Total=1560 [2018-06-18 13:15:32,774 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 13:15:32,778 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-18 13:15:32,778 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 13:15:32,779 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-18 13:15:32,779 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 41 [2018-06-18 13:15:32,779 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:15:32,779 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-18 13:15:32,779 INFO ]: Interpolant automaton has 31 states. [2018-06-18 13:15:32,779 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-18 13:15:32,780 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-18 13:15:32,780 INFO ]: Found error trace [2018-06-18 13:15:32,780 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:15:32,780 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:15:32,780 INFO ]: Analyzing trace with hash 996918775, now seen corresponding path program 9 times [2018-06-18 13:15:32,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:15:32,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:15:32,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:15:32,780 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:15:32,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:15:32,939 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:15:32,940 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-06-18 13:15:33,870 WARN ]: Removed 3 from assertion stack [2018-06-18 13:15:33,870 WARN ]: Verification canceled [2018-06-18 13:15:33,874 WARN ]: Timeout [2018-06-18 13:15:33,874 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 01:15:33 BoogieIcfgContainer [2018-06-18 13:15:33,874 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 13:15:33,875 INFO ]: Toolchain (without parser) took 64302.43 ms. Allocated memory was 304.1 MB in the beginning and 808.5 MB in the end (delta: 504.4 MB). Free memory was 255.5 MB in the beginning and 433.2 MB in the end (delta: -177.7 MB). Peak memory consumption was 326.6 MB. Max. memory is 3.6 GB. [2018-06-18 13:15:33,875 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 13:15:33,876 INFO ]: ChcToBoogie took 83.60 ms. Allocated memory is still 304.1 MB. Free memory was 255.5 MB in the beginning and 252.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:15:33,876 INFO ]: Boogie Preprocessor took 54.03 ms. Allocated memory is still 304.1 MB. Free memory was 252.5 MB in the beginning and 251.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-18 13:15:33,877 INFO ]: RCFGBuilder took 317.32 ms. Allocated memory is still 304.1 MB. Free memory was 251.5 MB in the beginning and 242.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:15:33,877 INFO ]: TraceAbstraction took 63826.66 ms. Allocated memory was 304.1 MB in the beginning and 808.5 MB in the end (delta: 504.4 MB). Free memory was 242.5 MB in the beginning and 433.2 MB in the end (delta: -190.7 MB). Peak memory consumption was 313.7 MB. Max. memory is 3.6 GB. [2018-06-18 13:15:33,880 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 304.1 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 83.60 ms. Allocated memory is still 304.1 MB. Free memory was 255.5 MB in the beginning and 252.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 54.03 ms. Allocated memory is still 304.1 MB. Free memory was 252.5 MB in the beginning and 251.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 317.32 ms. Allocated memory is still 304.1 MB. Free memory was 251.5 MB in the beginning and 242.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 63826.66 ms. Allocated memory was 304.1 MB in the beginning and 808.5 MB in the end (delta: 504.4 MB). Free memory was 242.5 MB in the beginning and 433.2 MB in the end (delta: -190.7 MB). Peak memory consumption was 313.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 46 with TraceHistMax 10, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 16. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. TIMEOUT Result, 63.7s OverallTime, 10 OverallIterations, 10 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 121 SDtfs, 375 SDslu, 780 SDs, 0 SdLazy, 683 SolverSat, 449 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 160 SyntacticMatches, 8 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 52.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 39.9s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 107527984 SizeOfPredicates, 487 NumberOfNonLiveVariables, 1568 ConjunctsInSsa, 370 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 240/888 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig05.c.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_13-15-33-889.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig05.c.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_13-15-33-889.csv Completed graceful shutdown