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/lustre/_6counters_e8_371_e7_304.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 13:52:09,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 13:52:09,061 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 13:52:09,081 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 13:52:09,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 13:52:09,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 13:52:09,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 13:52:09,090 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 13:52:09,092 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 13:52:09,093 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 13:52:09,096 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 13:52:09,096 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 13:52:09,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 13:52:09,098 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 13:52:09,099 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 13:52:09,100 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 13:52:09,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 13:52:09,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 13:52:09,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 13:52:09,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 13:52:09,125 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 13:52:09,128 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 13:52:09,128 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 13:52:09,128 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 13:52:09,131 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 13:52:09,132 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 13:52:09,133 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 13:52:09,134 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 13:52:09,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 13:52:09,139 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 13:52:09,139 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 13:52:09,140 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 13:52:09,140 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 13:52:09,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 13:52:09,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 13:52:09,142 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 13:52:09,168 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 13:52:09,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 13:52:09,168 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 13:52:09,169 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 13:52:09,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 13:52:09,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 13:52:09,172 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 13:52:09,172 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 13:52:09,172 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 13:52:09,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 13:52:09,173 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 13:52:09,173 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 13:52:09,173 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 13:52:09,173 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 13:52:09,173 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 13:52:09,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 13:52:09,174 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 13:52:09,176 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 13:52:09,176 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 13:52:09,229 INFO ]: Repository-Root is: /tmp [2018-06-18 13:52:09,248 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 13:52:09,254 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 13:52:09,255 INFO ]: Initializing SmtParser... [2018-06-18 13:52:09,256 INFO ]: SmtParser initialized [2018-06-18 13:52:09,256 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 [2018-06-18 13:52:09,258 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:52:09,355 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 unknown [2018-06-18 13:52:09,615 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 [2018-06-18 13:52:09,620 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 13:52:09,628 INFO ]: Walking toolchain with 4 elements. [2018-06-18 13:52:09,629 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 13:52:09,629 INFO ]: Initializing ChcToBoogie... [2018-06-18 13:52:09,629 INFO ]: ChcToBoogie initialized [2018-06-18 13:52:09,636 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:52:09" (1/1) ... [2018-06-18 13:52:09,697 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:09 Unit [2018-06-18 13:52:09,699 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 13:52:09,700 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 13:52:09,700 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 13:52:09,700 INFO ]: Boogie Preprocessor initialized [2018-06-18 13:52:09,723 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:09" (1/1) ... [2018-06-18 13:52:09,723 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:09" (1/1) ... [2018-06-18 13:52:09,730 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:09" (1/1) ... [2018-06-18 13:52:09,730 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:09" (1/1) ... [2018-06-18 13:52:09,734 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:09" (1/1) ... [2018-06-18 13:52:09,735 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:09" (1/1) ... [2018-06-18 13:52:09,736 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:09" (1/1) ... [2018-06-18 13:52:09,737 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 13:52:09,738 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 13:52:09,738 INFO ]: Initializing RCFGBuilder... [2018-06-18 13:52:09,738 INFO ]: RCFGBuilder initialized [2018-06-18 13:52:09,739 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:09" (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:52:09,754 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 13:52:09,754 INFO ]: Found specification of procedure False [2018-06-18 13:52:09,754 INFO ]: Found implementation of procedure False [2018-06-18 13:52:09,754 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-18 13:52:09,754 INFO ]: Found specification of procedure state [2018-06-18 13:52:09,754 INFO ]: Found implementation of procedure state [2018-06-18 13:52:09,754 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 13:52:09,754 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 13:52:09,754 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:52:10,045 INFO ]: Using library mode [2018-06-18 13:52:10,045 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:52:10 BoogieIcfgContainer [2018-06-18 13:52:10,046 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 13:52:10,047 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 13:52:10,047 INFO ]: Initializing TraceAbstraction... [2018-06-18 13:52:10,051 INFO ]: TraceAbstraction initialized [2018-06-18 13:52:10,051 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:52:09" (1/3) ... [2018-06-18 13:52:10,052 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1b6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 01:52:10, skipping insertion in model container [2018-06-18 13:52:10,052 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:09" (2/3) ... [2018-06-18 13:52:10,052 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1b6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 01:52:10, skipping insertion in model container [2018-06-18 13:52:10,052 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:52:10" (3/3) ... [2018-06-18 13:52:10,054 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 13:52:10,064 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 13:52:10,074 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 13:52:10,126 INFO ]: Using default assertion order modulation [2018-06-18 13:52:10,126 INFO ]: Interprodecural is true [2018-06-18 13:52:10,126 INFO ]: Hoare is false [2018-06-18 13:52:10,126 INFO ]: Compute interpolants for FPandBP [2018-06-18 13:52:10,126 INFO ]: Backedges is TWOTRACK [2018-06-18 13:52:10,126 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 13:52:10,126 INFO ]: Difference is false [2018-06-18 13:52:10,126 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 13:52:10,127 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 13:52:10,139 INFO ]: Start isEmpty. Operand 13 states. [2018-06-18 13:52:10,150 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 13:52:10,150 INFO ]: Found error trace [2018-06-18 13:52:10,151 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:10,151 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:10,156 INFO ]: Analyzing trace with hash -597537630, now seen corresponding path program 1 times [2018-06-18 13:52:10,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:10,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:10,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:10,192 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:52:10,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:10,235 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:10,243 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:52:10,362 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:52:10,364 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 13:52:10,364 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 13:52:10,365 INFO ]: Interpolant automaton has 4 states [2018-06-18 13:52:10,377 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 13:52:10,378 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:52:10,381 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-18 13:52:10,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:52:10,503 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-18 13:52:10,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 13:52:10,505 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 13:52:10,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:52:10,521 INFO ]: With dead ends: 13 [2018-06-18 13:52:10,521 INFO ]: Without dead ends: 13 [2018-06-18 13:52:10,527 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:52:10,545 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-18 13:52:10,569 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-18 13:52:10,571 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-18 13:52:10,572 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-18 13:52:10,573 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-18 13:52:10,573 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:52:10,573 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-18 13:52:10,573 INFO ]: Interpolant automaton has 4 states. [2018-06-18 13:52:10,573 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-18 13:52:10,575 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 13:52:10,575 INFO ]: Found error trace [2018-06-18 13:52:10,575 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:10,575 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:10,575 INFO ]: Analyzing trace with hash 1530833734, now seen corresponding path program 1 times [2018-06-18 13:52:10,575 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:10,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:10,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:10,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:52:10,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:10,641 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:10,642 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:52:10,888 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-06-18 13:52:11,200 WARN ]: Spent 253.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-06-18 13:52:11,202 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:52:11,202 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:52:11,202 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:52:11,210 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:52:11,253 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:11,264 INFO ]: Computing forward predicates... [2018-06-18 13:52:11,879 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:52:11,910 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:52:11,910 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-18 13:52:11,911 INFO ]: Interpolant automaton has 8 states [2018-06-18 13:52:11,911 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 13:52:11,911 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-18 13:52:11,911 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 8 states. [2018-06-18 13:52:12,450 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:52:12,450 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-18 13:52:12,451 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 13:52:12,451 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-18 13:52:12,451 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:52:12,452 INFO ]: With dead ends: 15 [2018-06-18 13:52:12,452 INFO ]: Without dead ends: 15 [2018-06-18 13:52:12,453 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-18 13:52:12,453 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-18 13:52:12,458 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-18 13:52:12,458 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-18 13:52:12,459 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-18 13:52:12,459 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-18 13:52:12,459 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:52:12,459 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-18 13:52:12,459 INFO ]: Interpolant automaton has 8 states. [2018-06-18 13:52:12,459 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-18 13:52:12,460 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 13:52:12,460 INFO ]: Found error trace [2018-06-18 13:52:12,460 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:12,460 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:12,460 INFO ]: Analyzing trace with hash -1486246934, now seen corresponding path program 2 times [2018-06-18 13:52:12,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:12,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:12,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:12,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:52:12,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:12,532 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:12,534 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:52:13,036 WARN ]: Spent 252.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-06-18 13:52:13,266 WARN ]: Spent 134.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 6 [2018-06-18 13:52:13,267 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:52:13,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:52:13,267 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) [2018-06-18 13:52:13,289 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:52:13,368 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:52:13,368 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:13,372 INFO ]: Computing forward predicates... [2018-06-18 13:52:14,085 WARN ]: Spent 303.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-06-18 13:52:14,330 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:52:14,364 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:52:14,365 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-18 13:52:14,365 INFO ]: Interpolant automaton has 12 states [2018-06-18 13:52:14,365 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-18 13:52:14,365 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-18 13:52:14,366 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-06-18 13:52:14,655 WARN ]: Spent 239.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-06-18 13:52:14,927 WARN ]: Spent 143.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-06-18 13:52:14,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:52:14,972 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-18 13:52:14,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 13:52:14,972 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-18 13:52:14,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:52:14,973 INFO ]: With dead ends: 17 [2018-06-18 13:52:14,973 INFO ]: Without dead ends: 17 [2018-06-18 13:52:14,973 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-06-18 13:52:14,974 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-18 13:52:14,977 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-18 13:52:14,977 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 13:52:14,977 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-18 13:52:14,977 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-18 13:52:14,978 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:52:14,978 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-18 13:52:14,978 INFO ]: Interpolant automaton has 12 states. [2018-06-18 13:52:14,978 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-18 13:52:14,978 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 13:52:14,978 INFO ]: Found error trace [2018-06-18 13:52:14,978 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:14,979 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:14,979 INFO ]: Analyzing trace with hash -2056434034, now seen corresponding path program 3 times [2018-06-18 13:52:14,979 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:14,979 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:14,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:14,980 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:52:14,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:15,017 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:15,018 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:52:15,482 WARN ]: Spent 300.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-06-18 13:52:15,588 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:52:15,588 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:52:15,588 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:52:15,596 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 13:52:15,685 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-18 13:52:15,685 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:15,690 INFO ]: Computing forward predicates... [2018-06-18 13:52:16,159 WARN ]: Spent 162.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-06-18 13:52:16,286 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:52:16,323 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:52:16,323 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-18 13:52:16,323 INFO ]: Interpolant automaton has 16 states [2018-06-18 13:52:16,323 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-18 13:52:16,323 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-18 13:52:16,324 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 16 states. [2018-06-18 13:52:16,906 WARN ]: Spent 287.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-06-18 13:52:16,928 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:52:16,928 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-18 13:52:16,929 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 13:52:16,929 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-18 13:52:16,929 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:52:16,930 INFO ]: With dead ends: 19 [2018-06-18 13:52:16,930 INFO ]: Without dead ends: 19 [2018-06-18 13:52:16,930 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-06-18 13:52:16,930 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 13:52:16,933 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-18 13:52:16,933 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-18 13:52:16,934 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-18 13:52:16,934 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21 [2018-06-18 13:52:16,934 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:52:16,934 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-18 13:52:16,934 INFO ]: Interpolant automaton has 16 states. [2018-06-18 13:52:16,934 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-18 13:52:16,935 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 13:52:16,935 INFO ]: Found error trace [2018-06-18 13:52:16,935 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:16,935 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:16,935 INFO ]: Analyzing trace with hash -434924750, now seen corresponding path program 4 times [2018-06-18 13:52:16,936 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:16,936 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:16,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:16,936 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:52:16,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:16,969 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:16,973 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:52:17,247 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:52:17,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:52:17,247 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:52:17,261 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 13:52:17,304 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 13:52:17,305 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:17,308 INFO ]: Computing forward predicates... [2018-06-18 13:52:17,659 WARN ]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-18 13:52:18,298 WARN ]: Spent 415.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-06-18 13:52:18,443 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:52:18,464 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:52:18,464 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-18 13:52:18,464 INFO ]: Interpolant automaton has 20 states [2018-06-18 13:52:18,464 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-18 13:52:18,465 INFO ]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-06-18 13:52:18,465 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 20 states. [2018-06-18 13:52:18,794 WARN ]: Spent 273.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2018-06-18 13:52:19,445 WARN ]: Spent 402.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-06-18 13:52:19,784 WARN ]: Spent 248.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 27 [2018-06-18 13:52:20,273 WARN ]: Spent 456.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 28 [2018-06-18 13:52:20,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:52:20,633 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-18 13:52:20,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 13:52:20,637 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-18 13:52:20,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:52:20,638 INFO ]: With dead ends: 21 [2018-06-18 13:52:20,638 INFO ]: Without dead ends: 21 [2018-06-18 13:52:20,638 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2018-06-18 13:52:20,639 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-18 13:52:20,641 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-18 13:52:20,641 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 13:52:20,642 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-18 13:52:20,642 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2018-06-18 13:52:20,642 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:52:20,642 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-18 13:52:20,642 INFO ]: Interpolant automaton has 20 states. [2018-06-18 13:52:20,642 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-18 13:52:20,643 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 13:52:20,643 INFO ]: Found error trace [2018-06-18 13:52:20,643 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:20,643 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:20,643 INFO ]: Analyzing trace with hash 1986427350, now seen corresponding path program 5 times [2018-06-18 13:52:20,643 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:20,643 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:20,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:20,645 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:52:20,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:20,688 INFO ]: Conjunction of SSA is sat [2018-06-18 13:52:20,691 INFO ]: Counterexample might be feasible [2018-06-18 13:52:20,706 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 01:52:20 BoogieIcfgContainer [2018-06-18 13:52:20,706 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 13:52:20,707 INFO ]: Toolchain (without parser) took 11087.32 ms. Allocated memory was 308.3 MB in the beginning and 383.8 MB in the end (delta: 75.5 MB). Free memory was 260.7 MB in the beginning and 337.5 MB in the end (delta: -76.8 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 13:52:20,708 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 308.3 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 13:52:20,709 INFO ]: ChcToBoogie took 71.09 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 256.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:52:20,709 INFO ]: Boogie Preprocessor took 37.07 ms. Allocated memory is still 308.3 MB. Free memory is still 256.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 13:52:20,709 INFO ]: RCFGBuilder took 307.67 ms. Allocated memory is still 308.3 MB. Free memory was 256.7 MB in the beginning and 246.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:52:20,710 INFO ]: TraceAbstraction took 10659.40 ms. Allocated memory was 308.3 MB in the beginning and 383.8 MB in the end (delta: 75.5 MB). Free memory was 244.7 MB in the beginning and 337.5 MB in the end (delta: -92.7 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 13:52:20,713 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 308.3 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 71.09 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 256.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.07 ms. Allocated memory is still 308.3 MB. Free memory is still 256.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 307.67 ms. Allocated memory is still 308.3 MB. Free memory was 256.7 MB in the beginning and 246.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 10659.40 ms. Allocated memory was 308.3 MB in the beginning and 383.8 MB in the end (delta: 75.5 MB). Free memory was 244.7 MB in the beginning and 337.5 MB in the end (delta: -92.7 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call False(); [L0] assume !hbv_False_1_Bool; [L0] CALL call state(hbv_False_2_Bool, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Int, hbv_False_6_Bool, hbv_False_7_Bool, hbv_False_8_Bool, hbv_False_9_Bool, hbv_False_10_Int, hbv_False_11_Bool, hbv_False_12_Bool, hbv_False_13_Bool, hbv_False_1_Bool, hbv_False_14_Bool, hbv_False_15_Int); [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume (((((((((((!hhv_state_2_Bool && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_5_Bool))) && !((hhv_state_4_Bool || hhv_state_0_Bool) && (!hhv_state_4_Bool || !hhv_state_0_Bool))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || (hhv_state_4_Bool && hhv_state_6_Bool)) && ((!hhv_state_4_Bool || !hhv_state_7_Bool) || !hhv_state_6_Bool))) && hhv_state_3_Int == hhv_state_8_Int) && !((!(hhv_state_8_Int == 5) || !hhv_state_9_Bool) && (hhv_state_9_Bool || hhv_state_8_Int == 5))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_7_Bool || !hhv_state_10_Bool))) && hhv_state_3_Int == 0) && !((((!hhv_state_11_Bool && !hhv_state_10_Bool) || hhv_state_12_Bool) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((hhv_state_11_Bool || hhv_state_10_Bool) && (!hhv_state_11_Bool || !hhv_state_10_Bool))))) && !hhv_state_1_Bool) && !((hhv_state_2_Bool || hhv_state_6_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && !((!hhv_state_11_Bool || !hhv_state_9_Bool) && (hhv_state_9_Bool || hhv_state_11_Bool)); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_False_2_Bool, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Int, hbv_False_6_Bool, hbv_False_7_Bool, hbv_False_8_Bool, hbv_False_9_Bool, hbv_False_10_Int, hbv_False_11_Bool, hbv_False_12_Bool, hbv_False_13_Bool, hbv_False_1_Bool, hbv_False_14_Bool, hbv_False_15_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. UNSAFE Result, 10.5s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 84 SDslu, 229 SDs, 0 SdLazy, 177 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 13280 SizeOfPredicates, 73 NumberOfNonLiveVariables, 674 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 40/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/_6counters_e8_371_e7_304.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_13-52-20-724.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/_6counters_e8_371_e7_304.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_13-52-20-724.csv Received shutdown request...