java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:04:53,570 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:04:53,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:04:53,587 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:04:53,587 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:04:53,589 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:04:53,590 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:04:53,598 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:04:53,600 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:04:53,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:04:53,604 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:04:53,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:04:53,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:04:53,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:04:53,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:04:53,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:04:53,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:04:53,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:04:53,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:04:53,614 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:04:53,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:04:53,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:04:53,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:04:53,618 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:04:53,619 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:04:53,620 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:04:53,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:04:53,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:04:53,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:04:53,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:04:53,623 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:04:53,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:04:53,624 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:04:53,625 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:04:53,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:04:53,626 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:04:53,648 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:04:53,651 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:04:53,651 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:04:53,651 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:04:53,652 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:04:53,653 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:04:53,653 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:04:53,653 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:04:53,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:04:53,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:04:53,654 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:04:53,657 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:04:53,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:04:53,657 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:04:53,657 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:04:53,658 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:04:53,658 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:04:53,658 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:04:53,658 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:04:53,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:04:53,658 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:04:53,662 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:04:53,662 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:04:53,709 INFO ]: Repository-Root is: /tmp [2018-06-24 21:04:53,720 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:04:53,723 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:04:53,725 INFO ]: Initializing SmtParser... [2018-06-24 21:04:53,725 INFO ]: SmtParser initialized [2018-06-24 21:04:53,726 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 [2018-06-24 21:04:53,727 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-24 21:04:53,816 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 unknown [2018-06-24 21:04:54,056 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 [2018-06-24 21:04:54,060 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:04:54,068 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:04:54,069 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:04:54,069 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:04:54,069 INFO ]: ChcToBoogie initialized [2018-06-24 21:04:54,072 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:04:54" (1/1) ... [2018-06-24 21:04:54,128 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:54 Unit [2018-06-24 21:04:54,128 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:04:54,128 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:04:54,129 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:04:54,129 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:04:54,142 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:54" (1/1) ... [2018-06-24 21:04:54,142 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:54" (1/1) ... [2018-06-24 21:04:54,147 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:54" (1/1) ... [2018-06-24 21:04:54,147 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:54" (1/1) ... [2018-06-24 21:04:54,152 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:54" (1/1) ... [2018-06-24 21:04:54,154 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:54" (1/1) ... [2018-06-24 21:04:54,155 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:54" (1/1) ... [2018-06-24 21:04:54,157 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:04:54,158 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:04:54,158 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:04:54,158 INFO ]: RCFGBuilder initialized [2018-06-24 21:04:54,159 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:54" (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-24 21:04:54,170 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:04:54,170 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:04:54,170 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:04:54,170 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:04:54,170 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:04:54,170 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-24 21:04:54,496 INFO ]: Using library mode [2018-06-24 21:04:54,497 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:04:54 BoogieIcfgContainer [2018-06-24 21:04:54,497 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:04:54,497 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:04:54,497 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:04:54,498 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:04:54,499 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:04:54" (1/1) ... [2018-06-24 21:04:54,513 INFO ]: Initial Icfg 12 locations, 24 edges [2018-06-24 21:04:54,515 INFO ]: Using Remove infeasible edges [2018-06-24 21:04:54,516 INFO ]: Using Maximize final states [2018-06-24 21:04:54,517 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:04:54,517 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:04:54,518 INFO ]: Using Remove sink states [2018-06-24 21:04:54,520 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:04:54,520 INFO ]: Using Use SBE [2018-06-24 21:04:54,526 INFO ]: SBE split 0 edges [2018-06-24 21:04:54,531 INFO ]: Removed 5 edges and 2 locations because of local infeasibility [2018-06-24 21:04:54,533 INFO ]: 0 new accepting states [2018-06-24 21:04:54,593 INFO ]: Removed 8 edges and 2 locations by large block encoding [2018-06-24 21:04:54,595 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:04:54,596 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:04:54,597 INFO ]: 0 new accepting states [2018-06-24 21:04:54,597 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:04:54,597 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:04:54,597 INFO ]: Encoded RCFG 8 locations, 17 edges [2018-06-24 21:04:54,598 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:04:54 BasicIcfg [2018-06-24 21:04:54,598 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:04:54,599 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:04:54,599 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:04:54,602 INFO ]: TraceAbstraction initialized [2018-06-24 21:04:54,602 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:04:54" (1/4) ... [2018-06-24 21:04:54,603 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa62067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:04:54, skipping insertion in model container [2018-06-24 21:04:54,603 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:54" (2/4) ... [2018-06-24 21:04:54,603 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa62067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:04:54, skipping insertion in model container [2018-06-24 21:04:54,603 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:04:54" (3/4) ... [2018-06-24 21:04:54,603 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa62067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:04:54, skipping insertion in model container [2018-06-24 21:04:54,603 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:04:54" (4/4) ... [2018-06-24 21:04:54,606 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:04:54,614 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:04:54,622 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:04:54,658 INFO ]: Using default assertion order modulation [2018-06-24 21:04:54,659 INFO ]: Interprodecural is true [2018-06-24 21:04:54,659 INFO ]: Hoare is false [2018-06-24 21:04:54,659 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:04:54,659 INFO ]: Backedges is TWOTRACK [2018-06-24 21:04:54,659 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:04:54,659 INFO ]: Difference is false [2018-06-24 21:04:54,659 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:04:54,659 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:04:54,667 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 21:04:54,677 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:04:54,677 INFO ]: Found error trace [2018-06-24 21:04:54,677 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:04:54,678 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:54,683 INFO ]: Analyzing trace with hash 44147144, now seen corresponding path program 1 times [2018-06-24 21:04:54,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:54,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:54,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:54,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:54,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:54,762 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:54,816 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:54,818 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:54,818 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:04:54,819 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:04:54,830 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:04:54,831 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:54,832 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-24 21:04:54,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:54,986 INFO ]: Finished difference Result 11 states and 23 transitions. [2018-06-24 21:04:54,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:54,987 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:04:54,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:54,996 INFO ]: With dead ends: 11 [2018-06-24 21:04:54,996 INFO ]: Without dead ends: 11 [2018-06-24 21:04:54,998 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-24 21:04:55,012 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:04:55,036 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 21:04:55,038 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:04:55,038 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2018-06-24 21:04:55,040 INFO ]: Start accepts. Automaton has 9 states and 20 transitions. Word has length 5 [2018-06-24 21:04:55,040 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:55,040 INFO ]: Abstraction has 9 states and 20 transitions. [2018-06-24 21:04:55,040 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:04:55,040 INFO ]: Start isEmpty. Operand 9 states and 20 transitions. [2018-06-24 21:04:55,040 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:04:55,040 INFO ]: Found error trace [2018-06-24 21:04:55,040 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:04:55,040 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:55,040 INFO ]: Analyzing trace with hash 44178857, now seen corresponding path program 1 times [2018-06-24 21:04:55,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:55,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:55,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:55,042 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:55,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:55,057 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:55,187 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:55,187 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:55,187 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:04:55,189 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:04:55,189 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:04:55,189 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:55,189 INFO ]: Start difference. First operand 9 states and 20 transitions. Second operand 3 states. [2018-06-24 21:04:55,251 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:55,251 INFO ]: Finished difference Result 10 states and 21 transitions. [2018-06-24 21:04:55,252 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:55,252 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:04:55,253 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:55,253 INFO ]: With dead ends: 10 [2018-06-24 21:04:55,253 INFO ]: Without dead ends: 10 [2018-06-24 21:04:55,254 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:55,254 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:04:55,255 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:04:55,255 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:04:55,255 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2018-06-24 21:04:55,256 INFO ]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 5 [2018-06-24 21:04:55,257 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:55,257 INFO ]: Abstraction has 10 states and 21 transitions. [2018-06-24 21:04:55,257 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:04:55,257 INFO ]: Start isEmpty. Operand 10 states and 21 transitions. [2018-06-24 21:04:55,257 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:04:55,257 INFO ]: Found error trace [2018-06-24 21:04:55,257 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:04:55,257 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:55,257 INFO ]: Analyzing trace with hash 1367791065, now seen corresponding path program 1 times [2018-06-24 21:04:55,258 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:55,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:55,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:55,258 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:55,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:55,275 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:55,355 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:55,356 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:55,356 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:04:55,356 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:04:55,356 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:04:55,356 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:55,356 INFO ]: Start difference. First operand 10 states and 21 transitions. Second operand 3 states. [2018-06-24 21:04:55,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:55,467 INFO ]: Finished difference Result 14 states and 31 transitions. [2018-06-24 21:04:55,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:55,468 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:04:55,468 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:55,469 INFO ]: With dead ends: 14 [2018-06-24 21:04:55,469 INFO ]: Without dead ends: 14 [2018-06-24 21:04:55,469 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-24 21:04:55,469 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:04:55,471 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-24 21:04:55,471 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:04:55,473 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-06-24 21:04:55,473 INFO ]: Start accepts. Automaton has 12 states and 27 transitions. Word has length 6 [2018-06-24 21:04:55,474 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:55,474 INFO ]: Abstraction has 12 states and 27 transitions. [2018-06-24 21:04:55,474 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:04:55,474 INFO ]: Start isEmpty. Operand 12 states and 27 transitions. [2018-06-24 21:04:55,475 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:04:55,475 INFO ]: Found error trace [2018-06-24 21:04:55,475 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:04:55,475 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:55,475 INFO ]: Analyzing trace with hash 1367880438, now seen corresponding path program 1 times [2018-06-24 21:04:55,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:55,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:55,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:55,476 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:55,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:55,497 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:55,594 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:55,594 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:55,594 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-24 21:04:55,608 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-24 21:04:55,640 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:55,647 INFO ]: Computing forward predicates... [2018-06-24 21:04:55,670 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:55,702 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:55,702 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 21:04:55,703 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:04:55,703 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:04:55,703 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:04:55,703 INFO ]: Start difference. First operand 12 states and 27 transitions. Second operand 4 states. [2018-06-24 21:04:55,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:55,809 INFO ]: Finished difference Result 13 states and 22 transitions. [2018-06-24 21:04:55,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:55,809 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:04:55,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:55,810 INFO ]: With dead ends: 13 [2018-06-24 21:04:55,810 INFO ]: Without dead ends: 13 [2018-06-24 21:04:55,810 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:04:55,810 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:04:55,812 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-24 21:04:55,812 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:04:55,812 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-06-24 21:04:55,812 INFO ]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 6 [2018-06-24 21:04:55,812 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:55,812 INFO ]: Abstraction has 9 states and 14 transitions. [2018-06-24 21:04:55,812 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:04:55,812 INFO ]: Start isEmpty. Operand 9 states and 14 transitions. [2018-06-24 21:04:55,813 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:04:55,814 INFO ]: Found error trace [2018-06-24 21:04:55,814 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:04:55,814 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:55,815 INFO ]: Analyzing trace with hash 1367941942, now seen corresponding path program 1 times [2018-06-24 21:04:55,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:55,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:55,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:55,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:55,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:55,834 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:55,894 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:55,894 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:55,894 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:04:55,894 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:04:55,895 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:04:55,895 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:04:55,895 INFO ]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2018-06-24 21:04:56,035 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:56,035 INFO ]: Finished difference Result 14 states and 23 transitions. [2018-06-24 21:04:56,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:04:56,037 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:04:56,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:56,037 INFO ]: With dead ends: 14 [2018-06-24 21:04:56,037 INFO ]: Without dead ends: 14 [2018-06-24 21:04:56,038 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:04:56,038 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:04:56,039 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-06-24 21:04:56,039 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:04:56,040 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-06-24 21:04:56,040 INFO ]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 6 [2018-06-24 21:04:56,040 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:56,040 INFO ]: Abstraction has 10 states and 17 transitions. [2018-06-24 21:04:56,040 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:04:56,040 INFO ]: Start isEmpty. Operand 10 states and 17 transitions. [2018-06-24 21:04:56,040 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:04:56,040 INFO ]: Found error trace [2018-06-24 21:04:56,040 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:04:56,040 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:56,041 INFO ]: Analyzing trace with hash 1368895254, now seen corresponding path program 1 times [2018-06-24 21:04:56,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:56,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:56,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:56,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:56,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:56,047 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:56,072 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:56,072 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:56,072 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:04:56,073 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:04:56,073 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:04:56,073 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:56,073 INFO ]: Start difference. First operand 10 states and 17 transitions. Second operand 3 states. [2018-06-24 21:04:56,086 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:56,086 INFO ]: Finished difference Result 11 states and 17 transitions. [2018-06-24 21:04:56,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:56,086 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:04:56,086 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:56,087 INFO ]: With dead ends: 11 [2018-06-24 21:04:56,087 INFO ]: Without dead ends: 10 [2018-06-24 21:04:56,087 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-24 21:04:56,087 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:04:56,088 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:04:56,088 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:04:56,088 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-24 21:04:56,089 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 6 [2018-06-24 21:04:56,089 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:56,089 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-24 21:04:56,089 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:04:56,089 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-24 21:04:56,089 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:04:56,089 INFO ]: Found error trace [2018-06-24 21:04:56,089 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:56,089 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:56,090 INFO ]: Analyzing trace with hash -545998904, now seen corresponding path program 1 times [2018-06-24 21:04:56,090 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:56,090 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:56,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:56,091 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:56,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:56,111 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:56,284 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:56,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:56,285 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-24 21:04:56,298 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:56,337 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:56,339 INFO ]: Computing forward predicates... [2018-06-24 21:04:56,496 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:56,525 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:56,525 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:04:56,525 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:04:56,525 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:04:56,525 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:04:56,526 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 8 states. [2018-06-24 21:04:56,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:56,675 INFO ]: Finished difference Result 15 states and 25 transitions. [2018-06-24 21:04:56,696 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:04:56,696 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:04:56,696 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:56,696 INFO ]: With dead ends: 15 [2018-06-24 21:04:56,696 INFO ]: Without dead ends: 15 [2018-06-24 21:04:56,696 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:04:56,697 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:04:56,698 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 10. [2018-06-24 21:04:56,698 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:04:56,698 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-24 21:04:56,698 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 7 [2018-06-24 21:04:56,698 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:56,698 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-24 21:04:56,698 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:04:56,699 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-24 21:04:56,699 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:04:56,699 INFO ]: Found error trace [2018-06-24 21:04:56,699 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:56,699 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:56,699 INFO ]: Analyzing trace with hash -544122071, now seen corresponding path program 1 times [2018-06-24 21:04:56,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:56,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:56,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:56,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:56,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:56,707 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:56,792 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:56,792 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:56,792 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:04:56,792 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:04:56,792 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:04:56,792 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:04:56,793 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 4 states. [2018-06-24 21:04:57,017 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:57,017 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-24 21:04:57,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:04:57,017 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 21:04:57,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:57,018 INFO ]: With dead ends: 10 [2018-06-24 21:04:57,018 INFO ]: Without dead ends: 9 [2018-06-24 21:04:57,018 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:04:57,018 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:04:57,019 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:04:57,019 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:04:57,019 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-24 21:04:57,019 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-24 21:04:57,019 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:57,019 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-24 21:04:57,019 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:04:57,019 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-24 21:04:57,020 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:04:57,020 INFO ]: Found error trace [2018-06-24 21:04:57,020 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:57,020 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:57,020 INFO ]: Analyzing trace with hash -488740602, now seen corresponding path program 1 times [2018-06-24 21:04:57,020 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:57,020 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:57,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:57,021 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:57,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:57,032 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:57,114 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:57,114 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:57,114 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:04:57,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:57,147 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:57,149 INFO ]: Computing forward predicates... [2018-06-24 21:04:57,152 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:57,172 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:57,172 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 21:04:57,172 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:04:57,172 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:04:57,172 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:04:57,173 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 4 states. [2018-06-24 21:04:57,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:57,239 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-24 21:04:57,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:04:57,239 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 21:04:57,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:57,240 INFO ]: With dead ends: 10 [2018-06-24 21:04:57,240 INFO ]: Without dead ends: 10 [2018-06-24 21:04:57,240 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:04:57,240 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:04:57,241 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:04:57,241 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:04:57,241 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-24 21:04:57,241 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 7 [2018-06-24 21:04:57,241 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:57,241 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-24 21:04:57,241 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:04:57,241 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-24 21:04:57,242 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:04:57,242 INFO ]: Found error trace [2018-06-24 21:04:57,242 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:57,242 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:57,242 INFO ]: Analyzing trace with hash 2026384376, now seen corresponding path program 2 times [2018-06-24 21:04:57,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:57,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:57,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:57,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:57,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:57,252 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:57,313 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:57,313 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:57,313 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:04:57,327 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:04:57,344 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:04:57,344 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:57,346 INFO ]: Computing forward predicates... [2018-06-24 21:04:57,351 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:57,385 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:57,385 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:04:57,386 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:04:57,386 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:04:57,386 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:04:57,386 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 5 states. [2018-06-24 21:04:57,536 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:57,536 INFO ]: Finished difference Result 11 states and 17 transitions. [2018-06-24 21:04:57,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:04:57,536 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 21:04:57,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:57,536 INFO ]: With dead ends: 11 [2018-06-24 21:04:57,536 INFO ]: Without dead ends: 11 [2018-06-24 21:04:57,536 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:04:57,536 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:04:57,537 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 21:04:57,537 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:04:57,538 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-24 21:04:57,538 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-24 21:04:57,538 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:57,538 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-24 21:04:57,538 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:04:57,538 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-24 21:04:57,538 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:04:57,538 INFO ]: Found error trace [2018-06-24 21:04:57,538 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:57,538 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:57,538 INFO ]: Analyzing trace with hash -1609119930, now seen corresponding path program 3 times [2018-06-24 21:04:57,538 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:57,538 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:57,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:57,539 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:04:57,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:57,549 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:57,608 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:57,608 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:57,608 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:04:57,614 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:04:57,632 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:04:57,632 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:57,634 INFO ]: Computing forward predicates... [2018-06-24 21:04:57,686 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:57,706 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:57,706 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-24 21:04:57,706 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:04:57,706 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:04:57,706 INFO ]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:04:57,706 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 11 states. [2018-06-24 21:04:57,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:57,935 INFO ]: Finished difference Result 22 states and 39 transitions. [2018-06-24 21:04:57,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:04:57,936 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-24 21:04:57,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:57,936 INFO ]: With dead ends: 22 [2018-06-24 21:04:57,936 INFO ]: Without dead ends: 22 [2018-06-24 21:04:57,937 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:04:57,937 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:04:57,938 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 12. [2018-06-24 21:04:57,938 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:04:57,939 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-24 21:04:57,939 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 9 [2018-06-24 21:04:57,939 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:57,939 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-24 21:04:57,939 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:04:57,939 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-24 21:04:57,939 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:04:57,939 INFO ]: Found error trace [2018-06-24 21:04:57,939 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:57,939 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:57,939 INFO ]: Analyzing trace with hash 1654363576, now seen corresponding path program 4 times [2018-06-24 21:04:57,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:57,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:57,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:57,940 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:04:57,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:57,951 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:58,025 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:58,025 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:58,025 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:04:58,034 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:04:58,065 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:04:58,065 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:58,067 INFO ]: Computing forward predicates... [2018-06-24 21:04:58,155 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:58,174 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:58,174 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-24 21:04:58,175 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:04:58,175 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:04:58,175 INFO ]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:04:58,175 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 13 states. [2018-06-24 21:04:58,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:58,506 INFO ]: Finished difference Result 28 states and 51 transitions. [2018-06-24 21:04:58,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:04:58,507 INFO ]: Start accepts. Automaton has 13 states. Word has length 10 [2018-06-24 21:04:58,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:58,507 INFO ]: With dead ends: 28 [2018-06-24 21:04:58,507 INFO ]: Without dead ends: 28 [2018-06-24 21:04:58,508 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=503, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:04:58,508 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 21:04:58,510 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 13. [2018-06-24 21:04:58,510 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:04:58,510 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-24 21:04:58,510 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-24 21:04:58,510 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:58,510 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-24 21:04:58,510 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:04:58,510 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-24 21:04:58,510 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:04:58,510 INFO ]: Found error trace [2018-06-24 21:04:58,510 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:58,511 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:58,513 INFO ]: Analyzing trace with hash -256862842, now seen corresponding path program 5 times [2018-06-24 21:04:58,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:58,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:58,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:58,514 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:04:58,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:58,538 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:58,660 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:58,660 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:58,660 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:04:58,668 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:04:58,686 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:04:58,686 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:58,687 INFO ]: Computing forward predicates... [2018-06-24 21:04:58,764 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:58,782 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:58,782 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-24 21:04:58,782 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:04:58,783 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:04:58,783 INFO ]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:04:58,783 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 15 states. [2018-06-24 21:04:59,330 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:59,330 INFO ]: Finished difference Result 35 states and 65 transitions. [2018-06-24 21:04:59,330 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 21:04:59,330 INFO ]: Start accepts. Automaton has 15 states. Word has length 11 [2018-06-24 21:04:59,331 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:59,331 INFO ]: With dead ends: 35 [2018-06-24 21:04:59,331 INFO ]: Without dead ends: 35 [2018-06-24 21:04:59,332 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=421, Invalid=839, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:04:59,332 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:04:59,333 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 14. [2018-06-24 21:04:59,334 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:04:59,334 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2018-06-24 21:04:59,334 INFO ]: Start accepts. Automaton has 14 states and 23 transitions. Word has length 11 [2018-06-24 21:04:59,334 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:59,334 INFO ]: Abstraction has 14 states and 23 transitions. [2018-06-24 21:04:59,334 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:04:59,334 INFO ]: Start isEmpty. Operand 14 states and 23 transitions. [2018-06-24 21:04:59,334 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:04:59,335 INFO ]: Found error trace [2018-06-24 21:04:59,335 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:59,335 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:59,335 INFO ]: Analyzing trace with hash 624660344, now seen corresponding path program 6 times [2018-06-24 21:04:59,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:59,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:59,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:59,336 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:04:59,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:59,349 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:59,416 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:59,416 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:59,416 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:04:59,422 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:04:59,443 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 21:04:59,443 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:59,445 INFO ]: Computing forward predicates... [2018-06-24 21:04:59,524 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:59,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:59,543 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-24 21:04:59,543 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:04:59,544 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:04:59,544 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:04:59,544 INFO ]: Start difference. First operand 14 states and 23 transitions. Second operand 17 states. [2018-06-24 21:04:59,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:59,997 INFO ]: Finished difference Result 43 states and 81 transitions. [2018-06-24 21:04:59,998 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 21:04:59,998 INFO ]: Start accepts. Automaton has 17 states. Word has length 12 [2018-06-24 21:04:59,998 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:59,999 INFO ]: With dead ends: 43 [2018-06-24 21:04:59,999 INFO ]: Without dead ends: 43 [2018-06-24 21:05:00,000 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=661, Invalid=1319, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 21:05:00,000 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 21:05:00,002 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 15. [2018-06-24 21:05:00,002 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:05:00,002 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 25 transitions. [2018-06-24 21:05:00,002 INFO ]: Start accepts. Automaton has 15 states and 25 transitions. Word has length 12 [2018-06-24 21:05:00,002 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:00,002 INFO ]: Abstraction has 15 states and 25 transitions. [2018-06-24 21:05:00,002 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:05:00,003 INFO ]: Start isEmpty. Operand 15 states and 25 transitions. [2018-06-24 21:05:00,003 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:05:00,003 INFO ]: Found error trace [2018-06-24 21:05:00,003 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-24 21:05:00,003 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:00,003 INFO ]: Analyzing trace with hash -2112891962, now seen corresponding path program 7 times [2018-06-24 21:05:00,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:00,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:00,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:00,004 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:00,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:00,017 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:00,276 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:00,276 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:00,276 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:00,282 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:00,303 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:00,304 INFO ]: Computing forward predicates... [2018-06-24 21:05:00,400 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:00,419 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:00,419 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-24 21:05:00,420 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:05:00,420 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:05:00,420 INFO ]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:05:00,420 INFO ]: Start difference. First operand 15 states and 25 transitions. Second operand 19 states. [2018-06-24 21:05:01,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:01,095 INFO ]: Finished difference Result 52 states and 99 transitions. [2018-06-24 21:05:01,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 21:05:01,095 INFO ]: Start accepts. Automaton has 19 states. Word has length 13 [2018-06-24 21:05:01,095 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:01,096 INFO ]: With dead ends: 52 [2018-06-24 21:05:01,096 INFO ]: Without dead ends: 52 [2018-06-24 21:05:01,097 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=991, Invalid=1979, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 21:05:01,097 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-24 21:05:01,099 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 16. [2018-06-24 21:05:01,099 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:05:01,099 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-24 21:05:01,099 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 13 [2018-06-24 21:05:01,099 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:01,099 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-24 21:05:01,099 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:05:01,100 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-24 21:05:01,100 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:05:01,100 INFO ]: Found error trace [2018-06-24 21:05:01,100 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-24 21:05:01,100 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:01,100 INFO ]: Analyzing trace with hash -1077667528, now seen corresponding path program 8 times [2018-06-24 21:05:01,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:01,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:01,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:01,101 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:01,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:01,119 INFO ]: Conjunction of SSA is sat [2018-06-24 21:05:01,122 INFO ]: Counterexample might be feasible [2018-06-24 21:05:01,136 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:05:01,137 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:05:01 BasicIcfg [2018-06-24 21:05:01,137 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:05:01,138 INFO ]: Toolchain (without parser) took 7076.62 ms. Allocated memory was 300.4 MB in the beginning and 383.8 MB in the end (delta: 83.4 MB). Free memory was 255.8 MB in the beginning and 310.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:05:01,139 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 300.4 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:05:01,139 INFO ]: ChcToBoogie took 59.13 ms. Allocated memory is still 300.4 MB. Free memory was 254.8 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:05:01,140 INFO ]: Boogie Preprocessor took 29.05 ms. Allocated memory is still 300.4 MB. Free memory was 252.8 MB in the beginning and 251.8 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-24 21:05:01,140 INFO ]: RCFGBuilder took 338.73 ms. Allocated memory is still 300.4 MB. Free memory was 251.8 MB in the beginning and 240.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:05:01,141 INFO ]: BlockEncodingV2 took 100.68 ms. Allocated memory is still 300.4 MB. Free memory was 240.8 MB in the beginning and 236.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:05:01,141 INFO ]: TraceAbstraction took 6538.17 ms. Allocated memory was 300.4 MB in the beginning and 383.8 MB in the end (delta: 83.4 MB). Free memory was 236.8 MB in the beginning and 310.1 MB in the end (delta: -73.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:05:01,145 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 24 edges - StatisticsResult: Encoded RCFG 8 locations, 17 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 300.4 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.13 ms. Allocated memory is still 300.4 MB. Free memory was 254.8 MB in the beginning and 252.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 29.05 ms. Allocated memory is still 300.4 MB. Free memory was 252.8 MB in the beginning and 251.8 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 338.73 ms. Allocated memory is still 300.4 MB. Free memory was 251.8 MB in the beginning and 240.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 100.68 ms. Allocated memory is still 300.4 MB. Free memory was 240.8 MB in the beginning and 236.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6538.17 ms. Allocated memory was 300.4 MB in the beginning and 383.8 MB in the end (delta: 83.4 MB). Free memory was 236.8 MB in the beginning and 310.1 MB in the end (delta: -73.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0); [L0] assume (((((hbv_False_1_Int + -1 == hbv_False_3_Int && hbv_False_2_Int + -1 == hbv_False_5_Int) && hbv_False_2_Int + -10 == 0) && !(hbv_False_2_Int <= 1)) && !(hbv_False_1_Int + hbv_False_4_Int + -10 == 0)) && !(hbv_False_1_Int <= 0)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int; [L0] havoc hbv_False_6_Int, hbv_False_3_Int, hbv_False_5_Int, hbv_False_2_Int, hbv_False_4_Int, hbv_False_1_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] assume (((hhv_REC_f_f_3_Int == hhv_REC_f_f_2_Int && hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int) && hhv_REC_f_f_2_Int <= 1; [L0] hhv_REC_f__0_Int, hhv_REC_f__1_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] havoc hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. UNSAFE Result, 6.4s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 152 SDtfs, 26 SDslu, 333 SDs, 0 SdLazy, 424 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=15, 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, 15 MinimizatonAttempts, 127 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 3673 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1027 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 3/175 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/014d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-05-01-155.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-05-01-155.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-05-01-155.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-05-01-155.csv Received shutdown request...