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/014c-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:04:50,637 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:04:50,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:04:50,650 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:04:50,651 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:04:50,652 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:04:50,653 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:04:50,655 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:04:50,657 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:04:50,657 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:04:50,658 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:04:50,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:04:50,659 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:04:50,661 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:04:50,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:04:50,662 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:04:50,664 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:04:50,666 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:04:50,667 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:04:50,668 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:04:50,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:04:50,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:04:50,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:04:50,673 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:04:50,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:04:50,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:04:50,675 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:04:50,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:04:50,677 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:04:50,677 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:04:50,678 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:04:50,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:04:50,679 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:04:50,680 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:04:50,680 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:04:50,681 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:50,694 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:04:50,695 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:04:50,695 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:04:50,695 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:04:50,696 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:04:50,697 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:04:50,697 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:04:50,697 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:04:50,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:04:50,698 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:04:50,698 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:04:50,698 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:04:50,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:04:50,699 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:04:50,699 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:04:50,699 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:04:50,699 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:04:50,700 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:04:50,700 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:04:50,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:04:50,700 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:04:50,702 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:04:50,702 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:04:50,740 INFO ]: Repository-Root is: /tmp [2018-06-24 21:04:50,751 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:04:50,755 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:04:50,756 INFO ]: Initializing SmtParser... [2018-06-24 21:04:50,757 INFO ]: SmtParser initialized [2018-06-24 21:04:50,757 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 [2018-06-24 21:04:50,758 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:50,859 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 unknown [2018-06-24 21:04:51,054 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 [2018-06-24 21:04:51,059 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:04:51,065 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:04:51,066 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:04:51,066 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:04:51,066 INFO ]: ChcToBoogie initialized [2018-06-24 21:04:51,069 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:04:51" (1/1) ... [2018-06-24 21:04:51,130 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:51 Unit [2018-06-24 21:04:51,130 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:04:51,130 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:04:51,131 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:04:51,131 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:04:51,153 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:51" (1/1) ... [2018-06-24 21:04:51,153 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:51" (1/1) ... [2018-06-24 21:04:51,159 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:51" (1/1) ... [2018-06-24 21:04:51,159 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:51" (1/1) ... [2018-06-24 21:04:51,164 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:51" (1/1) ... [2018-06-24 21:04:51,172 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:51" (1/1) ... [2018-06-24 21:04:51,173 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:51" (1/1) ... [2018-06-24 21:04:51,175 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:04:51,176 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:04:51,176 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:04:51,176 INFO ]: RCFGBuilder initialized [2018-06-24 21:04:51,177 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:51" (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:51,191 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:04:51,191 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:04:51,191 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:04:51,191 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:04:51,191 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:04:51,191 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:51,530 INFO ]: Using library mode [2018-06-24 21:04:51,531 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:04:51 BoogieIcfgContainer [2018-06-24 21:04:51,531 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:04:51,531 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:04:51,531 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:04:51,532 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:04:51,533 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:04:51" (1/1) ... [2018-06-24 21:04:51,548 INFO ]: Initial Icfg 12 locations, 24 edges [2018-06-24 21:04:51,549 INFO ]: Using Remove infeasible edges [2018-06-24 21:04:51,550 INFO ]: Using Maximize final states [2018-06-24 21:04:51,550 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:04:51,550 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:04:51,554 INFO ]: Using Remove sink states [2018-06-24 21:04:51,554 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:04:51,554 INFO ]: Using Use SBE [2018-06-24 21:04:51,560 INFO ]: SBE split 0 edges [2018-06-24 21:04:51,564 INFO ]: Removed 5 edges and 2 locations because of local infeasibility [2018-06-24 21:04:51,565 INFO ]: 0 new accepting states [2018-06-24 21:04:51,647 INFO ]: Removed 8 edges and 2 locations by large block encoding [2018-06-24 21:04:51,649 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:04:51,651 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:04:51,651 INFO ]: 0 new accepting states [2018-06-24 21:04:51,651 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:04:51,651 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:04:51,651 INFO ]: Encoded RCFG 8 locations, 17 edges [2018-06-24 21:04:51,654 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:04:51 BasicIcfg [2018-06-24 21:04:51,654 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:04:51,655 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:04:51,655 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:04:51,658 INFO ]: TraceAbstraction initialized [2018-06-24 21:04:51,658 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:04:51" (1/4) ... [2018-06-24 21:04:51,659 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cc0c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:04:51, skipping insertion in model container [2018-06-24 21:04:51,659 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:51" (2/4) ... [2018-06-24 21:04:51,659 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cc0c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:04:51, skipping insertion in model container [2018-06-24 21:04:51,660 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:04:51" (3/4) ... [2018-06-24 21:04:51,660 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cc0c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:04:51, skipping insertion in model container [2018-06-24 21:04:51,660 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:04:51" (4/4) ... [2018-06-24 21:04:51,665 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:04:51,674 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:04:51,692 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:04:51,725 INFO ]: Using default assertion order modulation [2018-06-24 21:04:51,725 INFO ]: Interprodecural is true [2018-06-24 21:04:51,725 INFO ]: Hoare is false [2018-06-24 21:04:51,725 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:04:51,725 INFO ]: Backedges is TWOTRACK [2018-06-24 21:04:51,725 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:04:51,725 INFO ]: Difference is false [2018-06-24 21:04:51,725 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:04:51,725 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:04:51,733 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 21:04:51,742 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:04:51,742 INFO ]: Found error trace [2018-06-24 21:04:51,743 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:04:51,743 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:51,748 INFO ]: Analyzing trace with hash 44148105, now seen corresponding path program 1 times [2018-06-24 21:04:51,750 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:51,750 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:51,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:51,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:51,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:51,827 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:51,876 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:51,878 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:51,878 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:04:51,879 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:04:51,891 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:04:51,891 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:51,893 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-24 21:04:52,035 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:52,035 INFO ]: Finished difference Result 11 states and 25 transitions. [2018-06-24 21:04:52,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:52,037 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:04:52,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:52,045 INFO ]: With dead ends: 11 [2018-06-24 21:04:52,045 INFO ]: Without dead ends: 11 [2018-06-24 21:04:52,047 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:52,061 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:04:52,083 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 21:04:52,084 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:04:52,085 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-06-24 21:04:52,086 INFO ]: Start accepts. Automaton has 9 states and 21 transitions. Word has length 5 [2018-06-24 21:04:52,087 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:52,087 INFO ]: Abstraction has 9 states and 21 transitions. [2018-06-24 21:04:52,087 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:04:52,087 INFO ]: Start isEmpty. Operand 9 states and 21 transitions. [2018-06-24 21:04:52,088 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:04:52,088 INFO ]: Found error trace [2018-06-24 21:04:52,088 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:04:52,088 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:52,088 INFO ]: Analyzing trace with hash 44178857, now seen corresponding path program 1 times [2018-06-24 21:04:52,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:52,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:52,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:52,090 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:52,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:52,099 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:52,238 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:52,238 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:52,238 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:04:52,239 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:04:52,239 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:04:52,239 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:52,240 INFO ]: Start difference. First operand 9 states and 21 transitions. Second operand 3 states. [2018-06-24 21:04:52,312 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:52,312 INFO ]: Finished difference Result 10 states and 22 transitions. [2018-06-24 21:04:52,313 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:52,313 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:04:52,313 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:52,313 INFO ]: With dead ends: 10 [2018-06-24 21:04:52,313 INFO ]: Without dead ends: 10 [2018-06-24 21:04:52,314 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:52,314 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:04:52,315 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:04:52,315 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:04:52,316 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-06-24 21:04:52,316 INFO ]: Start accepts. Automaton has 10 states and 22 transitions. Word has length 5 [2018-06-24 21:04:52,316 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:52,316 INFO ]: Abstraction has 10 states and 22 transitions. [2018-06-24 21:04:52,316 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:04:52,316 INFO ]: Start isEmpty. Operand 10 states and 22 transitions. [2018-06-24 21:04:52,316 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:04:52,316 INFO ]: Found error trace [2018-06-24 21:04:52,316 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:04:52,316 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:52,317 INFO ]: Analyzing trace with hash 44207687, now seen corresponding path program 1 times [2018-06-24 21:04:52,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:52,317 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:52,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:52,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:52,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:52,332 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:52,398 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:52,398 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:52,398 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:04:52,399 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:04:52,399 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:04:52,399 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:52,399 INFO ]: Start difference. First operand 10 states and 22 transitions. Second operand 3 states. [2018-06-24 21:04:52,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:52,506 INFO ]: Finished difference Result 14 states and 30 transitions. [2018-06-24 21:04:52,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:52,506 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:04:52,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:52,507 INFO ]: With dead ends: 14 [2018-06-24 21:04:52,507 INFO ]: Without dead ends: 14 [2018-06-24 21:04:52,507 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:52,507 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:04:52,510 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-24 21:04:52,510 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:04:52,510 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-06-24 21:04:52,510 INFO ]: Start accepts. Automaton has 12 states and 27 transitions. Word has length 5 [2018-06-24 21:04:52,510 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:52,510 INFO ]: Abstraction has 12 states and 27 transitions. [2018-06-24 21:04:52,510 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:04:52,511 INFO ]: Start isEmpty. Operand 12 states and 27 transitions. [2018-06-24 21:04:52,511 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:04:52,511 INFO ]: Found error trace [2018-06-24 21:04:52,511 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:04:52,511 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:52,511 INFO ]: Analyzing trace with hash 1367881399, now seen corresponding path program 1 times [2018-06-24 21:04:52,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:52,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:52,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:52,512 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:52,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:52,522 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:52,587 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:52,588 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:52,588 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-24 21:04:52,595 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:52,614 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:52,621 INFO ]: Computing forward predicates... [2018-06-24 21:04:52,638 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:52,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:52,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 21:04:52,663 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:04:52,663 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:04:52,663 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:04:52,663 INFO ]: Start difference. First operand 12 states and 27 transitions. Second operand 4 states. [2018-06-24 21:04:52,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:52,918 INFO ]: Finished difference Result 17 states and 39 transitions. [2018-06-24 21:04:52,920 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:04:52,920 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:04:52,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:52,920 INFO ]: With dead ends: 17 [2018-06-24 21:04:52,920 INFO ]: Without dead ends: 17 [2018-06-24 21:04:52,921 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 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:52,921 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:04:52,922 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-24 21:04:52,922 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:04:52,923 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2018-06-24 21:04:52,923 INFO ]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 6 [2018-06-24 21:04:52,923 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:52,923 INFO ]: Abstraction has 13 states and 31 transitions. [2018-06-24 21:04:52,923 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:04:52,923 INFO ]: Start isEmpty. Operand 13 states and 31 transitions. [2018-06-24 21:04:52,923 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:04:52,923 INFO ]: Found error trace [2018-06-24 21:04:52,923 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:04:52,923 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:52,924 INFO ]: Analyzing trace with hash 1368895254, now seen corresponding path program 1 times [2018-06-24 21:04:52,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:52,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:52,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:52,925 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:52,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:52,936 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:52,982 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:52,982 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:52,982 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:04:52,982 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:04:52,982 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:04:52,982 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:52,982 INFO ]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2018-06-24 21:04:53,020 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:53,020 INFO ]: Finished difference Result 14 states and 31 transitions. [2018-06-24 21:04:53,020 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:53,020 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:04:53,021 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:53,021 INFO ]: With dead ends: 14 [2018-06-24 21:04:53,021 INFO ]: Without dead ends: 13 [2018-06-24 21:04:53,021 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:53,022 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:04:53,023 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-24 21:04:53,023 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:04:53,024 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2018-06-24 21:04:53,024 INFO ]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 6 [2018-06-24 21:04:53,024 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:53,024 INFO ]: Abstraction has 12 states and 29 transitions. [2018-06-24 21:04:53,024 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:04:53,024 INFO ]: Start isEmpty. Operand 12 states and 29 transitions. [2018-06-24 21:04:53,024 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:04:53,024 INFO ]: Found error trace [2018-06-24 21:04:53,024 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:04:53,024 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:53,024 INFO ]: Analyzing trace with hash 1369728441, now seen corresponding path program 1 times [2018-06-24 21:04:53,025 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:53,025 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:53,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:53,025 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:53,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:53,035 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:53,064 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:53,064 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:53,064 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:53,071 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:53,099 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:53,100 INFO ]: Computing forward predicates... [2018-06-24 21:04:53,113 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:53,137 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:53,137 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 21:04:53,137 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:04:53,138 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:04:53,138 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:04:53,138 INFO ]: Start difference. First operand 12 states and 29 transitions. Second operand 4 states. [2018-06-24 21:04:53,203 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:53,203 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-24 21:04:53,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:53,205 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:04:53,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:53,205 INFO ]: With dead ends: 11 [2018-06-24 21:04:53,205 INFO ]: Without dead ends: 11 [2018-06-24 21:04:53,205 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 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:53,205 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:04:53,207 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 21:04:53,207 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:04:53,207 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-06-24 21:04:53,207 INFO ]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 6 [2018-06-24 21:04:53,207 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:53,207 INFO ]: Abstraction has 9 states and 14 transitions. [2018-06-24 21:04:53,207 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:04:53,207 INFO ]: Start isEmpty. Operand 9 states and 14 transitions. [2018-06-24 21:04:53,207 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:04:53,207 INFO ]: Found error trace [2018-06-24 21:04:53,207 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:04:53,207 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:53,208 INFO ]: Analyzing trace with hash 1369788984, now seen corresponding path program 1 times [2018-06-24 21:04:53,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:53,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:53,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:53,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:53,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:53,227 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:53,306 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:53,306 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:53,306 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:04:53,306 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:04:53,306 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:04:53,306 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:04:53,306 INFO ]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2018-06-24 21:04:53,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:53,492 INFO ]: Finished difference Result 14 states and 23 transitions. [2018-06-24 21:04:53,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:04:53,492 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:04:53,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:53,493 INFO ]: With dead ends: 14 [2018-06-24 21:04:53,493 INFO ]: Without dead ends: 14 [2018-06-24 21:04:53,493 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:53,493 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:04:53,495 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-24 21:04:53,495 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:04:53,495 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2018-06-24 21:04:53,495 INFO ]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 6 [2018-06-24 21:04:53,496 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:53,496 INFO ]: Abstraction has 11 states and 18 transitions. [2018-06-24 21:04:53,496 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:04:53,496 INFO ]: Start isEmpty. Operand 11 states and 18 transitions. [2018-06-24 21:04:53,496 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:04:53,496 INFO ]: Found error trace [2018-06-24 21:04:53,496 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:53,496 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:53,496 INFO ]: Analyzing trace with hash -488740602, now seen corresponding path program 1 times [2018-06-24 21:04:53,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:53,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:53,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:53,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:53,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:53,519 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:53,615 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:53,615 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:53,615 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:53,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:53,636 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:53,638 INFO ]: Computing forward predicates... [2018-06-24 21:04:53,811 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:53,831 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:53,831 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:04:53,831 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:04:53,831 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:04:53,831 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:04:53,831 INFO ]: Start difference. First operand 11 states and 18 transitions. Second operand 8 states. [2018-06-24 21:04:54,120 WARN ]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-24 21:04:54,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:54,138 INFO ]: Finished difference Result 16 states and 27 transitions. [2018-06-24 21:04:54,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:04:54,139 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:04:54,139 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:54,139 INFO ]: With dead ends: 16 [2018-06-24 21:04:54,139 INFO ]: Without dead ends: 16 [2018-06-24 21:04:54,140 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:04:54,140 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:04:54,141 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-06-24 21:04:54,141 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:04:54,141 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2018-06-24 21:04:54,141 INFO ]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 7 [2018-06-24 21:04:54,142 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:54,142 INFO ]: Abstraction has 11 states and 18 transitions. [2018-06-24 21:04:54,142 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:04:54,142 INFO ]: Start isEmpty. Operand 11 states and 18 transitions. [2018-06-24 21:04:54,142 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:04:54,142 INFO ]: Found error trace [2018-06-24 21:04:54,142 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:54,142 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:54,142 INFO ]: Analyzing trace with hash -486863769, now seen corresponding path program 1 times [2018-06-24 21:04:54,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:54,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:54,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:54,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:54,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:54,149 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:54,171 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:54,172 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:54,172 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:04:54,172 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:04:54,172 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:04:54,172 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:04:54,172 INFO ]: Start difference. First operand 11 states and 18 transitions. Second operand 4 states. [2018-06-24 21:04:54,185 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:54,185 INFO ]: Finished difference Result 11 states and 16 transitions. [2018-06-24 21:04:54,185 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:04:54,185 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 21:04:54,185 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:54,185 INFO ]: With dead ends: 11 [2018-06-24 21:04:54,185 INFO ]: Without dead ends: 10 [2018-06-24 21:04:54,186 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:54,186 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:04:54,187 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:04:54,187 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:04:54,187 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-24 21:04:54,187 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 7 [2018-06-24 21:04:54,187 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:54,187 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-24 21:04:54,187 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:04:54,187 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-24 21:04:54,187 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:04:54,187 INFO ]: Found error trace [2018-06-24 21:04:54,187 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:54,187 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:54,187 INFO ]: Analyzing trace with hash 251377014, now seen corresponding path program 1 times [2018-06-24 21:04:54,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:54,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:54,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:54,188 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:54,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:54,196 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:54,308 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:54,308 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:54,308 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) [2018-06-24 21:04:54,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:04:54,360 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:54,361 INFO ]: Computing forward predicates... [2018-06-24 21:04:54,373 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:54,403 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:54,403 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:04:54,404 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:04:54,404 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:04:54,404 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:04:54,404 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 5 states. [2018-06-24 21:04:54,585 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:54,585 INFO ]: Finished difference Result 11 states and 17 transitions. [2018-06-24 21:04:54,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:04:54,585 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 21:04:54,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:54,585 INFO ]: With dead ends: 11 [2018-06-24 21:04:54,585 INFO ]: Without dead ends: 11 [2018-06-24 21:04:54,585 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:54,585 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:04:54,586 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 21:04:54,586 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:04:54,586 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-24 21:04:54,586 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-24 21:04:54,586 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:54,586 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-24 21:04:54,586 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:04:54,586 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-24 21:04:54,587 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:04:54,587 INFO ]: Found error trace [2018-06-24 21:04:54,587 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:54,587 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:54,587 INFO ]: Analyzing trace with hash -799773304, now seen corresponding path program 2 times [2018-06-24 21:04:54,587 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:54,587 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:54,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:54,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:54,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:54,608 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:54,653 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:54,653 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:54,653 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:54,659 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:04:54,695 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:04:54,695 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:54,696 INFO ]: Computing forward predicates... [2018-06-24 21:04:54,702 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:54,723 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:54,723 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 21:04:54,723 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:04:54,723 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:04:54,723 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:04:54,723 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 6 states. [2018-06-24 21:04:54,781 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:54,781 INFO ]: Finished difference Result 12 states and 19 transitions. [2018-06-24 21:04:54,781 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:04:54,781 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-24 21:04:54,781 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:54,781 INFO ]: With dead ends: 12 [2018-06-24 21:04:54,782 INFO ]: Without dead ends: 12 [2018-06-24 21:04:54,782 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:04:54,782 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:04:54,783 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 21:04:54,783 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:04:54,783 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-24 21:04:54,783 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 9 [2018-06-24 21:04:54,784 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:54,784 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-24 21:04:54,784 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:04:54,784 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-24 21:04:54,784 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:04:54,784 INFO ]: Found error trace [2018-06-24 21:04:54,784 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:54,784 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:54,784 INFO ]: Analyzing trace with hash 974305206, now seen corresponding path program 3 times [2018-06-24 21:04:54,784 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:54,784 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:54,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:54,785 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:04:54,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:54,803 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:54,865 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:54,865 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:54,865 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:54,874 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:04:54,893 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:04:54,893 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:54,894 INFO ]: Computing forward predicates... [2018-06-24 21:04:54,958 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:54,978 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:54,978 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-24 21:04:54,978 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:04:54,978 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:04:54,978 INFO ]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:04:54,978 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 13 states. [2018-06-24 21:04:55,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:55,339 INFO ]: Finished difference Result 28 states and 51 transitions. [2018-06-24 21:04:55,340 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:04:55,340 INFO ]: Start accepts. Automaton has 13 states. Word has length 10 [2018-06-24 21:04:55,340 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:55,340 INFO ]: With dead ends: 28 [2018-06-24 21:04:55,340 INFO ]: Without dead ends: 28 [2018-06-24 21:04:55,341 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:55,341 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 21:04:55,343 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 13. [2018-06-24 21:04:55,343 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:04:55,343 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-24 21:04:55,343 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-24 21:04:55,343 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:55,343 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-24 21:04:55,343 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:04:55,343 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-24 21:04:55,343 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:04:55,343 INFO ]: Found error trace [2018-06-24 21:04:55,343 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:55,344 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:55,344 INFO ]: Analyzing trace with hash 136164168, now seen corresponding path program 4 times [2018-06-24 21:04:55,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:55,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:55,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:55,344 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:04:55,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:55,372 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:55,510 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:55,510 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:55,510 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:55,518 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:04:55,536 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:04:55,536 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:55,538 INFO ]: Computing forward predicates... [2018-06-24 21:04:55,644 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:55,664 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:55,664 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-24 21:04:55,664 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:04:55,664 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:04:55,664 INFO ]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:04:55,665 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 15 states. [2018-06-24 21:04:56,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:56,290 INFO ]: Finished difference Result 35 states and 65 transitions. [2018-06-24 21:04:56,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 21:04:56,291 INFO ]: Start accepts. Automaton has 15 states. Word has length 11 [2018-06-24 21:04:56,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:56,291 INFO ]: With dead ends: 35 [2018-06-24 21:04:56,291 INFO ]: Without dead ends: 35 [2018-06-24 21:04:56,292 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=421, Invalid=839, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:04:56,292 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:04:56,294 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 14. [2018-06-24 21:04:56,294 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:04:56,294 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2018-06-24 21:04:56,294 INFO ]: Start accepts. Automaton has 14 states and 23 transitions. Word has length 11 [2018-06-24 21:04:56,295 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:56,295 INFO ]: Abstraction has 14 states and 23 transitions. [2018-06-24 21:04:56,295 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:04:56,295 INFO ]: Start isEmpty. Operand 14 states and 23 transitions. [2018-06-24 21:04:56,295 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:04:56,295 INFO ]: Found error trace [2018-06-24 21:04:56,295 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:56,295 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:56,295 INFO ]: Analyzing trace with hash -76404234, now seen corresponding path program 5 times [2018-06-24 21:04:56,295 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:56,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:56,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:56,296 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:04:56,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:56,308 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:56,707 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:56,707 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:56,707 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:56,713 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:04:56,769 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:04:56,769 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:56,771 INFO ]: Computing forward predicates... [2018-06-24 21:04:56,909 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:56,928 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:56,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-24 21:04:56,928 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:04:56,929 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:04:56,929 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:04:56,929 INFO ]: Start difference. First operand 14 states and 23 transitions. Second operand 17 states. [2018-06-24 21:04:57,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:57,389 INFO ]: Finished difference Result 43 states and 81 transitions. [2018-06-24 21:04:57,389 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 21:04:57,389 INFO ]: Start accepts. Automaton has 17 states. Word has length 12 [2018-06-24 21:04:57,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:57,390 INFO ]: With dead ends: 43 [2018-06-24 21:04:57,390 INFO ]: Without dead ends: 43 [2018-06-24 21:04:57,391 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=661, Invalid=1319, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 21:04:57,391 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 21:04:57,393 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 15. [2018-06-24 21:04:57,393 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:04:57,394 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 25 transitions. [2018-06-24 21:04:57,394 INFO ]: Start accepts. Automaton has 15 states and 25 transitions. Word has length 12 [2018-06-24 21:04:57,394 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:57,394 INFO ]: Abstraction has 15 states and 25 transitions. [2018-06-24 21:04:57,394 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:04:57,394 INFO ]: Start isEmpty. Operand 15 states and 25 transitions. [2018-06-24 21:04:57,394 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:04:57,394 INFO ]: Found error trace [2018-06-24 21:04:57,394 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:57,394 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:57,394 INFO ]: Analyzing trace with hash 1923909896, now seen corresponding path program 6 times [2018-06-24 21:04:57,394 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:57,394 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:57,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:57,395 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:04:57,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:57,408 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:57,529 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:04:57,529 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:57,529 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:04:57,535 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:04:57,566 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 21:04:57,566 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:57,568 INFO ]: Computing forward predicates... [2018-06-24 21:04:57,776 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:04:57,801 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:57,802 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-24 21:04:57,802 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:04:57,802 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:04:57,802 INFO ]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:04:57,802 INFO ]: Start difference. First operand 15 states and 25 transitions. Second operand 19 states. [2018-06-24 21:04:58,370 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:58,370 INFO ]: Finished difference Result 52 states and 99 transitions. [2018-06-24 21:04:58,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 21:04:58,370 INFO ]: Start accepts. Automaton has 19 states. Word has length 13 [2018-06-24 21:04:58,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:58,371 INFO ]: With dead ends: 52 [2018-06-24 21:04:58,371 INFO ]: Without dead ends: 52 [2018-06-24 21:04:58,372 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=991, Invalid=1979, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 21:04:58,372 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-24 21:04:58,374 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 16. [2018-06-24 21:04:58,374 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:04:58,374 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-24 21:04:58,374 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 13 [2018-06-24 21:04:58,374 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:58,374 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-24 21:04:58,374 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:04:58,374 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-24 21:04:58,375 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:04:58,375 INFO ]: Found error trace [2018-06-24 21:04:58,375 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:58,375 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:58,375 INFO ]: Analyzing trace with hash -490861514, now seen corresponding path program 7 times [2018-06-24 21:04:58,375 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:58,375 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:58,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:58,376 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:04:58,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:58,393 INFO ]: Conjunction of SSA is sat [2018-06-24 21:04:58,396 INFO ]: Counterexample might be feasible [2018-06-24 21:04:58,409 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:04:58,410 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:04:58 BasicIcfg [2018-06-24 21:04:58,410 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:04:58,411 INFO ]: Toolchain (without parser) took 7351.98 ms. Allocated memory was 309.3 MB in the beginning and 381.7 MB in the end (delta: 72.4 MB). Free memory was 264.7 MB in the beginning and 296.5 MB in the end (delta: -31.8 MB). Peak memory consumption was 40.5 MB. Max. memory is 3.6 GB. [2018-06-24 21:04:58,412 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:04:58,412 INFO ]: ChcToBoogie took 64.51 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 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:04:58,413 INFO ]: Boogie Preprocessor took 44.57 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 260.7 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:04:58,413 INFO ]: RCFGBuilder took 355.36 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 249.7 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:04:58,414 INFO ]: BlockEncodingV2 took 122.58 ms. Allocated memory is still 309.3 MB. Free memory was 249.7 MB in the beginning and 245.7 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:04:58,414 INFO ]: TraceAbstraction took 6755.60 ms. Allocated memory was 309.3 MB in the beginning and 381.7 MB in the end (delta: 72.4 MB). Free memory was 245.7 MB in the beginning and 296.5 MB in the end (delta: -50.8 MB). Peak memory consumption was 21.6 MB. Max. memory is 3.6 GB. [2018-06-24 21:04:58,417 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 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.51 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.57 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 355.36 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 249.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 122.58 ms. Allocated memory is still 309.3 MB. Free memory was 249.7 MB in the beginning and 245.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6755.60 ms. Allocated memory was 309.3 MB in the beginning and 381.7 MB in the end (delta: 72.4 MB). Free memory was 245.7 MB in the beginning and 296.5 MB in the end (delta: -50.8 MB). Peak memory consumption was 21.6 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_2_Int, hbv_False_3_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_1_Int, hbv_False_4_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_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_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_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_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_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_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_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_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_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_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_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_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_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_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_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_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_1_Int, hbv_REC_f_f_2_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.6s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 35 SDslu, 322 SDs, 0 SdLazy, 394 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 3.4s 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, 119 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 3588 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1018 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 2/174 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/014c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-04-58-428.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-04-58-428.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-04-58-428.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-04-58-428.csv Received shutdown request...