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.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 13:52:23,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 13:52:23,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 13:52:23,980 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 13:52:23,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 13:52:23,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 13:52:23,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 13:52:23,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 13:52:23,990 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 13:52:23,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 13:52:23,993 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 13:52:23,994 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 13:52:23,994 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 13:52:23,998 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 13:52:23,999 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 13:52:23,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 13:52:24,004 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 13:52:24,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 13:52:24,018 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 13:52:24,019 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 13:52:24,020 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 13:52:24,023 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 13:52:24,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 13:52:24,024 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 13:52:24,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 13:52:24,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 13:52:24,033 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 13:52:24,034 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 13:52:24,035 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 13:52:24,035 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 13:52:24,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 13:52:24,042 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 13:52:24,042 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 13:52:24,043 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 13:52:24,044 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 13:52:24,044 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:24,065 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 13:52:24,066 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 13:52:24,066 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 13:52:24,066 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 13:52:24,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 13:52:24,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 13:52:24,068 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 13:52:24,068 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 13:52:24,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 13:52:24,069 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 13:52:24,070 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 13:52:24,070 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 13:52:24,070 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 13:52:24,070 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 13:52:24,070 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 13:52:24,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 13:52:24,071 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 13:52:24,074 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 13:52:24,074 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 13:52:24,124 INFO ]: Repository-Root is: /tmp [2018-06-18 13:52:24,141 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 13:52:24,145 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 13:52:24,146 INFO ]: Initializing SmtParser... [2018-06-18 13:52:24,147 INFO ]: SmtParser initialized [2018-06-18 13:52:24,147 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters.smt2 [2018-06-18 13:52:24,149 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:24,269 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters.smt2 unknown [2018-06-18 13:52:24,489 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters.smt2 [2018-06-18 13:52:24,494 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 13:52:24,500 INFO ]: Walking toolchain with 4 elements. [2018-06-18 13:52:24,500 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 13:52:24,500 INFO ]: Initializing ChcToBoogie... [2018-06-18 13:52:24,501 INFO ]: ChcToBoogie initialized [2018-06-18 13:52:24,507 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:52:24" (1/1) ... [2018-06-18 13:52:24,572 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:24 Unit [2018-06-18 13:52:24,572 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 13:52:24,573 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 13:52:24,573 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 13:52:24,573 INFO ]: Boogie Preprocessor initialized [2018-06-18 13:52:24,597 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:24" (1/1) ... [2018-06-18 13:52:24,597 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:24" (1/1) ... [2018-06-18 13:52:24,607 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:24" (1/1) ... [2018-06-18 13:52:24,607 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:24" (1/1) ... [2018-06-18 13:52:24,610 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:24" (1/1) ... [2018-06-18 13:52:24,619 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:24" (1/1) ... [2018-06-18 13:52:24,621 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:24" (1/1) ... [2018-06-18 13:52:24,622 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 13:52:24,623 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 13:52:24,623 INFO ]: Initializing RCFGBuilder... [2018-06-18 13:52:24,623 INFO ]: RCFGBuilder initialized [2018-06-18 13:52:24,629 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:24" (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:24,646 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 13:52:24,646 INFO ]: Found specification of procedure False [2018-06-18 13:52:24,646 INFO ]: Found implementation of procedure False [2018-06-18 13:52:24,646 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-18 13:52:24,646 INFO ]: Found specification of procedure state [2018-06-18 13:52:24,646 INFO ]: Found implementation of procedure state [2018-06-18 13:52:24,646 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 13:52:24,646 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 13:52:24,646 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:24,905 INFO ]: Using library mode [2018-06-18 13:52:24,907 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:52:24 BoogieIcfgContainer [2018-06-18 13:52:24,907 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 13:52:24,908 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 13:52:24,908 INFO ]: Initializing TraceAbstraction... [2018-06-18 13:52:24,919 INFO ]: TraceAbstraction initialized [2018-06-18 13:52:24,919 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:52:24" (1/3) ... [2018-06-18 13:52:24,921 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb89dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 01:52:24, skipping insertion in model container [2018-06-18 13:52:24,921 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:52:24" (2/3) ... [2018-06-18 13:52:24,921 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb89dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 01:52:24, skipping insertion in model container [2018-06-18 13:52:24,921 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:52:24" (3/3) ... [2018-06-18 13:52:24,924 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 13:52:24,937 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 13:52:24,950 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 13:52:25,000 INFO ]: Using default assertion order modulation [2018-06-18 13:52:25,001 INFO ]: Interprodecural is true [2018-06-18 13:52:25,001 INFO ]: Hoare is false [2018-06-18 13:52:25,001 INFO ]: Compute interpolants for FPandBP [2018-06-18 13:52:25,001 INFO ]: Backedges is TWOTRACK [2018-06-18 13:52:25,001 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 13:52:25,001 INFO ]: Difference is false [2018-06-18 13:52:25,001 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 13:52:25,001 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 13:52:25,021 INFO ]: Start isEmpty. Operand 13 states. [2018-06-18 13:52:25,036 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 13:52:25,036 INFO ]: Found error trace [2018-06-18 13:52:25,037 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:25,037 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:25,043 INFO ]: Analyzing trace with hash -597537630, now seen corresponding path program 1 times [2018-06-18 13:52:25,046 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:25,046 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:25,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:25,086 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:52:25,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:25,136 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:25,145 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:52:25,340 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:25,343 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 13:52:25,343 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 13:52:25,346 INFO ]: Interpolant automaton has 4 states [2018-06-18 13:52:25,363 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 13:52:25,363 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:52:25,366 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-18 13:52:25,475 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:52:25,476 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-18 13:52:25,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 13:52:25,479 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 13:52:25,479 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:52:25,491 INFO ]: With dead ends: 13 [2018-06-18 13:52:25,491 INFO ]: Without dead ends: 13 [2018-06-18 13:52:25,495 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:52:25,518 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-18 13:52:25,550 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-18 13:52:25,551 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-18 13:52:25,552 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-18 13:52:25,553 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-18 13:52:25,553 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:52:25,553 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-18 13:52:25,553 INFO ]: Interpolant automaton has 4 states. [2018-06-18 13:52:25,553 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-18 13:52:25,554 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 13:52:25,554 INFO ]: Found error trace [2018-06-18 13:52:25,554 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:25,554 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:25,555 INFO ]: Analyzing trace with hash 1530833734, now seen corresponding path program 1 times [2018-06-18 13:52:25,555 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:25,555 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:25,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:25,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:52:25,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:25,621 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:25,622 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:52:26,157 WARN ]: Spent 391.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-06-18 13:52:26,314 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:26,314 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:52:26,314 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:26,326 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:52:26,381 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:26,393 INFO ]: Computing forward predicates... [2018-06-18 13:52:27,299 WARN ]: Spent 368.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 7 [2018-06-18 13:52:27,382 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:27,405 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:52:27,406 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-18 13:52:27,406 INFO ]: Interpolant automaton has 9 states [2018-06-18 13:52:27,407 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-18 13:52:27,407 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-18 13:52:27,407 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-06-18 13:52:27,835 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:52:27,835 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-18 13:52:27,836 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 13:52:27,836 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-18 13:52:27,836 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:52:27,836 INFO ]: With dead ends: 15 [2018-06-18 13:52:27,836 INFO ]: Without dead ends: 15 [2018-06-18 13:52:27,837 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-18 13:52:27,838 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-18 13:52:27,840 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-18 13:52:27,840 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-18 13:52:27,841 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-18 13:52:27,841 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-18 13:52:27,841 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:52:27,841 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-18 13:52:27,841 INFO ]: Interpolant automaton has 9 states. [2018-06-18 13:52:27,841 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-18 13:52:27,842 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 13:52:27,842 INFO ]: Found error trace [2018-06-18 13:52:27,842 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:27,842 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:27,842 INFO ]: Analyzing trace with hash -1486246934, now seen corresponding path program 2 times [2018-06-18 13:52:27,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:27,842 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:27,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:27,843 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:52:27,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:27,898 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:27,899 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:52:28,528 WARN ]: Spent 476.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-06-18 13:52:28,639 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:28,640 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:52:28,640 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:52:28,646 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 13:52:28,693 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:52:28,693 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:28,696 INFO ]: Computing forward predicates... [2018-06-18 13:52:29,530 WARN ]: Spent 183.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 7 [2018-06-18 13:52:29,725 WARN ]: Spent 134.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-06-18 13:52:29,901 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:29,965 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:52:29,965 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-18 13:52:29,965 INFO ]: Interpolant automaton has 12 states [2018-06-18 13:52:29,965 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-18 13:52:29,966 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-18 13:52:29,966 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-06-18 13:52:30,921 WARN ]: Spent 649.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-06-18 13:52:31,155 WARN ]: Spent 218.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-06-18 13:52:31,331 WARN ]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-06-18 13:52:31,492 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-06-18 13:52:31,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:52:31,537 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-18 13:52:31,537 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 13:52:31,537 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-18 13:52:31,537 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:52:31,538 INFO ]: With dead ends: 17 [2018-06-18 13:52:31,538 INFO ]: Without dead ends: 17 [2018-06-18 13:52:31,538 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-06-18 13:52:31,538 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-18 13:52:31,542 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-18 13:52:31,542 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 13:52:31,542 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-18 13:52:31,542 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-18 13:52:31,542 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:52:31,542 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-18 13:52:31,542 INFO ]: Interpolant automaton has 12 states. [2018-06-18 13:52:31,542 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-18 13:52:31,543 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 13:52:31,543 INFO ]: Found error trace [2018-06-18 13:52:31,543 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:31,543 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:31,543 INFO ]: Analyzing trace with hash -2056434034, now seen corresponding path program 3 times [2018-06-18 13:52:31,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:31,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:31,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:31,544 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:52:31,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:31,581 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:31,584 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:52:31,866 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:31,867 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:52:31,867 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:31,882 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 13:52:31,969 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-18 13:52:31,969 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:31,973 INFO ]: Computing forward predicates... [2018-06-18 13:52:32,634 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 24 [2018-06-18 13:52:33,160 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:33,181 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:52:33,182 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-18 13:52:33,182 INFO ]: Interpolant automaton has 16 states [2018-06-18 13:52:33,182 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-18 13:52:33,182 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-18 13:52:33,182 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 16 states. [2018-06-18 13:52:33,635 WARN ]: Spent 417.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2018-06-18 13:52:34,007 WARN ]: Spent 230.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 32 [2018-06-18 13:52:34,573 WARN ]: Spent 415.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2018-06-18 13:52:34,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:52:34,688 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-18 13:52:34,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 13:52:34,693 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-18 13:52:34,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:52:34,694 INFO ]: With dead ends: 19 [2018-06-18 13:52:34,694 INFO ]: Without dead ends: 19 [2018-06-18 13:52:34,695 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-06-18 13:52:34,695 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 13:52:34,704 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-18 13:52:34,704 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-18 13:52:34,704 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-18 13:52:34,704 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21 [2018-06-18 13:52:34,705 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:52:34,705 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-18 13:52:34,705 INFO ]: Interpolant automaton has 16 states. [2018-06-18 13:52:34,705 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-18 13:52:34,705 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 13:52:34,705 INFO ]: Found error trace [2018-06-18 13:52:34,705 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:34,705 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:34,706 INFO ]: Analyzing trace with hash -434924750, now seen corresponding path program 4 times [2018-06-18 13:52:34,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:34,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:34,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:34,706 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:52:34,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:34,756 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:34,757 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:52:35,561 WARN ]: Spent 605.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-06-18 13:52:35,752 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:35,752 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:52:35,752 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:35,760 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 13:52:35,800 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 13:52:35,800 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:35,804 INFO ]: Computing forward predicates... [2018-06-18 13:52:36,107 WARN ]: Spent 131.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-06-18 13:52:37,018 WARN ]: Spent 612.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-06-18 13:52:37,330 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:37,351 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:52:37,351 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-18 13:52:37,351 INFO ]: Interpolant automaton has 20 states [2018-06-18 13:52:37,352 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-18 13:52:37,352 INFO ]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-06-18 13:52:37,352 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 20 states. [2018-06-18 13:52:37,892 WARN ]: Spent 501.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2018-06-18 13:52:38,131 WARN ]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 39 [2018-06-18 13:52:38,499 WARN ]: Spent 260.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 33 [2018-06-18 13:52:38,895 WARN ]: Spent 328.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 40 [2018-06-18 13:52:39,127 WARN ]: Spent 206.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2018-06-18 13:52:39,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:52:39,209 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-18 13:52:39,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 13:52:39,209 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-18 13:52:39,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:52:39,209 INFO ]: With dead ends: 21 [2018-06-18 13:52:39,210 INFO ]: Without dead ends: 21 [2018-06-18 13:52:39,210 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-06-18 13:52:39,210 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-18 13:52:39,212 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-18 13:52:39,212 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 13:52:39,213 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-18 13:52:39,213 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2018-06-18 13:52:39,213 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:52:39,213 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-18 13:52:39,213 INFO ]: Interpolant automaton has 20 states. [2018-06-18 13:52:39,213 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-18 13:52:39,214 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 13:52:39,214 INFO ]: Found error trace [2018-06-18 13:52:39,214 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:39,215 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:39,215 INFO ]: Analyzing trace with hash 1986427350, now seen corresponding path program 5 times [2018-06-18 13:52:39,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:39,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:39,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:39,216 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:52:39,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:39,275 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:39,276 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:52:39,535 WARN ]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-06-18 13:52:39,965 WARN ]: Spent 424.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-06-18 13:52:40,828 WARN ]: Spent 820.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-06-18 13:52:41,244 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:52:41,244 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:52:41,244 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:52:41,259 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-18 13:52:41,336 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-18 13:52:41,337 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:41,343 INFO ]: Computing forward predicates... [2018-06-18 13:52:41,897 WARN ]: Spent 170.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2018-06-18 13:52:42,199 WARN ]: Spent 190.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-06-18 13:52:44,753 WARN ]: Spent 874.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2018-06-18 13:52:46,591 WARN ]: Spent 1.44 s on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2018-06-18 13:52:47,100 INFO ]: Checked inductivity of 55 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-18 13:52:47,121 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:52:47,121 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-06-18 13:52:47,121 INFO ]: Interpolant automaton has 25 states [2018-06-18 13:52:47,121 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-18 13:52:47,122 INFO ]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2018-06-18 13:52:47,122 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 25 states. [2018-06-18 13:52:51,584 WARN ]: Spent 4.36 s on a formula simplification. DAG size of input: 170 DAG size of output: 136 [2018-06-18 13:52:52,222 WARN ]: Spent 404.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 51 [2018-06-18 13:52:52,604 WARN ]: Spent 316.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 52 [2018-06-18 13:52:53,362 WARN ]: Spent 566.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 41 [2018-06-18 13:52:53,684 WARN ]: Spent 231.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 40 [2018-06-18 13:52:54,186 WARN ]: Spent 413.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 52 [2018-06-18 13:52:55,667 WARN ]: Spent 1.39 s on a formula simplification. DAG size of input: 170 DAG size of output: 121 [2018-06-18 13:52:55,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:52:55,742 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-18 13:52:55,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-18 13:52:55,743 INFO ]: Start accepts. Automaton has 25 states. Word has length 29 [2018-06-18 13:52:55,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:52:55,744 INFO ]: With dead ends: 25 [2018-06-18 13:52:55,744 INFO ]: Without dead ends: 25 [2018-06-18 13:52:55,745 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2018-06-18 13:52:55,745 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 13:52:55,748 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-18 13:52:55,748 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 13:52:55,749 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-18 13:52:55,749 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 29 [2018-06-18 13:52:55,749 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:52:55,749 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-18 13:52:55,749 INFO ]: Interpolant automaton has 25 states. [2018-06-18 13:52:55,749 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-18 13:52:55,750 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-18 13:52:55,750 INFO ]: Found error trace [2018-06-18 13:52:55,750 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:52:55,750 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:52:55,751 INFO ]: Analyzing trace with hash -411423458, now seen corresponding path program 6 times [2018-06-18 13:52:55,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:52:55,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:52:55,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:55,751 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:52:55,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:52:55,793 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:55,794 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:52:56,670 WARN ]: Spent 653.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-06-18 13:52:57,139 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:52:57,139 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:52:57,167 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:52:57,173 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-18 13:52:57,234 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-18 13:52:57,234 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:52:57,240 INFO ]: Computing forward predicates... [2018-06-18 13:52:57,994 WARN ]: Spent 123.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-06-18 13:52:58,563 WARN ]: Spent 332.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-06-18 13:52:59,042 WARN ]: Spent 225.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-06-18 13:53:00,488 WARN ]: Spent 262.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-06-18 13:53:00,557 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:53:00,579 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:53:00,579 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-06-18 13:53:00,579 INFO ]: Interpolant automaton has 33 states [2018-06-18 13:53:00,579 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-18 13:53:00,580 INFO ]: CoverageRelationStatistics Valid=68, Invalid=988, Unknown=0, NotChecked=0, Total=1056 [2018-06-18 13:53:00,580 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 33 states. [2018-06-18 13:53:02,409 WARN ]: Spent 1.63 s on a formula simplification. DAG size of input: 186 DAG size of output: 109 [2018-06-18 13:53:02,925 WARN ]: Spent 362.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 51 [2018-06-18 13:53:03,563 WARN ]: Spent 579.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 45 [2018-06-18 13:53:04,654 WARN ]: Spent 617.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 48 [2018-06-18 13:53:05,501 WARN ]: Spent 755.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 73 [2018-06-18 13:53:05,936 WARN ]: Spent 340.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 81 [2018-06-18 13:53:06,406 WARN ]: Spent 364.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 72 [2018-06-18 13:53:07,412 WARN ]: Spent 904.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 96 [2018-06-18 13:53:07,481 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:53:07,482 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-18 13:53:07,482 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 13:53:07,482 INFO ]: Start accepts. Automaton has 33 states. Word has length 37 [2018-06-18 13:53:07,483 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:53:07,483 INFO ]: With dead ends: 27 [2018-06-18 13:53:07,483 INFO ]: Without dead ends: 27 [2018-06-18 13:53:07,484 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2018-06-18 13:53:07,484 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 13:53:07,490 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-18 13:53:07,490 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 13:53:07,496 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-18 13:53:07,496 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 37 [2018-06-18 13:53:07,496 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:53:07,496 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-18 13:53:07,496 INFO ]: Interpolant automaton has 33 states. [2018-06-18 13:53:07,496 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-18 13:53:07,497 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-18 13:53:07,497 INFO ]: Found error trace [2018-06-18 13:53:07,497 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:53:07,497 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:53:07,498 INFO ]: Analyzing trace with hash -544278078, now seen corresponding path program 7 times [2018-06-18 13:53:07,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:53:07,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:53:07,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:53:07,498 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:53:07,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:53:07,542 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:53:07,552 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:53:07,848 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-18 13:53:08,144 INFO ]: Checked inductivity of 136 backedges. 1 proven. 99 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-18 13:53:08,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:53:08,144 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:53:08,153 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:53:08,208 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:53:08,214 INFO ]: Computing forward predicates... [2018-06-18 13:53:08,804 WARN ]: Spent 162.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-06-18 13:53:09,097 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-06-18 13:53:09,851 INFO ]: Checked inductivity of 136 backedges. 2 proven. 96 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-18 13:53:09,872 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:53:09,873 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2018-06-18 13:53:09,873 INFO ]: Interpolant automaton has 35 states [2018-06-18 13:53:09,873 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-18 13:53:09,874 INFO ]: CoverageRelationStatistics Valid=90, Invalid=1100, Unknown=0, NotChecked=0, Total=1190 [2018-06-18 13:53:09,874 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 35 states. [2018-06-18 13:53:10,206 WARN ]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2018-06-18 13:53:10,578 WARN ]: Spent 255.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2018-06-18 13:53:10,718 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 33 [2018-06-18 13:53:10,973 WARN ]: Spent 120.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 39 [2018-06-18 13:53:11,111 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 36 [2018-06-18 13:53:11,386 WARN ]: Spent 176.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 [2018-06-18 13:53:11,616 WARN ]: Spent 197.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 45 [2018-06-18 13:53:11,806 WARN ]: Spent 135.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2018-06-18 13:53:12,015 WARN ]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2018-06-18 13:53:12,057 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:53:12,057 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-18 13:53:12,057 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-18 13:53:12,057 INFO ]: Start accepts. Automaton has 35 states. Word has length 41 [2018-06-18 13:53:12,057 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:53:12,058 INFO ]: With dead ends: 29 [2018-06-18 13:53:12,058 INFO ]: Without dead ends: 29 [2018-06-18 13:53:12,058 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=284, Invalid=1696, Unknown=0, NotChecked=0, Total=1980 [2018-06-18 13:53:12,058 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 13:53:12,062 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-18 13:53:12,062 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 13:53:12,062 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-18 13:53:12,062 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 41 [2018-06-18 13:53:12,063 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:53:12,063 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-18 13:53:12,063 INFO ]: Interpolant automaton has 35 states. [2018-06-18 13:53:12,063 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-18 13:53:12,064 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-18 13:53:12,064 INFO ]: Found error trace [2018-06-18 13:53:12,064 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:53:12,064 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:53:12,064 INFO ]: Analyzing trace with hash 1442343014, now seen corresponding path program 8 times [2018-06-18 13:53:12,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:53:12,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:53:12,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:53:12,065 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:53:12,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:53:12,110 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:53:12,111 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:53:13,399 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-18 13:53:13,748 INFO ]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-18 13:53:13,748 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:53:13,748 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:53:13,755 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 13:53:13,819 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:53:13,819 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:53:13,833 INFO ]: Computing forward predicates... [2018-06-18 13:53:15,401 WARN ]: Spent 533.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-06-18 13:53:15,583 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-06-18 13:53:15,965 WARN ]: Spent 197.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2018-06-18 13:53:16,299 WARN ]: Spent 224.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2018-06-18 13:53:16,733 WARN ]: Spent 314.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2018-06-18 13:53:17,270 WARN ]: Spent 418.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2018-06-18 13:53:18,084 WARN ]: Spent 628.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2018-06-18 13:53:19,092 INFO ]: Checked inductivity of 171 backedges. 1 proven. 125 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-18 13:53:19,116 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:53:19,117 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-06-18 13:53:19,117 INFO ]: Interpolant automaton has 41 states [2018-06-18 13:53:19,117 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-18 13:53:19,117 INFO ]: CoverageRelationStatistics Valid=85, Invalid=1555, Unknown=0, NotChecked=0, Total=1640 [2018-06-18 13:53:19,118 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2018-06-18 13:53:19,738 WARN ]: Spent 465.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 100 [2018-06-18 13:53:20,131 WARN ]: Spent 226.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 48 [2018-06-18 13:53:20,566 WARN ]: Spent 346.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 42 [2018-06-18 13:53:20,905 WARN ]: Spent 254.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 46 [2018-06-18 13:53:21,270 WARN ]: Spent 272.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 43 [2018-06-18 13:53:21,638 WARN ]: Spent 242.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 52 [2018-06-18 13:53:22,418 WARN ]: Spent 692.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 51 [2018-06-18 13:53:22,781 WARN ]: Spent 273.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 52 [2018-06-18 13:53:23,427 WARN ]: Spent 452.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 51 [2018-06-18 13:53:23,997 WARN ]: Spent 448.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 92 [2018-06-18 13:53:24,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:53:24,083 INFO ]: Finished difference Result 31 states and 32 transitions. [2018-06-18 13:53:24,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-18 13:53:24,086 INFO ]: Start accepts. Automaton has 41 states. Word has length 45 [2018-06-18 13:53:24,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:53:24,087 INFO ]: With dead ends: 31 [2018-06-18 13:53:24,087 INFO ]: Without dead ends: 31 [2018-06-18 13:53:24,088 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=343, Invalid=2309, Unknown=0, NotChecked=0, Total=2652 [2018-06-18 13:53:24,088 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-18 13:53:24,096 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-18 13:53:24,096 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-18 13:53:24,097 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-18 13:53:24,097 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 45 [2018-06-18 13:53:24,097 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:53:24,097 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-18 13:53:24,097 INFO ]: Interpolant automaton has 41 states. [2018-06-18 13:53:24,097 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-18 13:53:24,098 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-18 13:53:24,098 INFO ]: Found error trace [2018-06-18 13:53:24,099 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:53:24,100 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:53:24,100 INFO ]: Analyzing trace with hash 352352522, now seen corresponding path program 9 times [2018-06-18 13:53:24,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:53:24,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:53:24,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:53:24,101 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:53:24,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:53:24,139 INFO ]: Conjunction of SSA is sat [2018-06-18 13:53:24,143 INFO ]: Counterexample might be feasible [2018-06-18 13:53:24,165 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 01:53:24 BoogieIcfgContainer [2018-06-18 13:53:24,165 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 13:53:24,166 INFO ]: Toolchain (without parser) took 59671.05 ms. Allocated memory was 308.3 MB in the beginning and 591.9 MB in the end (delta: 283.6 MB). Free memory was 262.7 MB in the beginning and 179.7 MB in the end (delta: 83.0 MB). Peak memory consumption was 366.6 MB. Max. memory is 3.6 GB. [2018-06-18 13:53:24,167 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 13:53:24,167 INFO ]: ChcToBoogie took 71.92 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 258.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:53:24,167 INFO ]: Boogie Preprocessor took 49.69 ms. Allocated memory is still 308.3 MB. Free memory is still 258.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 13:53:24,168 INFO ]: RCFGBuilder took 283.88 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 246.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:53:24,168 INFO ]: TraceAbstraction took 59256.34 ms. Allocated memory was 308.3 MB in the beginning and 591.9 MB in the end (delta: 283.6 MB). Free memory was 246.7 MB in the beginning and 179.7 MB in the end (delta: 67.0 MB). Peak memory consumption was 350.7 MB. Max. memory is 3.6 GB. [2018-06-18 13:53:24,174 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 71.92 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 258.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 49.69 ms. Allocated memory is still 308.3 MB. Free memory is still 258.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 283.88 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 246.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59256.34 ms. Allocated memory was 308.3 MB in the beginning and 591.9 MB in the end (delta: 283.6 MB). Free memory was 246.7 MB in the beginning and 179.7 MB in the end (delta: 67.0 MB). Peak memory consumption was 350.7 MB. 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_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_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_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_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_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_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))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_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_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_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_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_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))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_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_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_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_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_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))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_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_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_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_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_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))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_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_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_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_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_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))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_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_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_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_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_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))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_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_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_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_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_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))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_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_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_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_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_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))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_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_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_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_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_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))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_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_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_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_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_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))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_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_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_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, 59.1s OverallTime, 10 OverallIterations, 11 TraceHistogramMax, 28.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 119 SDtfs, 563 SDslu, 1227 SDs, 0 SdLazy, 1080 SolverSat, 666 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 154 SyntacticMatches, 3 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 46.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 514 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 298848 SizeOfPredicates, 373 NumberOfNonLiveVariables, 2279 ConjunctsInSsa, 618 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 295/1074 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.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_13-53-24-188.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/_6counters.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_13-53-24-188.csv Received shutdown request...