java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 13:48:14,939 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 13:48:14,941 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 13:48:14,956 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 13:48:14,956 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 13:48:14,957 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 13:48:14,958 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 13:48:14,960 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 13:48:14,962 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 13:48:14,962 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 13:48:14,963 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 13:48:14,963 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 13:48:14,964 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 13:48:14,968 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 13:48:14,969 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 13:48:14,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 13:48:14,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 13:48:14,985 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 13:48:14,987 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 13:48:14,988 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 13:48:14,989 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 13:48:14,991 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 13:48:14,991 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 13:48:14,991 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 13:48:14,992 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 13:48:14,996 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 13:48:14,996 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 13:48:14,997 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 13:48:14,998 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 13:48:14,998 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 13:48:14,999 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 13:48:14,999 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 13:48:14,999 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 13:48:15,000 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 13:48:15,001 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 13:48:15,001 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 13:48:15,017 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 13:48:15,018 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 13:48:15,018 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 13:48:15,018 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 13:48:15,019 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 13:48:15,019 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 13:48:15,020 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 13:48:15,020 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 13:48:15,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 13:48:15,020 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 13:48:15,020 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 13:48:15,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 13:48:15,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 13:48:15,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 13:48:15,021 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 13:48:15,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 13:48:15,021 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 13:48:15,028 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 13:48:15,028 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 13:48:15,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 13:48:15,028 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 13:48:15,030 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 13:48:15,030 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 13:48:15,087 INFO ]: Repository-Root is: /tmp [2018-06-25 13:48:15,101 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 13:48:15,110 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 13:48:15,112 INFO ]: Initializing SmtParser... [2018-06-25 13:48:15,112 INFO ]: SmtParser initialized [2018-06-25 13:48:15,113 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 [2018-06-25 13:48:15,114 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-25 13:48:15,199 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 unknown [2018-06-25 13:48:15,429 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 [2018-06-25 13:48:15,434 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 13:48:15,439 INFO ]: Walking toolchain with 4 elements. [2018-06-25 13:48:15,440 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 13:48:15,440 INFO ]: Initializing ChcToBoogie... [2018-06-25 13:48:15,440 INFO ]: ChcToBoogie initialized [2018-06-25 13:48:15,443 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:48:15" (1/1) ... [2018-06-25 13:48:15,515 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:48:15 Unit [2018-06-25 13:48:15,515 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 13:48:15,516 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 13:48:15,516 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 13:48:15,516 INFO ]: Boogie Preprocessor initialized [2018-06-25 13:48:15,541 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:48:15" (1/1) ... [2018-06-25 13:48:15,542 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:48:15" (1/1) ... [2018-06-25 13:48:15,550 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:48:15" (1/1) ... [2018-06-25 13:48:15,550 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:48:15" (1/1) ... [2018-06-25 13:48:15,554 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:48:15" (1/1) ... [2018-06-25 13:48:15,556 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:48:15" (1/1) ... [2018-06-25 13:48:15,557 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:48:15" (1/1) ... [2018-06-25 13:48:15,559 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 13:48:15,559 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 13:48:15,559 INFO ]: Initializing RCFGBuilder... [2018-06-25 13:48:15,559 INFO ]: RCFGBuilder initialized [2018-06-25 13:48:15,560 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:48:15" (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-25 13:48:15,592 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 13:48:15,592 INFO ]: Found specification of procedure gotoProc [2018-06-25 13:48:15,592 INFO ]: Found implementation of procedure gotoProc [2018-06-25 13:48:15,592 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 13:48:15,592 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 13:48:15,592 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-25 13:48:15,887 INFO ]: Using library mode [2018-06-25 13:48:15,887 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:48:15 BoogieIcfgContainer [2018-06-25 13:48:15,887 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 13:48:15,888 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 13:48:15,888 INFO ]: Initializing TraceAbstraction... [2018-06-25 13:48:15,896 INFO ]: TraceAbstraction initialized [2018-06-25 13:48:15,896 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:48:15" (1/3) ... [2018-06-25 13:48:15,897 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d00b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 01:48:15, skipping insertion in model container [2018-06-25 13:48:15,897 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:48:15" (2/3) ... [2018-06-25 13:48:15,897 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d00b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 01:48:15, skipping insertion in model container [2018-06-25 13:48:15,897 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:48:15" (3/3) ... [2018-06-25 13:48:15,899 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 13:48:15,919 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 13:48:15,930 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 13:48:15,987 INFO ]: Using default assertion order modulation [2018-06-25 13:48:15,987 INFO ]: Interprodecural is true [2018-06-25 13:48:15,987 INFO ]: Hoare is false [2018-06-25 13:48:15,987 INFO ]: Compute interpolants for FPandBP [2018-06-25 13:48:15,987 INFO ]: Backedges is TWOTRACK [2018-06-25 13:48:15,987 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 13:48:15,987 INFO ]: Difference is false [2018-06-25 13:48:15,988 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 13:48:15,988 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 13:48:16,007 INFO ]: Start isEmpty. Operand 10 states. [2018-06-25 13:48:16,022 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 13:48:16,022 INFO ]: Found error trace [2018-06-25 13:48:16,025 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 13:48:16,026 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 13:48:16,032 INFO ]: Analyzing trace with hash 1285054476, now seen corresponding path program 1 times [2018-06-25 13:48:16,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 13:48:16,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 13:48:16,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 13:48:16,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 13:48:16,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 13:48:16,155 INFO ]: Conjunction of SSA is unsat [2018-06-25 13:48:16,313 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 13:48:16,315 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 13:48:16,315 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 13:48:16,316 INFO ]: Interpolant automaton has 3 states [2018-06-25 13:48:16,328 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 13:48:16,329 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 13:48:16,332 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-25 13:48:16,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 13:48:16,398 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-25 13:48:16,399 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 13:48:16,400 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 13:48:16,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 13:48:16,412 INFO ]: With dead ends: 9 [2018-06-25 13:48:16,412 INFO ]: Without dead ends: 9 [2018-06-25 13:48:16,414 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 13:48:16,429 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 13:48:16,444 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 13:48:16,445 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 13:48:16,446 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-25 13:48:16,447 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-25 13:48:16,447 INFO ]: Finished accepts. word is rejected. [2018-06-25 13:48:16,447 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-25 13:48:16,447 INFO ]: Interpolant automaton has 3 states. [2018-06-25 13:48:16,447 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-25 13:48:16,448 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 13:48:16,448 INFO ]: Found error trace [2018-06-25 13:48:16,448 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 13:48:16,448 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 13:48:16,448 INFO ]: Analyzing trace with hash 1180100628, now seen corresponding path program 1 times [2018-06-25 13:48:16,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 13:48:16,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 13:48:16,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 13:48:16,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 13:48:16,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 13:48:16,486 INFO ]: Conjunction of SSA is unsat [2018-06-25 13:48:16,825 WARN ]: Spent 220.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-06-25 13:48:16,841 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 13:48:16,841 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 13:48:16,841 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-25 13:48:16,853 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 13:48:16,913 INFO ]: Conjunction of SSA is unsat [2018-06-25 13:48:16,922 INFO ]: Computing forward predicates... [2018-06-25 13:48:17,030 WARN ]: expecting exponential blowup for input size 9 [2018-06-25 13:48:17,329 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 13:48:17,351 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 13:48:17,351 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 13:48:17,351 INFO ]: Interpolant automaton has 6 states [2018-06-25 13:48:17,351 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 13:48:17,352 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 13:48:17,352 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-06-25 13:48:17,475 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 13:48:17,476 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-25 13:48:17,481 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 13:48:17,481 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-25 13:48:17,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 13:48:17,482 INFO ]: With dead ends: 11 [2018-06-25 13:48:17,482 INFO ]: Without dead ends: 11 [2018-06-25 13:48:17,482 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 13:48:17,483 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 13:48:17,484 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 13:48:17,484 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 13:48:17,484 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-25 13:48:17,484 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-06-25 13:48:17,484 INFO ]: Finished accepts. word is rejected. [2018-06-25 13:48:17,484 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-25 13:48:17,484 INFO ]: Interpolant automaton has 6 states. [2018-06-25 13:48:17,484 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-25 13:48:17,485 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 13:48:17,485 INFO ]: Found error trace [2018-06-25 13:48:17,485 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 13:48:17,485 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 13:48:17,485 INFO ]: Analyzing trace with hash 145098516, now seen corresponding path program 2 times [2018-06-25 13:48:17,485 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 13:48:17,485 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 13:48:17,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 13:48:17,486 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 13:48:17,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 13:48:17,574 INFO ]: Conjunction of SSA is unsat [2018-06-25 13:48:17,813 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 13:48:17,813 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 13:48:17,813 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 13:48:17,833 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 13:48:17,911 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 13:48:17,911 INFO ]: Conjunction of SSA is unsat [2018-06-25 13:48:17,915 INFO ]: Computing forward predicates... [2018-06-25 13:48:18,667 WARN ]: Spent 477.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 18 [2018-06-25 13:48:18,883 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 13:48:18,917 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 13:48:18,917 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-25 13:48:18,917 INFO ]: Interpolant automaton has 10 states [2018-06-25 13:48:18,917 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 13:48:18,917 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-25 13:48:18,917 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-06-25 13:48:19,454 WARN ]: Spent 307.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2018-06-25 13:48:19,583 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 13:48:19,583 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-25 13:48:19,583 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 13:48:19,583 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-25 13:48:19,584 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 13:48:19,584 INFO ]: With dead ends: 13 [2018-06-25 13:48:19,584 INFO ]: Without dead ends: 13 [2018-06-25 13:48:19,584 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-06-25 13:48:19,585 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 13:48:19,586 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 13:48:19,586 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 13:48:19,586 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-25 13:48:19,586 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-06-25 13:48:19,586 INFO ]: Finished accepts. word is rejected. [2018-06-25 13:48:19,586 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-25 13:48:19,586 INFO ]: Interpolant automaton has 10 states. [2018-06-25 13:48:19,586 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-25 13:48:19,587 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 13:48:19,587 INFO ]: Found error trace [2018-06-25 13:48:19,587 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 13:48:19,587 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 13:48:19,587 INFO ]: Analyzing trace with hash 1940481556, now seen corresponding path program 3 times [2018-06-25 13:48:19,587 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 13:48:19,587 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 13:48:19,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 13:48:19,588 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 13:48:19,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 13:48:19,626 INFO ]: Conjunction of SSA is sat [2018-06-25 13:48:19,629 INFO ]: Counterexample might be feasible [2018-06-25 13:48:19,646 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:48:19 BoogieIcfgContainer [2018-06-25 13:48:19,647 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 13:48:19,648 INFO ]: Toolchain (without parser) took 4213.19 ms. Allocated memory was 309.3 MB in the beginning and 328.2 MB in the end (delta: 18.9 MB). Free memory was 262.7 MB in the beginning and 224.9 MB in the end (delta: 37.8 MB). Peak memory consumption was 56.7 MB. Max. memory is 3.6 GB. [2018-06-25 13:48:19,648 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 13:48:19,649 INFO ]: ChcToBoogie took 75.47 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 13:48:19,649 INFO ]: Boogie Preprocessor took 43.13 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 259.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 13:48:19,650 INFO ]: RCFGBuilder took 327.78 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 247.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-25 13:48:19,650 INFO ]: TraceAbstraction took 3758.20 ms. Allocated memory was 309.3 MB in the beginning and 328.2 MB in the end (delta: 18.9 MB). Free memory was 247.7 MB in the beginning and 224.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 41.7 MB. Max. memory is 3.6 GB. [2018-06-25 13:48:19,653 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 75.47 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.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 43.13 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 259.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 327.78 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 247.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3758.20 ms. Allocated memory was 309.3 MB in the beginning and 328.2 MB in the end (delta: 18.9 MB). Free memory was 247.7 MB in the beginning and 224.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 41.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 gotoProc(0, false, false, false, 0, false, false, false, false, 0, false, false, false, false, false, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] assume !hbv_False_1_Bool; [L0] hhv_state_0_Bool, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Int, hhv_state_4_Bool, hhv_state_5_Bool, hhv_state_6_Bool, hhv_state_7_Bool, hhv_state_8_Int, hhv_state_9_Bool, hhv_state_10_Bool, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Bool, hhv_state_14_Int := 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] havoc hbv_False_1_Bool, hbv_False_4_Bool, hbv_False_2_Bool, hbv_False_11_Bool, hbv_False_3_Bool, hbv_False_5_Int, hbv_False_7_Bool, hbv_False_6_Bool, hbv_False_14_Bool, hbv_False_10_Int, hbv_False_9_Bool, hbv_False_15_Int, hbv_False_13_Bool, hbv_False_8_Bool, hbv_False_12_Bool; [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] hhv_state_0_Bool, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Int, hhv_state_4_Bool, hhv_state_5_Bool, hhv_state_6_Bool, hhv_state_7_Bool, hhv_state_8_Int, hhv_state_9_Bool, hhv_state_10_Bool, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Bool, hhv_state_14_Int := hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int; [L0] havoc hbv_state_13_Bool, hbv_state_6_Bool, hbv_state_8_Bool, hbv_state_14_Bool, hbv_state_1_Int, hbv_state_5_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_9_Bool, hbv_state_2_Bool, hbv_state_10_Bool, hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_12_Bool, hbv_state_15_Int; [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] hhv_state_0_Bool, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Int, hhv_state_4_Bool, hhv_state_5_Bool, hhv_state_6_Bool, hhv_state_7_Bool, hhv_state_8_Int, hhv_state_9_Bool, hhv_state_10_Bool, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Bool, hhv_state_14_Int := hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int; [L0] havoc hbv_state_13_Bool, hbv_state_6_Bool, hbv_state_8_Bool, hbv_state_14_Bool, hbv_state_1_Int, hbv_state_5_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_9_Bool, hbv_state_2_Bool, hbv_state_10_Bool, hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_12_Bool, hbv_state_15_Int; [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] hhv_state_0_Bool, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Int, hhv_state_4_Bool, hhv_state_5_Bool, hhv_state_6_Bool, hhv_state_7_Bool, hhv_state_8_Int, hhv_state_9_Bool, hhv_state_10_Bool, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Bool, hhv_state_14_Int := hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int; [L0] havoc hbv_state_13_Bool, hbv_state_6_Bool, hbv_state_8_Bool, hbv_state_14_Bool, hbv_state_1_Int, hbv_state_5_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_9_Bool, hbv_state_2_Bool, hbv_state_10_Bool, hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_12_Bool, hbv_state_15_Int; [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] hhv_state_0_Bool, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Int, hhv_state_4_Bool, hhv_state_5_Bool, hhv_state_6_Bool, hhv_state_7_Bool, hhv_state_8_Int, hhv_state_9_Bool, hhv_state_10_Bool, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Bool, hhv_state_14_Int := hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int; [L0] havoc hbv_state_13_Bool, hbv_state_6_Bool, hbv_state_8_Bool, hbv_state_14_Bool, hbv_state_1_Int, hbv_state_5_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_9_Bool, hbv_state_2_Bool, hbv_state_10_Bool, hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_12_Bool, hbv_state_15_Int; [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] hhv_state_0_Bool, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Int, hhv_state_4_Bool, hhv_state_5_Bool, hhv_state_6_Bool, hhv_state_7_Bool, hhv_state_8_Int, hhv_state_9_Bool, hhv_state_10_Bool, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Bool, hhv_state_14_Int := hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int; [L0] havoc hbv_state_13_Bool, hbv_state_6_Bool, hbv_state_8_Bool, hbv_state_14_Bool, hbv_state_1_Int, hbv_state_5_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_9_Bool, hbv_state_2_Bool, hbv_state_10_Bool, hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_12_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 gotoProc(0, false, false, false, 0, false, false, false, false, 0, false, false, false, false, false, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. UNSAFE Result, 3.6s OverallTime, 4 OverallIterations, 5 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21 SDtfs, 0 SDslu, 50 SDs, 0 SdLazy, 34 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=3, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 969 SizeOfPredicates, 4 NumberOfNonLiveVariables, 306 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/_6counters_e8_371_e7_304.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_13-48-19-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/_6counters_e8_371_e7_304.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_13-48-19-666.csv Received shutdown request...