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/durationThm_3_e7_201.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 15:02:56,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 15:02:56,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 15:02:56,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 15:02:56,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 15:02:56,171 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 15:02:56,172 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 15:02:56,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 15:02:56,178 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 15:02:56,178 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 15:02:56,180 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 15:02:56,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 15:02:56,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 15:02:56,182 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 15:02:56,183 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 15:02:56,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 15:02:56,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 15:02:56,196 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 15:02:56,198 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 15:02:56,199 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 15:02:56,200 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 15:02:56,206 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 15:02:56,206 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 15:02:56,206 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 15:02:56,207 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 15:02:56,208 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 15:02:56,209 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 15:02:56,212 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 15:02:56,213 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 15:02:56,213 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 15:02:56,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 15:02:56,214 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 15:02:56,214 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 15:02:56,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 15:02:56,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 15:02:56,218 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 15:02:56,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 15:02:56,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 15:02:56,241 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 15:02:56,241 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 15:02:56,242 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 15:02:56,242 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 15:02:56,242 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 15:02:56,243 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 15:02:56,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 15:02:56,243 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 15:02:56,243 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 15:02:56,243 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 15:02:56,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 15:02:56,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 15:02:56,245 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 15:02:56,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 15:02:56,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 15:02:56,247 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 15:02:56,247 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 15:02:56,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 15:02:56,247 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 15:02:56,249 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 15:02:56,249 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 15:02:56,292 INFO ]: Repository-Root is: /tmp [2018-06-25 15:02:56,307 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 15:02:56,310 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 15:02:56,311 INFO ]: Initializing SmtParser... [2018-06-25 15:02:56,311 INFO ]: SmtParser initialized [2018-06-25 15:02:56,312 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/durationThm_3_e7_201.smt2 [2018-06-25 15:02:56,313 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 15:02:56,405 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/durationThm_3_e7_201.smt2 unknown [2018-06-25 15:02:56,671 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/durationThm_3_e7_201.smt2 [2018-06-25 15:02:56,676 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 15:02:56,681 INFO ]: Walking toolchain with 4 elements. [2018-06-25 15:02:56,681 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 15:02:56,681 INFO ]: Initializing ChcToBoogie... [2018-06-25 15:02:56,682 INFO ]: ChcToBoogie initialized [2018-06-25 15:02:56,685 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:02:56" (1/1) ... [2018-06-25 15:02:56,738 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:02:56 Unit [2018-06-25 15:02:56,738 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 15:02:56,739 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 15:02:56,739 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 15:02:56,739 INFO ]: Boogie Preprocessor initialized [2018-06-25 15:02:56,756 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:02:56" (1/1) ... [2018-06-25 15:02:56,756 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:02:56" (1/1) ... [2018-06-25 15:02:56,762 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:02:56" (1/1) ... [2018-06-25 15:02:56,762 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:02:56" (1/1) ... [2018-06-25 15:02:56,767 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:02:56" (1/1) ... [2018-06-25 15:02:56,768 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:02:56" (1/1) ... [2018-06-25 15:02:56,769 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:02:56" (1/1) ... [2018-06-25 15:02:56,771 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 15:02:56,772 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 15:02:56,772 INFO ]: Initializing RCFGBuilder... [2018-06-25 15:02:56,772 INFO ]: RCFGBuilder initialized [2018-06-25 15:02:56,773 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:02:56" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 15:02:56,787 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 15:02:56,787 INFO ]: Found specification of procedure gotoProc [2018-06-25 15:02:56,787 INFO ]: Found implementation of procedure gotoProc [2018-06-25 15:02:56,787 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 15:02:56,787 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 15:02:56,787 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 15:02:57,069 INFO ]: Using library mode [2018-06-25 15:02:57,069 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:02:57 BoogieIcfgContainer [2018-06-25 15:02:57,069 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 15:02:57,071 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 15:02:57,071 INFO ]: Initializing TraceAbstraction... [2018-06-25 15:02:57,081 INFO ]: TraceAbstraction initialized [2018-06-25 15:02:57,086 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:02:56" (1/3) ... [2018-06-25 15:02:57,087 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6179566f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 03:02:57, skipping insertion in model container [2018-06-25 15:02:57,087 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:02:56" (2/3) ... [2018-06-25 15:02:57,087 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6179566f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 03:02:57, skipping insertion in model container [2018-06-25 15:02:57,087 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:02:57" (3/3) ... [2018-06-25 15:02:57,089 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 15:02:57,098 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 15:02:57,105 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 15:02:57,139 INFO ]: Using default assertion order modulation [2018-06-25 15:02:57,140 INFO ]: Interprodecural is true [2018-06-25 15:02:57,140 INFO ]: Hoare is false [2018-06-25 15:02:57,140 INFO ]: Compute interpolants for FPandBP [2018-06-25 15:02:57,140 INFO ]: Backedges is TWOTRACK [2018-06-25 15:02:57,140 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 15:02:57,140 INFO ]: Difference is false [2018-06-25 15:02:57,140 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 15:02:57,140 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 15:02:57,152 INFO ]: Start isEmpty. Operand 10 states. [2018-06-25 15:02:57,163 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 15:02:57,163 INFO ]: Found error trace [2018-06-25 15:02:57,167 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 15:02:57,167 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 15:02:57,172 INFO ]: Analyzing trace with hash 1285054476, now seen corresponding path program 1 times [2018-06-25 15:02:57,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 15:02:57,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 15:02:57,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 15:02:57,214 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 15:02:57,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 15:02:57,275 INFO ]: Conjunction of SSA is unsat [2018-06-25 15:02:57,431 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 15:02:57,433 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 15:02:57,433 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 15:02:57,434 INFO ]: Interpolant automaton has 3 states [2018-06-25 15:02:57,444 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 15:02:57,445 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 15:02:57,447 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-25 15:02:57,500 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 15:02:57,500 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-25 15:02:57,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 15:02:57,502 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 15:02:57,502 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 15:02:57,509 INFO ]: With dead ends: 9 [2018-06-25 15:02:57,509 INFO ]: Without dead ends: 9 [2018-06-25 15:02:57,510 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 15:02:57,522 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 15:02:57,546 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 15:02:57,548 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 15:02:57,548 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-25 15:02:57,549 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-25 15:02:57,549 INFO ]: Finished accepts. word is rejected. [2018-06-25 15:02:57,549 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-25 15:02:57,549 INFO ]: Interpolant automaton has 3 states. [2018-06-25 15:02:57,549 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-25 15:02:57,550 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 15:02:57,550 INFO ]: Found error trace [2018-06-25 15:02:57,550 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 15:02:57,550 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 15:02:57,551 INFO ]: Analyzing trace with hash 1180100628, now seen corresponding path program 1 times [2018-06-25 15:02:57,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 15:02:57,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 15:02:57,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 15:02:57,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 15:02:57,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 15:02:57,604 INFO ]: Conjunction of SSA is unsat [2018-06-25 15:02:57,897 WARN ]: Spent 146.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2018-06-25 15:02:57,899 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 15:02:57,899 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 15:02:57,899 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) [2018-06-25 15:02:57,915 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 15:02:57,998 INFO ]: Conjunction of SSA is unsat [2018-06-25 15:02:58,010 INFO ]: Computing forward predicates... [2018-06-25 15:02:58,801 WARN ]: Spent 428.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-06-25 15:02:58,817 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 15:02:58,840 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 15:02:58,840 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 15:02:58,841 INFO ]: Interpolant automaton has 5 states [2018-06-25 15:02:58,841 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 15:02:58,841 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 15:02:58,841 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-06-25 15:02:59,217 WARN ]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-25 15:02:59,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 15:02:59,263 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-25 15:02:59,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 15:02:59,264 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 15:02:59,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 15:02:59,264 INFO ]: With dead ends: 10 [2018-06-25 15:02:59,264 INFO ]: Without dead ends: 10 [2018-06-25 15:02:59,265 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 15:02:59,265 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 15:02:59,266 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 15:02:59,266 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 15:02:59,267 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-25 15:02:59,267 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-25 15:02:59,267 INFO ]: Finished accepts. word is rejected. [2018-06-25 15:02:59,267 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-25 15:02:59,267 INFO ]: Interpolant automaton has 5 states. [2018-06-25 15:02:59,267 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-25 15:02:59,267 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 15:02:59,267 INFO ]: Found error trace [2018-06-25 15:02:59,267 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 15:02:59,267 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 15:02:59,267 INFO ]: Analyzing trace with hash -2073468660, now seen corresponding path program 2 times [2018-06-25 15:02:59,268 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 15:02:59,268 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 15:02:59,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 15:02:59,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 15:02:59,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 15:02:59,316 INFO ]: Conjunction of SSA is unsat [2018-06-25 15:02:59,939 WARN ]: Spent 433.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-06-25 15:03:00,004 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 15:03:00,004 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 15:03:00,004 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-25 15:03:00,012 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 15:03:00,079 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 15:03:00,079 INFO ]: Conjunction of SSA is unsat [2018-06-25 15:03:00,084 INFO ]: Computing forward predicates... [2018-06-25 15:03:00,850 WARN ]: Spent 418.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-06-25 15:03:01,194 WARN ]: Spent 123.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 16 [2018-06-25 15:03:01,199 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 15:03:01,220 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 15:03:01,221 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 15:03:01,221 INFO ]: Interpolant automaton has 7 states [2018-06-25 15:03:01,221 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 15:03:01,221 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 15:03:01,221 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-25 15:03:01,348 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2018-06-25 15:03:01,461 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 15:03:01,461 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-25 15:03:01,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 15:03:01,462 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-25 15:03:01,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 15:03:01,462 INFO ]: With dead ends: 11 [2018-06-25 15:03:01,462 INFO ]: Without dead ends: 11 [2018-06-25 15:03:01,463 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-25 15:03:01,463 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 15:03:01,464 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 15:03:01,464 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 15:03:01,464 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-25 15:03:01,464 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-25 15:03:01,464 INFO ]: Finished accepts. word is rejected. [2018-06-25 15:03:01,465 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-25 15:03:01,465 INFO ]: Interpolant automaton has 7 states. [2018-06-25 15:03:01,465 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-25 15:03:01,465 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 15:03:01,465 INFO ]: Found error trace [2018-06-25 15:03:01,465 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 15:03:01,465 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 15:03:01,465 INFO ]: Analyzing trace with hash 145098516, now seen corresponding path program 3 times [2018-06-25 15:03:01,465 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 15:03:01,465 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 15:03:01,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 15:03:01,466 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 15:03:01,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 15:03:01,541 INFO ]: Conjunction of SSA is sat [2018-06-25 15:03:01,550 INFO ]: Counterexample might be feasible [2018-06-25 15:03:01,567 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:03:01 BoogieIcfgContainer [2018-06-25 15:03:01,567 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 15:03:01,568 INFO ]: Toolchain (without parser) took 4891.56 ms. Allocated memory was 302.5 MB in the beginning and 342.4 MB in the end (delta: 39.8 MB). Free memory was 256.0 MB in the beginning and 301.7 MB in the end (delta: -45.7 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 15:03:01,569 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 15:03:01,569 INFO ]: ChcToBoogie took 57.35 ms. Allocated memory is still 302.5 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 15:03:01,569 INFO ]: Boogie Preprocessor took 32.28 ms. Allocated memory is still 302.5 MB. Free memory was 253.0 MB in the beginning and 252.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-25 15:03:01,577 INFO ]: RCFGBuilder took 297.53 ms. Allocated memory is still 302.5 MB. Free memory was 252.0 MB in the beginning and 238.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 3.6 GB. [2018-06-25 15:03:01,578 INFO ]: TraceAbstraction took 4496.30 ms. Allocated memory was 302.5 MB in the beginning and 342.4 MB in the end (delta: 39.8 MB). Free memory was 238.9 MB in the beginning and 301.7 MB in the end (delta: -62.8 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 15:03:01,585 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 302.5 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 57.35 ms. Allocated memory is still 302.5 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 32.28 ms. Allocated memory is still 302.5 MB. Free memory was 253.0 MB in the beginning and 252.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 297.53 ms. Allocated memory is still 302.5 MB. Free memory was 252.0 MB in the beginning and 238.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4496.30 ms. Allocated memory was 302.5 MB in the beginning and 342.4 MB in the end (delta: 39.8 MB). Free memory was 238.9 MB in the beginning and 301.7 MB in the end (delta: -62.8 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, false, false, 0, 0, 0, 0, false, 0, 0, 0, 0, false, 0, 0, false, false, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] assume !hbv_False_1_Bool; [L0] hhv_state_0_Int, hhv_state_1_Int, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Bool, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Int, hhv_state_12_Int, hhv_state_13_Bool, hhv_state_14_Int, hhv_state_15_Int, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Int, hhv_state_19_Int, hhv_state_20_Int := hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Bool, hbv_False_5_Bool, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Bool, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Int, hbv_False_14_Int, hbv_False_1_Bool, hbv_False_15_Int, hbv_False_16_Int, hbv_False_17_Bool, hbv_False_18_Bool, hbv_False_19_Int, hbv_False_20_Int, hbv_False_21_Int; [L0] havoc hbv_False_17_Bool, hbv_False_5_Bool, hbv_False_13_Int, hbv_False_10_Bool, hbv_False_11_Int, hbv_False_1_Bool, hbv_False_19_Int, hbv_False_18_Bool, hbv_False_8_Int, hbv_False_15_Int, hbv_False_4_Bool, hbv_False_20_Int, hbv_False_3_Int, hbv_False_12_Int, hbv_False_14_Int, hbv_False_9_Int, hbv_False_7_Int, hbv_False_2_Int, hbv_False_16_Int, hbv_False_6_Int, hbv_False_21_Int; [L0] assume ((((((((((((((((((((((((((hbv_state_3_Int == hbv_state_4_Int && hhv_state_12_Int == hhv_state_11_Int) && hbv_state_8_Int == hbv_state_1_Int) && !(hbv_state_12_Bool && !(hbv_state_11_Int + -1 * hhv_state_19_Int == -1))) && hhv_state_6_Int == hhv_state_18_Int) && hhv_state_7_Int == hhv_state_6_Int) && !(!hbv_state_2_Bool && !(hhv_state_18_Int == 0))) && !(((hbv_state_13_Bool || !hbv_state_14_Bool) || hbv_state_1_Int + (-1 * hbv_state_4_Int + -1 * hbv_state_6_Int) <= 0) && ((hbv_state_14_Bool && !(hbv_state_1_Int + (-1 * hbv_state_4_Int + -1 * hbv_state_6_Int) <= 0)) || !hbv_state_13_Bool))) && hbv_state_4_Int == hhv_state_9_Int) && !((hbv_state_14_Bool || hbv_state_9_Bool) && (!hbv_state_14_Bool || !hbv_state_9_Bool))) && hbv_state_10_Int == hbv_state_5_Int) && hhv_state_1_Int == hhv_state_0_Int) && !(!hbv_state_2_Bool && !(hhv_state_20_Int == 0))) && hbv_state_7_Int == hbv_state_6_Int) && !(hbv_state_2_Bool && !(hbv_state_1_Int + -1 * hhv_state_20_Int == -1))) && hhv_state_5_Int == hhv_state_4_Int) && hhv_state_4_Int == hhv_state_19_Int) && !(!hbv_state_12_Bool && !(hhv_state_19_Int == 0))) && !((!hhv_state_8_Bool || !hhv_state_3_Bool) && (hhv_state_8_Bool || hhv_state_3_Bool))) && !((!hbv_state_15_Bool || !hbv_state_9_Bool) && (hbv_state_15_Bool || hbv_state_9_Bool))) && !(((hhv_state_8_Bool && !(hhv_state_1_Int + (-1 * hhv_state_10_Int + -1 * hhv_state_12_Int) <= 0)) || !hhv_state_13_Bool) && ((hhv_state_1_Int + (-1 * hhv_state_10_Int + -1 * hhv_state_12_Int) <= 0 || hhv_state_13_Bool) || !hhv_state_8_Bool))) && hhv_state_0_Int == hhv_state_20_Int) && hbv_state_6_Int == hhv_state_11_Int) && hhv_state_10_Int == hhv_state_9_Int) && !(hbv_state_2_Bool && !(hbv_state_5_Int + -1 * hhv_state_18_Int == -1))) && !((!hhv_state_3_Bool || !hhv_state_2_Bool) && (hhv_state_3_Bool || hhv_state_2_Bool))) && !((((((hhv_state_5_Int <= hhv_state_10_Int && 1 <= hhv_state_12_Int) && 1 <= hhv_state_10_Int) && (!(hhv_state_12_Int <= hhv_state_7_Int) || hhv_state_16_Bool)) || hhv_state_2_Bool) || hbv_state_9_Bool) && ((!hbv_state_9_Bool && (((!(1 <= hhv_state_12_Int) || (!hhv_state_16_Bool && hhv_state_12_Int <= hhv_state_7_Int)) || !(1 <= hhv_state_10_Int)) || !(hhv_state_5_Int <= hhv_state_10_Int))) || !hhv_state_2_Bool))) && hbv_state_16_Int == hbv_state_11_Int; [L0] hhv_state_0_Int, hhv_state_1_Int, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Bool, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Int, hhv_state_12_Int, hhv_state_13_Bool, hhv_state_14_Int, hhv_state_15_Int, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Int, hhv_state_19_Int, hhv_state_20_Int := hbv_state_8_Int, hbv_state_1_Int, hbv_state_15_Bool, hbv_state_9_Bool, hbv_state_16_Int, hbv_state_11_Int, hbv_state_10_Int, hbv_state_5_Int, hbv_state_14_Bool, hbv_state_3_Int, hbv_state_4_Int, hbv_state_7_Int, hbv_state_6_Int, hbv_state_13_Bool, hbv_state_17_Int, hbv_state_18_Int, hbv_state_12_Bool, hbv_state_2_Bool, hbv_state_19_Int, hbv_state_20_Int, hbv_state_21_Int; [L0] havoc hbv_state_13_Bool, hbv_state_17_Int, hbv_state_20_Int, hbv_state_18_Int, hbv_state_6_Int, hbv_state_19_Int, hbv_state_8_Int, hbv_state_14_Bool, hbv_state_21_Int, hbv_state_1_Int, hbv_state_5_Int, hbv_state_11_Int, hbv_state_3_Int, hbv_state_9_Bool, hbv_state_2_Bool, hbv_state_10_Int, hbv_state_16_Int, hbv_state_4_Int, hbv_state_7_Int, hbv_state_12_Bool, hbv_state_15_Bool; [L0] assume ((((((((((((((((((((((((((hbv_state_3_Int == hbv_state_4_Int && hhv_state_12_Int == hhv_state_11_Int) && hbv_state_8_Int == hbv_state_1_Int) && !(hbv_state_12_Bool && !(hbv_state_11_Int + -1 * hhv_state_19_Int == -1))) && hhv_state_6_Int == hhv_state_18_Int) && hhv_state_7_Int == hhv_state_6_Int) && !(!hbv_state_2_Bool && !(hhv_state_18_Int == 0))) && !(((hbv_state_13_Bool || !hbv_state_14_Bool) || hbv_state_1_Int + (-1 * hbv_state_4_Int + -1 * hbv_state_6_Int) <= 0) && ((hbv_state_14_Bool && !(hbv_state_1_Int + (-1 * hbv_state_4_Int + -1 * hbv_state_6_Int) <= 0)) || !hbv_state_13_Bool))) && hbv_state_4_Int == hhv_state_9_Int) && !((hbv_state_14_Bool || hbv_state_9_Bool) && (!hbv_state_14_Bool || !hbv_state_9_Bool))) && hbv_state_10_Int == hbv_state_5_Int) && hhv_state_1_Int == hhv_state_0_Int) && !(!hbv_state_2_Bool && !(hhv_state_20_Int == 0))) && hbv_state_7_Int == hbv_state_6_Int) && !(hbv_state_2_Bool && !(hbv_state_1_Int + -1 * hhv_state_20_Int == -1))) && hhv_state_5_Int == hhv_state_4_Int) && hhv_state_4_Int == hhv_state_19_Int) && !(!hbv_state_12_Bool && !(hhv_state_19_Int == 0))) && !((!hhv_state_8_Bool || !hhv_state_3_Bool) && (hhv_state_8_Bool || hhv_state_3_Bool))) && !((!hbv_state_15_Bool || !hbv_state_9_Bool) && (hbv_state_15_Bool || hbv_state_9_Bool))) && !(((hhv_state_8_Bool && !(hhv_state_1_Int + (-1 * hhv_state_10_Int + -1 * hhv_state_12_Int) <= 0)) || !hhv_state_13_Bool) && ((hhv_state_1_Int + (-1 * hhv_state_10_Int + -1 * hhv_state_12_Int) <= 0 || hhv_state_13_Bool) || !hhv_state_8_Bool))) && hhv_state_0_Int == hhv_state_20_Int) && hbv_state_6_Int == hhv_state_11_Int) && hhv_state_10_Int == hhv_state_9_Int) && !(hbv_state_2_Bool && !(hbv_state_5_Int + -1 * hhv_state_18_Int == -1))) && !((!hhv_state_3_Bool || !hhv_state_2_Bool) && (hhv_state_3_Bool || hhv_state_2_Bool))) && !((((((hhv_state_5_Int <= hhv_state_10_Int && 1 <= hhv_state_12_Int) && 1 <= hhv_state_10_Int) && (!(hhv_state_12_Int <= hhv_state_7_Int) || hhv_state_16_Bool)) || hhv_state_2_Bool) || hbv_state_9_Bool) && ((!hbv_state_9_Bool && (((!(1 <= hhv_state_12_Int) || (!hhv_state_16_Bool && hhv_state_12_Int <= hhv_state_7_Int)) || !(1 <= hhv_state_10_Int)) || !(hhv_state_5_Int <= hhv_state_10_Int))) || !hhv_state_2_Bool))) && hbv_state_16_Int == hbv_state_11_Int; [L0] hhv_state_0_Int, hhv_state_1_Int, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Bool, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Int, hhv_state_12_Int, hhv_state_13_Bool, hhv_state_14_Int, hhv_state_15_Int, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Int, hhv_state_19_Int, hhv_state_20_Int := hbv_state_8_Int, hbv_state_1_Int, hbv_state_15_Bool, hbv_state_9_Bool, hbv_state_16_Int, hbv_state_11_Int, hbv_state_10_Int, hbv_state_5_Int, hbv_state_14_Bool, hbv_state_3_Int, hbv_state_4_Int, hbv_state_7_Int, hbv_state_6_Int, hbv_state_13_Bool, hbv_state_17_Int, hbv_state_18_Int, hbv_state_12_Bool, hbv_state_2_Bool, hbv_state_19_Int, hbv_state_20_Int, hbv_state_21_Int; [L0] havoc hbv_state_13_Bool, hbv_state_17_Int, hbv_state_20_Int, hbv_state_18_Int, hbv_state_6_Int, hbv_state_19_Int, hbv_state_8_Int, hbv_state_14_Bool, hbv_state_21_Int, hbv_state_1_Int, hbv_state_5_Int, hbv_state_11_Int, hbv_state_3_Int, hbv_state_9_Bool, hbv_state_2_Bool, hbv_state_10_Int, hbv_state_16_Int, hbv_state_4_Int, hbv_state_7_Int, hbv_state_12_Bool, hbv_state_15_Bool; [L0] assume ((((((((((((((((((((((((((hbv_state_3_Int == hbv_state_4_Int && hhv_state_12_Int == hhv_state_11_Int) && hbv_state_8_Int == hbv_state_1_Int) && !(hbv_state_12_Bool && !(hbv_state_11_Int + -1 * hhv_state_19_Int == -1))) && hhv_state_6_Int == hhv_state_18_Int) && hhv_state_7_Int == hhv_state_6_Int) && !(!hbv_state_2_Bool && !(hhv_state_18_Int == 0))) && !(((hbv_state_13_Bool || !hbv_state_14_Bool) || hbv_state_1_Int + (-1 * hbv_state_4_Int + -1 * hbv_state_6_Int) <= 0) && ((hbv_state_14_Bool && !(hbv_state_1_Int + (-1 * hbv_state_4_Int + -1 * hbv_state_6_Int) <= 0)) || !hbv_state_13_Bool))) && hbv_state_4_Int == hhv_state_9_Int) && !((hbv_state_14_Bool || hbv_state_9_Bool) && (!hbv_state_14_Bool || !hbv_state_9_Bool))) && hbv_state_10_Int == hbv_state_5_Int) && hhv_state_1_Int == hhv_state_0_Int) && !(!hbv_state_2_Bool && !(hhv_state_20_Int == 0))) && hbv_state_7_Int == hbv_state_6_Int) && !(hbv_state_2_Bool && !(hbv_state_1_Int + -1 * hhv_state_20_Int == -1))) && hhv_state_5_Int == hhv_state_4_Int) && hhv_state_4_Int == hhv_state_19_Int) && !(!hbv_state_12_Bool && !(hhv_state_19_Int == 0))) && !((!hhv_state_8_Bool || !hhv_state_3_Bool) && (hhv_state_8_Bool || hhv_state_3_Bool))) && !((!hbv_state_15_Bool || !hbv_state_9_Bool) && (hbv_state_15_Bool || hbv_state_9_Bool))) && !(((hhv_state_8_Bool && !(hhv_state_1_Int + (-1 * hhv_state_10_Int + -1 * hhv_state_12_Int) <= 0)) || !hhv_state_13_Bool) && ((hhv_state_1_Int + (-1 * hhv_state_10_Int + -1 * hhv_state_12_Int) <= 0 || hhv_state_13_Bool) || !hhv_state_8_Bool))) && hhv_state_0_Int == hhv_state_20_Int) && hbv_state_6_Int == hhv_state_11_Int) && hhv_state_10_Int == hhv_state_9_Int) && !(hbv_state_2_Bool && !(hbv_state_5_Int + -1 * hhv_state_18_Int == -1))) && !((!hhv_state_3_Bool || !hhv_state_2_Bool) && (hhv_state_3_Bool || hhv_state_2_Bool))) && !((((((hhv_state_5_Int <= hhv_state_10_Int && 1 <= hhv_state_12_Int) && 1 <= hhv_state_10_Int) && (!(hhv_state_12_Int <= hhv_state_7_Int) || hhv_state_16_Bool)) || hhv_state_2_Bool) || hbv_state_9_Bool) && ((!hbv_state_9_Bool && (((!(1 <= hhv_state_12_Int) || (!hhv_state_16_Bool && hhv_state_12_Int <= hhv_state_7_Int)) || !(1 <= hhv_state_10_Int)) || !(hhv_state_5_Int <= hhv_state_10_Int))) || !hhv_state_2_Bool))) && hbv_state_16_Int == hbv_state_11_Int; [L0] hhv_state_0_Int, hhv_state_1_Int, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Bool, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Int, hhv_state_12_Int, hhv_state_13_Bool, hhv_state_14_Int, hhv_state_15_Int, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Int, hhv_state_19_Int, hhv_state_20_Int := hbv_state_8_Int, hbv_state_1_Int, hbv_state_15_Bool, hbv_state_9_Bool, hbv_state_16_Int, hbv_state_11_Int, hbv_state_10_Int, hbv_state_5_Int, hbv_state_14_Bool, hbv_state_3_Int, hbv_state_4_Int, hbv_state_7_Int, hbv_state_6_Int, hbv_state_13_Bool, hbv_state_17_Int, hbv_state_18_Int, hbv_state_12_Bool, hbv_state_2_Bool, hbv_state_19_Int, hbv_state_20_Int, hbv_state_21_Int; [L0] havoc hbv_state_13_Bool, hbv_state_17_Int, hbv_state_20_Int, hbv_state_18_Int, hbv_state_6_Int, hbv_state_19_Int, hbv_state_8_Int, hbv_state_14_Bool, hbv_state_21_Int, hbv_state_1_Int, hbv_state_5_Int, hbv_state_11_Int, hbv_state_3_Int, hbv_state_9_Bool, hbv_state_2_Bool, hbv_state_10_Int, hbv_state_16_Int, hbv_state_4_Int, hbv_state_7_Int, hbv_state_12_Bool, hbv_state_15_Bool; [L0] assume ((((((((((((hhv_state_9_Int == hhv_state_14_Int && hhv_state_4_Int == 0) && hhv_state_11_Int == hhv_state_15_Int) && hhv_state_4_Int == hhv_state_5_Int) && hhv_state_9_Int == hhv_state_10_Int) && hhv_state_11_Int == hhv_state_12_Int) && hhv_state_0_Int == 0) && !((!hhv_state_2_Bool || !hhv_state_3_Bool) && (hhv_state_2_Bool || hhv_state_3_Bool))) && hhv_state_6_Int == hhv_state_7_Int) && !((hhv_state_8_Bool || hhv_state_3_Bool) && (!hhv_state_8_Bool || !hhv_state_3_Bool))) && !(((((1 <= hhv_state_12_Int && hhv_state_5_Int <= hhv_state_10_Int) && 1 <= hhv_state_10_Int) && (!(hhv_state_12_Int <= hhv_state_7_Int) || hhv_state_16_Bool)) || hhv_state_2_Bool) && ((((!hhv_state_2_Bool || !(hhv_state_5_Int <= hhv_state_10_Int)) || !(1 <= hhv_state_12_Int)) || !(1 <= hhv_state_10_Int)) || (!hhv_state_16_Bool && hhv_state_12_Int <= hhv_state_7_Int)))) && !(((hhv_state_13_Bool || !hhv_state_8_Bool) || hhv_state_1_Int + (-1 * hhv_state_10_Int + -1 * hhv_state_12_Int) <= 0) && ((hhv_state_8_Bool && !(hhv_state_1_Int + (-1 * hhv_state_10_Int + -1 * hhv_state_12_Int) <= 0)) || !hhv_state_13_Bool))) && hhv_state_6_Int == 0) && hhv_state_0_Int == hhv_state_1_Int; [L0] RET call gotoProc(0, 0, 0, false, false, 0, 0, 0, 0, false, 0, 0, 0, 0, false, 0, 0, false, false, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. UNSAFE Result, 4.4s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21 SDtfs, 0 SDslu, 45 SDs, 0 SdLazy, 31 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred 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.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 20 NumberOfNonLiveVariables, 453 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/8 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/durationThm_3_e7_201.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_15-03-01-601.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/durationThm_3_e7_201.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_15-03-01-601.csv Received shutdown request...