java -Xss1g -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_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/Consistency/slow-hull.56.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:46:57,553 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:46:57,555 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:46:57,574 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:46:57,574 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:46:57,575 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:46:57,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:46:57,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:46:57,580 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:46:57,581 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:46:57,582 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:46:57,582 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:46:57,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:46:57,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:46:57,584 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:46:57,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:46:57,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:46:57,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:46:57,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:46:57,591 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:46:57,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:46:57,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:46:57,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:46:57,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:46:57,597 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:46:57,598 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:46:57,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:46:57,599 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:46:57,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:46:57,600 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:46:57,601 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:46:57,602 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:46:57,602 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:46:57,603 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:46:57,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:46:57,604 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:46:57,617 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:46:57,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:46:57,618 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:46:57,618 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:46:57,619 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:46:57,619 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:46:57,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:46:57,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:46:57,620 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:46:57,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:46:57,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:46:57,621 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:46:57,621 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:46:57,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:46:57,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:46:57,622 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:46:57,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:46:57,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:46:57,623 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:46:57,624 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:46:57,624 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:46:57,667 INFO ]: Repository-Root is: /tmp [2018-06-22 10:46:57,683 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:46:57,686 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:46:57,687 INFO ]: Initializing SmtParser... [2018-06-22 10:46:57,688 INFO ]: SmtParser initialized [2018-06-22 10:46:57,688 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/slow-hull.56.smt2 [2018-06-22 10:46:57,689 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-22 10:46:57,760 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/slow-hull.56.smt2 unknown [2018-06-22 10:46:58,088 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/slow-hull.56.smt2 [2018-06-22 10:46:58,094 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:46:58,101 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:46:58,101 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:46:58,101 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:46:58,102 INFO ]: ChcToBoogie initialized [2018-06-22 10:46:58,105 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:46:58" (1/1) ... [2018-06-22 10:46:58,177 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:46:58 Unit [2018-06-22 10:46:58,177 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:46:58,177 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:46:58,177 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:46:58,177 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:46:58,205 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:46:58" (1/1) ... [2018-06-22 10:46:58,205 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:46:58" (1/1) ... [2018-06-22 10:46:58,224 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:46:58" (1/1) ... [2018-06-22 10:46:58,224 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:46:58" (1/1) ... [2018-06-22 10:46:58,241 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:46:58" (1/1) ... [2018-06-22 10:46:58,250 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:46:58" (1/1) ... [2018-06-22 10:46:58,252 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:46:58" (1/1) ... [2018-06-22 10:46:58,255 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:46:58,256 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:46:58,256 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:46:58,256 INFO ]: RCFGBuilder initialized [2018-06-22 10:46:58,256 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:46:58" (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-22 10:46:58,277 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:46:58,277 INFO ]: Found specification of procedure False [2018-06-22 10:46:58,277 INFO ]: Found implementation of procedure False [2018-06-22 10:46:58,277 INFO ]: Specification and implementation of procedure combined_lturn__bar given in one single declaration [2018-06-22 10:46:58,277 INFO ]: Found specification of procedure combined_lturn__bar [2018-06-22 10:46:58,277 INFO ]: Found implementation of procedure combined_lturn__bar [2018-06-22 10:46:58,277 INFO ]: Specification and implementation of procedure lturn__bar given in one single declaration [2018-06-22 10:46:58,277 INFO ]: Found specification of procedure lturn__bar [2018-06-22 10:46:58,277 INFO ]: Found implementation of procedure lturn__bar [2018-06-22 10:46:58,277 INFO ]: Specification and implementation of procedure step_lturn given in one single declaration [2018-06-22 10:46:58,278 INFO ]: Found specification of procedure step_lturn [2018-06-22 10:46:58,278 INFO ]: Found implementation of procedure step_lturn [2018-06-22 10:46:58,278 INFO ]: Specification and implementation of procedure combined_lturn given in one single declaration [2018-06-22 10:46:58,278 INFO ]: Found specification of procedure combined_lturn [2018-06-22 10:46:58,278 INFO ]: Found implementation of procedure combined_lturn [2018-06-22 10:46:58,278 INFO ]: Specification and implementation of procedure lturn given in one single declaration [2018-06-22 10:46:58,278 INFO ]: Found specification of procedure lturn [2018-06-22 10:46:58,278 INFO ]: Found implementation of procedure lturn [2018-06-22 10:46:58,278 INFO ]: Specification and implementation of procedure step_lturn__bar given in one single declaration [2018-06-22 10:46:58,278 INFO ]: Found specification of procedure step_lturn__bar [2018-06-22 10:46:58,278 INFO ]: Found implementation of procedure step_lturn__bar [2018-06-22 10:46:58,278 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:46:58,278 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:46:58,278 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-22 10:46:59,319 INFO ]: Using library mode [2018-06-22 10:46:59,319 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:46:59 BoogieIcfgContainer [2018-06-22 10:46:59,320 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:46:59,324 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:46:59,324 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:46:59,330 INFO ]: TraceAbstraction initialized [2018-06-22 10:46:59,330 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:46:58" (1/3) ... [2018-06-22 10:46:59,332 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ffabae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:46:59, skipping insertion in model container [2018-06-22 10:46:59,332 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:46:58" (2/3) ... [2018-06-22 10:46:59,332 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ffabae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:46:59, skipping insertion in model container [2018-06-22 10:46:59,332 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:46:59" (3/3) ... [2018-06-22 10:46:59,334 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:46:59,343 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:46:59,354 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:46:59,408 INFO ]: Using default assertion order modulation [2018-06-22 10:46:59,409 INFO ]: Interprodecural is true [2018-06-22 10:46:59,409 INFO ]: Hoare is false [2018-06-22 10:46:59,409 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:46:59,409 INFO ]: Backedges is TWOTRACK [2018-06-22 10:46:59,409 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:46:59,409 INFO ]: Difference is false [2018-06-22 10:46:59,409 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:46:59,409 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:46:59,430 INFO ]: Start isEmpty. Operand 162 states. [2018-06-22 10:46:59,468 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:46:59,468 INFO ]: Found error trace [2018-06-22 10:46:59,469 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:46:59,469 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:46:59,474 INFO ]: Analyzing trace with hash 212963982, now seen corresponding path program 1 times [2018-06-22 10:46:59,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:46:59,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:46:59,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:46:59,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:46:59,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:46:59,602 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:46:59,925 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:46:59,927 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:46:59,927 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:46:59,928 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:46:59,939 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:46:59,939 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:46:59,941 INFO ]: Start difference. First operand 162 states. Second operand 6 states. [2018-06-22 10:47:02,469 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:02,469 INFO ]: Finished difference Result 204 states and 527 transitions. [2018-06-22 10:47:02,469 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:47:02,470 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:47:02,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:02,494 INFO ]: With dead ends: 204 [2018-06-22 10:47:02,494 INFO ]: Without dead ends: 201 [2018-06-22 10:47:02,496 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:47:02,513 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-22 10:47:02,631 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-06-22 10:47:02,632 INFO ]: Start removeUnreachable. Operand 199 states. [2018-06-22 10:47:02,640 INFO ]: Finished removeUnreachable. Reduced from 199 states to 199 states and 521 transitions. [2018-06-22 10:47:02,641 INFO ]: Start accepts. Automaton has 199 states and 521 transitions. Word has length 17 [2018-06-22 10:47:02,642 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:02,642 INFO ]: Abstraction has 199 states and 521 transitions. [2018-06-22 10:47:02,642 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:47:02,642 INFO ]: Start isEmpty. Operand 199 states and 521 transitions. [2018-06-22 10:47:02,651 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:47:02,651 INFO ]: Found error trace [2018-06-22 10:47:02,651 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:02,651 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:02,652 INFO ]: Analyzing trace with hash 712092492, now seen corresponding path program 1 times [2018-06-22 10:47:02,652 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:02,652 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:02,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:02,653 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:02,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:02,682 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:02,818 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:47:02,818 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:02,818 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:47:02,819 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:47:02,820 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:47:02,820 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:47:02,820 INFO ]: Start difference. First operand 199 states and 521 transitions. Second operand 6 states. [2018-06-22 10:47:04,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:04,482 INFO ]: Finished difference Result 262 states and 878 transitions. [2018-06-22 10:47:04,482 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:47:04,482 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:47:04,482 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:04,492 INFO ]: With dead ends: 262 [2018-06-22 10:47:04,493 INFO ]: Without dead ends: 262 [2018-06-22 10:47:04,493 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:47:04,494 INFO ]: Start minimizeSevpa. Operand 262 states. [2018-06-22 10:47:04,598 INFO ]: Finished minimizeSevpa. Reduced states from 262 to 256. [2018-06-22 10:47:04,598 INFO ]: Start removeUnreachable. Operand 256 states. [2018-06-22 10:47:04,604 INFO ]: Finished removeUnreachable. Reduced from 256 states to 256 states and 866 transitions. [2018-06-22 10:47:04,604 INFO ]: Start accepts. Automaton has 256 states and 866 transitions. Word has length 21 [2018-06-22 10:47:04,604 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:04,604 INFO ]: Abstraction has 256 states and 866 transitions. [2018-06-22 10:47:04,604 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:47:04,604 INFO ]: Start isEmpty. Operand 256 states and 866 transitions. [2018-06-22 10:47:04,610 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:47:04,610 INFO ]: Found error trace [2018-06-22 10:47:04,610 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:04,611 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:04,611 INFO ]: Analyzing trace with hash -1126198895, now seen corresponding path program 1 times [2018-06-22 10:47:04,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:04,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:04,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:04,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:04,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:04,635 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:04,744 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:47:04,744 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:04,744 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:47:04,745 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:47:04,745 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:47:04,745 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:47:04,745 INFO ]: Start difference. First operand 256 states and 866 transitions. Second operand 6 states. [2018-06-22 10:47:06,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:06,273 INFO ]: Finished difference Result 330 states and 1455 transitions. [2018-06-22 10:47:06,274 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:47:06,274 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:47:06,274 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:06,287 INFO ]: With dead ends: 330 [2018-06-22 10:47:06,287 INFO ]: Without dead ends: 330 [2018-06-22 10:47:06,287 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:47:06,287 INFO ]: Start minimizeSevpa. Operand 330 states. [2018-06-22 10:47:06,484 INFO ]: Finished minimizeSevpa. Reduced states from 330 to 324. [2018-06-22 10:47:06,484 INFO ]: Start removeUnreachable. Operand 324 states. [2018-06-22 10:47:06,491 INFO ]: Finished removeUnreachable. Reduced from 324 states to 324 states and 1441 transitions. [2018-06-22 10:47:06,491 INFO ]: Start accepts. Automaton has 324 states and 1441 transitions. Word has length 21 [2018-06-22 10:47:06,491 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:06,491 INFO ]: Abstraction has 324 states and 1441 transitions. [2018-06-22 10:47:06,491 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:47:06,491 INFO ]: Start isEmpty. Operand 324 states and 1441 transitions. [2018-06-22 10:47:06,498 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:47:06,498 INFO ]: Found error trace [2018-06-22 10:47:06,498 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:06,498 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:06,499 INFO ]: Analyzing trace with hash 1056279723, now seen corresponding path program 1 times [2018-06-22 10:47:06,499 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:06,499 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:06,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:06,499 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:06,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:06,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:06,631 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:47:06,631 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:06,631 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:47:06,631 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:47:06,631 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:47:06,631 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:47:06,631 INFO ]: Start difference. First operand 324 states and 1441 transitions. Second operand 7 states. [2018-06-22 10:47:08,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:08,402 INFO ]: Finished difference Result 580 states and 3257 transitions. [2018-06-22 10:47:08,402 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:47:08,402 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 10:47:08,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:08,426 INFO ]: With dead ends: 580 [2018-06-22 10:47:08,426 INFO ]: Without dead ends: 580 [2018-06-22 10:47:08,427 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:47:08,427 INFO ]: Start minimizeSevpa. Operand 580 states. [2018-06-22 10:47:08,764 INFO ]: Finished minimizeSevpa. Reduced states from 580 to 553. [2018-06-22 10:47:08,764 INFO ]: Start removeUnreachable. Operand 553 states. [2018-06-22 10:47:08,777 INFO ]: Finished removeUnreachable. Reduced from 553 states to 553 states and 3105 transitions. [2018-06-22 10:47:08,777 INFO ]: Start accepts. Automaton has 553 states and 3105 transitions. Word has length 25 [2018-06-22 10:47:08,777 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:08,777 INFO ]: Abstraction has 553 states and 3105 transitions. [2018-06-22 10:47:08,777 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:47:08,777 INFO ]: Start isEmpty. Operand 553 states and 3105 transitions. [2018-06-22 10:47:08,784 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:47:08,784 INFO ]: Found error trace [2018-06-22 10:47:08,784 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:08,784 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:08,784 INFO ]: Analyzing trace with hash 685355704, now seen corresponding path program 1 times [2018-06-22 10:47:08,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:08,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:08,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:08,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:08,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:08,806 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:09,333 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:47:09,333 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:09,333 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:47:09,333 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:47:09,333 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:47:09,333 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:47:09,334 INFO ]: Start difference. First operand 553 states and 3105 transitions. Second operand 7 states. [2018-06-22 10:47:11,432 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:11,432 INFO ]: Finished difference Result 614 states and 3689 transitions. [2018-06-22 10:47:11,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:47:11,432 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:47:11,433 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:11,464 INFO ]: With dead ends: 614 [2018-06-22 10:47:11,464 INFO ]: Without dead ends: 614 [2018-06-22 10:47:11,465 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:47:11,465 INFO ]: Start minimizeSevpa. Operand 614 states. [2018-06-22 10:47:11,864 INFO ]: Finished minimizeSevpa. Reduced states from 614 to 597. [2018-06-22 10:47:11,864 INFO ]: Start removeUnreachable. Operand 597 states. [2018-06-22 10:47:11,879 INFO ]: Finished removeUnreachable. Reduced from 597 states to 597 states and 3604 transitions. [2018-06-22 10:47:11,879 INFO ]: Start accepts. Automaton has 597 states and 3604 transitions. Word has length 21 [2018-06-22 10:47:11,880 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:11,880 INFO ]: Abstraction has 597 states and 3604 transitions. [2018-06-22 10:47:11,880 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:47:11,880 INFO ]: Start isEmpty. Operand 597 states and 3604 transitions. [2018-06-22 10:47:11,887 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:47:11,887 INFO ]: Found error trace [2018-06-22 10:47:11,887 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:11,887 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:11,888 INFO ]: Analyzing trace with hash 1661179704, now seen corresponding path program 1 times [2018-06-22 10:47:11,888 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:11,888 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:11,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:11,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:11,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:11,911 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:12,066 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:47:12,066 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:47:12,066 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-22 10:47:12,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:12,122 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:12,135 INFO ]: Computing forward predicates... [2018-06-22 10:47:12,199 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:47:12,233 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:47:12,233 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 10:47:12,233 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:47:12,233 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:47:12,233 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:47:12,233 INFO ]: Start difference. First operand 597 states and 3604 transitions. Second operand 7 states. [2018-06-22 10:47:15,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:15,338 INFO ]: Finished difference Result 653 states and 5523 transitions. [2018-06-22 10:47:15,338 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:47:15,338 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 10:47:15,338 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:15,389 INFO ]: With dead ends: 653 [2018-06-22 10:47:15,389 INFO ]: Without dead ends: 653 [2018-06-22 10:47:15,389 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:47:15,390 INFO ]: Start minimizeSevpa. Operand 653 states. [2018-06-22 10:47:16,263 INFO ]: Finished minimizeSevpa. Reduced states from 653 to 637. [2018-06-22 10:47:16,263 INFO ]: Start removeUnreachable. Operand 637 states. [2018-06-22 10:47:16,291 INFO ]: Finished removeUnreachable. Reduced from 637 states to 637 states and 5372 transitions. [2018-06-22 10:47:16,291 INFO ]: Start accepts. Automaton has 637 states and 5372 transitions. Word has length 25 [2018-06-22 10:47:16,291 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:16,291 INFO ]: Abstraction has 637 states and 5372 transitions. [2018-06-22 10:47:16,291 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:47:16,291 INFO ]: Start isEmpty. Operand 637 states and 5372 transitions. [2018-06-22 10:47:16,297 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:47:16,297 INFO ]: Found error trace [2018-06-22 10:47:16,297 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:16,298 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:16,298 INFO ]: Analyzing trace with hash 27698002, now seen corresponding path program 1 times [2018-06-22 10:47:16,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:16,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:16,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:16,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:16,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:16,320 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:16,857 INFO ]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 10:47:16,857 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:47:16,857 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-22 10:47:16,867 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:47:16,913 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:16,917 INFO ]: Computing forward predicates... [2018-06-22 10:47:16,949 INFO ]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 10:47:16,980 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:47:16,980 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 10:47:16,980 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:47:16,980 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:47:16,980 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:47:16,980 INFO ]: Start difference. First operand 637 states and 5372 transitions. Second operand 7 states. [2018-06-22 10:47:17,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:17,981 INFO ]: Finished difference Result 666 states and 5556 transitions. [2018-06-22 10:47:17,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:47:17,982 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 10:47:17,982 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:18,014 INFO ]: With dead ends: 666 [2018-06-22 10:47:18,014 INFO ]: Without dead ends: 666 [2018-06-22 10:47:18,016 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:47:18,016 INFO ]: Start minimizeSevpa. Operand 666 states. [2018-06-22 10:47:18,753 INFO ]: Finished minimizeSevpa. Reduced states from 666 to 651. [2018-06-22 10:47:18,753 INFO ]: Start removeUnreachable. Operand 651 states. [2018-06-22 10:47:18,773 INFO ]: Finished removeUnreachable. Reduced from 651 states to 651 states and 5462 transitions. [2018-06-22 10:47:18,773 INFO ]: Start accepts. Automaton has 651 states and 5462 transitions. Word has length 29 [2018-06-22 10:47:18,774 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:18,774 INFO ]: Abstraction has 651 states and 5462 transitions. [2018-06-22 10:47:18,774 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:47:18,774 INFO ]: Start isEmpty. Operand 651 states and 5462 transitions. [2018-06-22 10:47:18,781 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:47:18,781 INFO ]: Found error trace [2018-06-22 10:47:18,781 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:18,781 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:18,782 INFO ]: Analyzing trace with hash 1627530914, now seen corresponding path program 1 times [2018-06-22 10:47:18,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:18,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:18,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:18,782 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:18,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:18,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:19,207 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:47:19,207 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:19,207 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:47:19,207 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:47:19,207 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:47:19,208 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:47:19,208 INFO ]: Start difference. First operand 651 states and 5462 transitions. Second operand 7 states. [2018-06-22 10:47:20,180 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:20,180 INFO ]: Finished difference Result 722 states and 7920 transitions. [2018-06-22 10:47:20,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:47:20,181 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 10:47:20,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:20,230 INFO ]: With dead ends: 722 [2018-06-22 10:47:20,230 INFO ]: Without dead ends: 722 [2018-06-22 10:47:20,230 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:47:20,231 INFO ]: Start minimizeSevpa. Operand 722 states. [2018-06-22 10:47:21,301 INFO ]: Finished minimizeSevpa. Reduced states from 722 to 699. [2018-06-22 10:47:21,301 INFO ]: Start removeUnreachable. Operand 699 states. [2018-06-22 10:47:21,327 INFO ]: Finished removeUnreachable. Reduced from 699 states to 699 states and 7652 transitions. [2018-06-22 10:47:21,327 INFO ]: Start accepts. Automaton has 699 states and 7652 transitions. Word has length 29 [2018-06-22 10:47:21,328 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:21,328 INFO ]: Abstraction has 699 states and 7652 transitions. [2018-06-22 10:47:21,328 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:47:21,328 INFO ]: Start isEmpty. Operand 699 states and 7652 transitions. [2018-06-22 10:47:21,334 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:47:21,334 INFO ]: Found error trace [2018-06-22 10:47:21,334 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:21,334 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:21,335 INFO ]: Analyzing trace with hash -1033954680, now seen corresponding path program 1 times [2018-06-22 10:47:21,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:21,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:21,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:21,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:21,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:21,358 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:21,587 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:47:21,587 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:21,587 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:47:21,587 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:47:21,587 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:47:21,587 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:47:21,587 INFO ]: Start difference. First operand 699 states and 7652 transitions. Second operand 7 states. [2018-06-22 10:47:22,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:22,290 INFO ]: Finished difference Result 711 states and 7769 transitions. [2018-06-22 10:47:22,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:47:22,291 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 10:47:22,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:22,319 INFO ]: With dead ends: 711 [2018-06-22 10:47:22,319 INFO ]: Without dead ends: 711 [2018-06-22 10:47:22,319 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:47:22,319 INFO ]: Start minimizeSevpa. Operand 711 states. [2018-06-22 10:47:23,032 INFO ]: Finished minimizeSevpa. Reduced states from 711 to 699. [2018-06-22 10:47:23,032 INFO ]: Start removeUnreachable. Operand 699 states. [2018-06-22 10:47:23,060 INFO ]: Finished removeUnreachable. Reduced from 699 states to 699 states and 7650 transitions. [2018-06-22 10:47:23,060 INFO ]: Start accepts. Automaton has 699 states and 7650 transitions. Word has length 25 [2018-06-22 10:47:23,060 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:23,060 INFO ]: Abstraction has 699 states and 7650 transitions. [2018-06-22 10:47:23,060 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:47:23,060 INFO ]: Start isEmpty. Operand 699 states and 7650 transitions. [2018-06-22 10:47:23,072 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:47:23,072 INFO ]: Found error trace [2018-06-22 10:47:23,073 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:23,073 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:23,075 INFO ]: Analyzing trace with hash 1478515841, now seen corresponding path program 1 times [2018-06-22 10:47:23,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:23,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:23,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:23,075 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:23,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:23,086 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:23,349 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:47:23,349 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:23,349 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:47:23,349 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:47:23,349 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:47:23,349 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:47:23,350 INFO ]: Start difference. First operand 699 states and 7650 transitions. Second operand 6 states. [2018-06-22 10:47:23,561 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:23,561 INFO ]: Finished difference Result 726 states and 8137 transitions. [2018-06-22 10:47:23,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:47:23,561 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:47:23,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:23,589 INFO ]: With dead ends: 726 [2018-06-22 10:47:23,589 INFO ]: Without dead ends: 725 [2018-06-22 10:47:23,589 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:47:23,589 INFO ]: Start minimizeSevpa. Operand 725 states. [2018-06-22 10:47:24,317 INFO ]: Finished minimizeSevpa. Reduced states from 725 to 714. [2018-06-22 10:47:24,317 INFO ]: Start removeUnreachable. Operand 714 states. [2018-06-22 10:47:24,344 INFO ]: Finished removeUnreachable. Reduced from 714 states to 714 states and 8017 transitions. [2018-06-22 10:47:24,344 INFO ]: Start accepts. Automaton has 714 states and 8017 transitions. Word has length 21 [2018-06-22 10:47:24,344 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:24,344 INFO ]: Abstraction has 714 states and 8017 transitions. [2018-06-22 10:47:24,344 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:47:24,344 INFO ]: Start isEmpty. Operand 714 states and 8017 transitions. [2018-06-22 10:47:24,353 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:47:24,353 INFO ]: Found error trace [2018-06-22 10:47:24,353 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:24,353 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:24,353 INFO ]: Analyzing trace with hash 619059022, now seen corresponding path program 1 times [2018-06-22 10:47:24,353 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:24,353 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:24,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:24,354 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:24,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:24,373 INFO ]: Conjunction of SSA is sat [2018-06-22 10:47:24,375 INFO ]: Counterexample might be feasible [2018-06-22 10:47:24,400 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:47:24 BoogieIcfgContainer [2018-06-22 10:47:24,400 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:47:24,401 INFO ]: Toolchain (without parser) took 26306.46 ms. Allocated memory was 309.3 MB in the beginning and 880.3 MB in the end (delta: 570.9 MB). Free memory was 255.8 MB in the beginning and 300.7 MB in the end (delta: -45.0 MB). Peak memory consumption was 526.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:47:24,403 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:47:24,403 INFO ]: ChcToBoogie took 75.59 ms. Allocated memory is still 309.3 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:47:24,403 INFO ]: Boogie Preprocessor took 77.79 ms. Allocated memory is still 309.3 MB. Free memory was 253.8 MB in the beginning and 251.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:47:24,404 INFO ]: RCFGBuilder took 1063.88 ms. Allocated memory is still 309.3 MB. Free memory was 251.8 MB in the beginning and 213.9 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 3.6 GB. [2018-06-22 10:47:24,404 INFO ]: TraceAbstraction took 25076.60 ms. Allocated memory was 309.3 MB in the beginning and 880.3 MB in the end (delta: 570.9 MB). Free memory was 213.9 MB in the beginning and 300.7 MB in the end (delta: -86.8 MB). Peak memory consumption was 484.1 MB. Max. memory is 3.6 GB. [2018-06-22 10:47:24,408 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 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 75.59 ms. Allocated memory is still 309.3 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 77.79 ms. Allocated memory is still 309.3 MB. Free memory was 253.8 MB in the beginning and 251.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1063.88 ms. Allocated memory is still 309.3 MB. Free memory was 251.8 MB in the beginning and 213.9 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 25076.60 ms. Allocated memory was 309.3 MB in the beginning and 880.3 MB in the end (delta: 570.9 MB). Free memory was 213.9 MB in the beginning and 300.7 MB in the end (delta: -86.8 MB). Peak memory consumption was 484.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call False(); [L0] assume true; [L0] CALL call step_lturn(hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int); [L0] assume true; [L0] CALL call step_lturn(hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_5_Int, hhv_step_lturn_8_Int); [L0] assume true; [L0] CALL call step_lturn__bar(hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_7_Int, hhv_step_lturn_6_Int, hhv_step_lturn_8_Int); [L0] assume ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_1_Int + 0 >= 0 && 0 + -1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_2_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_2_Int + -1 * hhv_step_lturn__bar_5_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_6_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + -1 * hhv_step_lturn__bar_7_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_6_Int + 1 * hhv_step_lturn__bar_5_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_7_Int + 1 * hhv_step_lturn__bar_5_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + 1 * hhv_step_lturn__bar_7_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_2_Int + 1 * hhv_step_lturn__bar_6_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + 1 * hhv_step_lturn__bar_5_Int + -4 >= 0) && 0 + -1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_6_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_1_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_6_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_7_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_2_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + 1 * hhv_step_lturn__bar_2_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_0_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + 1 * hhv_step_lturn__bar_6_Int + -3 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_2_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_6_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + 1 * hhv_step_lturn__bar_2_Int + -4 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_5_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_0_Int + 1 * hhv_step_lturn__bar_7_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + -1 * hhv_step_lturn__bar_1_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_0_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_2_Int + 1 * hhv_step_lturn__bar_5_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_2_Int + 1 * hhv_step_lturn__bar_7_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + -1 * hhv_step_lturn__bar_1_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_5_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_4_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_5_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_5_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_1_Int + -1 * hhv_step_lturn__bar_6_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + 1 * hhv_step_lturn__bar_7_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_2_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_7_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_7_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_2_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_7_Int + -1 * hhv_step_lturn__bar_6_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_4_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_7_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_6_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_2_Int + 1 * hhv_step_lturn__bar_5_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + 1 * hhv_step_lturn__bar_0_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_1_Int + -2 >= 0) && 0 + -1 * hhv_step_lturn__bar_6_Int + 1 * hhv_step_lturn__bar_5_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + -1 * hhv_step_lturn__bar_5_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + -1 * hhv_step_lturn__bar_6_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + -1 * hhv_step_lturn__bar_6_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_5_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + 1 * hhv_step_lturn__bar_1_Int + -3 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_7_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + 1 * hhv_step_lturn__bar_1_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + -1 * hhv_step_lturn__bar_2_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_7_Int + 1 * hhv_step_lturn__bar_6_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + 1 * hhv_step_lturn__bar_6_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + 1 * hhv_step_lturn__bar_5_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_2_Int + -1 * hhv_step_lturn__bar_6_Int + -1 >= 0; [L0] RET call step_lturn__bar(hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_7_Int, hhv_step_lturn_6_Int, hhv_step_lturn_8_Int); [L0] RET call step_lturn(hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_5_Int, hhv_step_lturn_8_Int); [L0] RET call step_lturn(hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int); [L0] CALL call combined_lturn(hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_8_Int, hbv_False_7_Int, hbv_False_9_Int); [L0] assume true; [L0] CALL call step_lturn(hhv_combined_lturn_0_Int, hhv_combined_lturn_1_Int, hhv_combined_lturn_2_Int, hhv_combined_lturn_3_Int, hhv_combined_lturn_4_Int, hhv_combined_lturn_5_Int, hhv_combined_lturn_6_Int, hhv_combined_lturn_7_Int, hhv_combined_lturn_8_Int); [L0] assume true; [L0] CALL call step_lturn(hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_5_Int, hhv_step_lturn_8_Int); [L0] assume true; [L0] CALL call step_lturn__bar(hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_7_Int, hhv_step_lturn_6_Int, hhv_step_lturn_8_Int); [L0] assume ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_1_Int + 0 >= 0 && 0 + -1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_2_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_2_Int + -1 * hhv_step_lturn__bar_5_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_6_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + -1 * hhv_step_lturn__bar_7_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_6_Int + 1 * hhv_step_lturn__bar_5_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_7_Int + 1 * hhv_step_lturn__bar_5_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + 1 * hhv_step_lturn__bar_7_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_2_Int + 1 * hhv_step_lturn__bar_6_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + 1 * hhv_step_lturn__bar_5_Int + -4 >= 0) && 0 + -1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_6_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_1_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_6_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_7_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_2_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + 1 * hhv_step_lturn__bar_2_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_0_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + 1 * hhv_step_lturn__bar_6_Int + -3 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_2_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_6_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + 1 * hhv_step_lturn__bar_2_Int + -4 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_5_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_0_Int + 1 * hhv_step_lturn__bar_7_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + -1 * hhv_step_lturn__bar_1_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_0_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_2_Int + 1 * hhv_step_lturn__bar_5_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_2_Int + 1 * hhv_step_lturn__bar_7_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + -1 * hhv_step_lturn__bar_1_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_5_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_4_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_5_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_5_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_1_Int + -1 * hhv_step_lturn__bar_6_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + 1 * hhv_step_lturn__bar_7_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_2_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_7_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_7_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_2_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_7_Int + -1 * hhv_step_lturn__bar_6_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_4_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_7_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_6_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_2_Int + 1 * hhv_step_lturn__bar_5_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + 1 * hhv_step_lturn__bar_0_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + -2 >= 0) && 0 + 1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_1_Int + -2 >= 0) && 0 + -1 * hhv_step_lturn__bar_6_Int + 1 * hhv_step_lturn__bar_5_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + -1 * hhv_step_lturn__bar_5_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + -1 * hhv_step_lturn__bar_6_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + -1 * hhv_step_lturn__bar_6_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_1_Int + 1 * hhv_step_lturn__bar_5_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + 1 * hhv_step_lturn__bar_1_Int + -3 >= 0) && 0 + -1 * hhv_step_lturn__bar_3_Int + 1 * hhv_step_lturn__bar_7_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + 1 * hhv_step_lturn__bar_1_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + -1 * hhv_step_lturn__bar_2_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn__bar_7_Int + 1 * hhv_step_lturn__bar_6_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_4_Int + 1 * hhv_step_lturn__bar_6_Int + -3 >= 0) && 0 + 1 * hhv_step_lturn__bar_0_Int + 1 * hhv_step_lturn__bar_5_Int + -4 >= 0) && 0 + 1 * hhv_step_lturn__bar_2_Int + -1 * hhv_step_lturn__bar_6_Int + -1 >= 0; [L0] RET call step_lturn__bar(hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_7_Int, hhv_step_lturn_6_Int, hhv_step_lturn_8_Int); [L0] RET call step_lturn(hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_5_Int, hhv_step_lturn_8_Int); [L0] RET call step_lturn(hhv_combined_lturn_0_Int, hhv_combined_lturn_1_Int, hhv_combined_lturn_2_Int, hhv_combined_lturn_3_Int, hhv_combined_lturn_4_Int, hhv_combined_lturn_5_Int, hhv_combined_lturn_6_Int, hhv_combined_lturn_7_Int, hhv_combined_lturn_8_Int); [L0] RET call combined_lturn(hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_8_Int, hbv_False_7_Int, hbv_False_9_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 162 locations, 1 error locations. UNSAFE Result, 25.0s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 15.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3275 SDtfs, 79 SDslu, 13216 SDs, 0 SdLazy, 9675 SolverSat, 269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=714occurred in iteration=10, 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: 5.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 135 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 18136 SizeOfPredicates, 4 NumberOfNonLiveVariables, 515 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 48/60 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/slow-hull.56.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-47-24-418.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/slow-hull.56.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-47-24-418.csv Received shutdown request...