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/025d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:09:08,953 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:09:08,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:09:08,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:09:08,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:09:08,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:09:08,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:09:08,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:09:08,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:09:08,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:09:08,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:09:08,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:09:08,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:09:08,981 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:09:08,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:09:08,988 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:09:08,990 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:09:08,992 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:09:09,002 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:09:09,003 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:09:09,005 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:09:09,007 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:09:09,007 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:09:09,007 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:09:09,008 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:09:09,009 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:09:09,010 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:09:09,011 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:09:09,018 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:09:09,018 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:09:09,018 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:09:09,019 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:09:09,019 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:09:09,020 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:09:09,021 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:09:09,021 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:09:09,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:09:09,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:09:09,047 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:09:09,047 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:09:09,048 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:09:09,049 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:09:09,049 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:09:09,049 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:09:09,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:09:09,049 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:09:09,050 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:09:09,050 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:09:09,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:09:09,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:09:09,050 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:09:09,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:09:09,052 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:09:09,052 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:09:09,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:09:09,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:09:09,053 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:09:09,054 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:09:09,054 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:09:09,091 INFO ]: Repository-Root is: /tmp [2018-06-24 21:09:09,104 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:09:09,108 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:09:09,109 INFO ]: Initializing SmtParser... [2018-06-24 21:09:09,109 INFO ]: SmtParser initialized [2018-06-24 21:09:09,110 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/025d-horn.smt2 [2018-06-24 21:09:09,111 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:09:09,210 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025d-horn.smt2 unknown [2018-06-24 21:09:09,475 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025d-horn.smt2 [2018-06-24 21:09:09,484 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:09:09,488 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:09:09,488 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:09:09,488 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:09:09,489 INFO ]: ChcToBoogie initialized [2018-06-24 21:09:09,491 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:09:09" (1/1) ... [2018-06-24 21:09:09,551 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:09 Unit [2018-06-24 21:09:09,551 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:09:09,552 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:09:09,552 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:09:09,552 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:09:09,577 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:09" (1/1) ... [2018-06-24 21:09:09,577 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:09" (1/1) ... [2018-06-24 21:09:09,584 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:09" (1/1) ... [2018-06-24 21:09:09,584 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:09" (1/1) ... [2018-06-24 21:09:09,589 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:09" (1/1) ... [2018-06-24 21:09:09,600 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:09" (1/1) ... [2018-06-24 21:09:09,601 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:09" (1/1) ... [2018-06-24 21:09:09,603 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:09:09,603 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:09:09,603 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:09:09,603 INFO ]: RCFGBuilder initialized [2018-06-24 21:09:09,604 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:09" (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:09:09,614 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:09:09,614 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:09:09,614 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:09:09,614 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:09:09,615 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:09:09,615 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:09:09,938 INFO ]: Using library mode [2018-06-24 21:09:09,939 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:09:09 BoogieIcfgContainer [2018-06-24 21:09:09,939 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:09:09,939 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:09:09,940 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:09:09,940 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:09:09,941 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:09:09" (1/1) ... [2018-06-24 21:09:09,960 INFO ]: Initial Icfg 12 locations, 23 edges [2018-06-24 21:09:09,962 INFO ]: Using Remove infeasible edges [2018-06-24 21:09:09,963 INFO ]: Using Maximize final states [2018-06-24 21:09:09,964 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:09:09,964 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:09:09,966 INFO ]: Using Remove sink states [2018-06-24 21:09:09,967 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:09:09,967 INFO ]: Using Use SBE [2018-06-24 21:09:09,974 INFO ]: SBE split 0 edges [2018-06-24 21:09:09,979 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:09:09,981 INFO ]: 0 new accepting states [2018-06-24 21:09:10,013 INFO ]: Removed 6 edges and 2 locations by large block encoding [2018-06-24 21:09:10,015 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:09:10,017 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:09:10,017 INFO ]: 0 new accepting states [2018-06-24 21:09:10,018 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:09:10,018 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:09:10,018 INFO ]: Encoded RCFG 8 locations, 19 edges [2018-06-24 21:09:10,018 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:09:10 BasicIcfg [2018-06-24 21:09:10,018 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:09:10,019 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:09:10,020 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:09:10,023 INFO ]: TraceAbstraction initialized [2018-06-24 21:09:10,023 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:09:09" (1/4) ... [2018-06-24 21:09:10,024 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc8f2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:09:10, skipping insertion in model container [2018-06-24 21:09:10,024 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:09:09" (2/4) ... [2018-06-24 21:09:10,024 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc8f2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:09:10, skipping insertion in model container [2018-06-24 21:09:10,024 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:09:09" (3/4) ... [2018-06-24 21:09:10,024 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc8f2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:09:10, skipping insertion in model container [2018-06-24 21:09:10,024 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:09:10" (4/4) ... [2018-06-24 21:09:10,026 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:09:10,034 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:09:10,042 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:09:10,079 INFO ]: Using default assertion order modulation [2018-06-24 21:09:10,079 INFO ]: Interprodecural is true [2018-06-24 21:09:10,079 INFO ]: Hoare is false [2018-06-24 21:09:10,079 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:09:10,079 INFO ]: Backedges is TWOTRACK [2018-06-24 21:09:10,079 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:09:10,079 INFO ]: Difference is false [2018-06-24 21:09:10,080 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:09:10,080 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:09:10,088 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 21:09:10,097 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:09:10,097 INFO ]: Found error trace [2018-06-24 21:09:10,098 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:09:10,098 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:10,102 INFO ]: Analyzing trace with hash 47810449, now seen corresponding path program 1 times [2018-06-24 21:09:10,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:10,104 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:10,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:10,134 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:10,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:10,183 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:10,403 WARN ]: Spent 154.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-06-24 21:09:10,406 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:09:10,407 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:09:10,407 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:09:10,409 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:09:10,422 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:09:10,422 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:09:10,425 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-24 21:09:10,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:10,645 INFO ]: Finished difference Result 12 states and 34 transitions. [2018-06-24 21:09:10,646 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:09:10,648 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:09:10,648 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:10,659 INFO ]: With dead ends: 12 [2018-06-24 21:09:10,659 INFO ]: Without dead ends: 12 [2018-06-24 21:09:10,665 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:09:10,685 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:09:10,702 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-24 21:09:10,703 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:09:10,703 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-06-24 21:09:10,705 INFO ]: Start accepts. Automaton has 9 states and 27 transitions. Word has length 5 [2018-06-24 21:09:10,706 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:10,706 INFO ]: Abstraction has 9 states and 27 transitions. [2018-06-24 21:09:10,706 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:09:10,706 INFO ]: Start isEmpty. Operand 9 states and 27 transitions. [2018-06-24 21:09:10,706 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:09:10,706 INFO ]: Found error trace [2018-06-24 21:09:10,706 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:09:10,706 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:10,707 INFO ]: Analyzing trace with hash 1481561906, now seen corresponding path program 1 times [2018-06-24 21:09:10,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:10,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:10,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:10,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:10,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:10,720 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:10,744 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:09:10,745 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:09:10,745 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:09:10,746 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:09:10,746 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:09:10,746 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:09:10,747 INFO ]: Start difference. First operand 9 states and 27 transitions. Second operand 3 states. [2018-06-24 21:09:10,843 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:10,843 INFO ]: Finished difference Result 12 states and 37 transitions. [2018-06-24 21:09:10,843 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:09:10,843 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:09:10,843 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:10,844 INFO ]: With dead ends: 12 [2018-06-24 21:09:10,844 INFO ]: Without dead ends: 12 [2018-06-24 21:09:10,845 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:09:10,845 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:09:10,847 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 21:09:10,847 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:09:10,847 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2018-06-24 21:09:10,847 INFO ]: Start accepts. Automaton has 10 states and 33 transitions. Word has length 6 [2018-06-24 21:09:10,847 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:10,848 INFO ]: Abstraction has 10 states and 33 transitions. [2018-06-24 21:09:10,848 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:09:10,848 INFO ]: Start isEmpty. Operand 10 states and 33 transitions. [2018-06-24 21:09:10,848 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:09:10,848 INFO ]: Found error trace [2018-06-24 21:09:10,848 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:09:10,848 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:10,848 INFO ]: Analyzing trace with hash 1481589775, now seen corresponding path program 1 times [2018-06-24 21:09:10,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:10,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:10,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:10,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:10,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:10,855 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:10,870 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:09:10,870 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:09:10,870 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:09:10,871 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:09:10,871 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:09:10,871 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:09:10,871 INFO ]: Start difference. First operand 10 states and 33 transitions. Second operand 3 states. [2018-06-24 21:09:10,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:10,929 INFO ]: Finished difference Result 8 states and 17 transitions. [2018-06-24 21:09:10,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:09:10,930 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:09:10,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:10,930 INFO ]: With dead ends: 8 [2018-06-24 21:09:10,930 INFO ]: Without dead ends: 8 [2018-06-24 21:09:10,931 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:09:10,931 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 21:09:10,932 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-24 21:09:10,932 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:09:10,932 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-06-24 21:09:10,932 INFO ]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 6 [2018-06-24 21:09:10,932 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:10,932 INFO ]: Abstraction has 7 states and 13 transitions. [2018-06-24 21:09:10,932 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:09:10,932 INFO ]: Start isEmpty. Operand 7 states and 13 transitions. [2018-06-24 21:09:10,932 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:09:10,932 INFO ]: Found error trace [2018-06-24 21:09:10,932 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:09:10,932 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:10,933 INFO ]: Analyzing trace with hash 1481651279, now seen corresponding path program 1 times [2018-06-24 21:09:10,933 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:10,933 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:10,933 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:10,933 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:10,933 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:10,955 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:11,000 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:09:11,000 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:11,000 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:09:11,006 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:11,024 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:11,029 INFO ]: Computing forward predicates... [2018-06-24 21:09:11,080 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:09:11,098 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:11,098 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 21:09:11,098 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:09:11,099 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:09:11,099 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:09:11,099 INFO ]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2018-06-24 21:09:11,301 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:11,301 INFO ]: Finished difference Result 11 states and 29 transitions. [2018-06-24 21:09:11,302 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:09:11,302 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:09:11,302 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:11,302 INFO ]: With dead ends: 11 [2018-06-24 21:09:11,302 INFO ]: Without dead ends: 11 [2018-06-24 21:09:11,303 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:09:11,303 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:09:11,304 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 21:09:11,304 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:09:11,304 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-06-24 21:09:11,304 INFO ]: Start accepts. Automaton has 9 states and 21 transitions. Word has length 6 [2018-06-24 21:09:11,304 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:11,305 INFO ]: Abstraction has 9 states and 21 transitions. [2018-06-24 21:09:11,305 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:09:11,305 INFO ]: Start isEmpty. Operand 9 states and 21 transitions. [2018-06-24 21:09:11,305 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:09:11,305 INFO ]: Found error trace [2018-06-24 21:09:11,305 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:09:11,305 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:11,305 INFO ]: Analyzing trace with hash 1481681070, now seen corresponding path program 1 times [2018-06-24 21:09:11,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:11,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:11,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:11,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:11,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:11,318 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:11,507 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:09:11,507 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:11,507 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:09:11,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:11,545 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:11,547 INFO ]: Computing forward predicates... [2018-06-24 21:09:11,572 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:09:11,604 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:11,604 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 21:09:11,604 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:09:11,604 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:09:11,604 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:09:11,604 INFO ]: Start difference. First operand 9 states and 21 transitions. Second operand 5 states. [2018-06-24 21:09:11,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:11,809 INFO ]: Finished difference Result 11 states and 29 transitions. [2018-06-24 21:09:11,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:09:11,810 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:09:11,810 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:11,810 INFO ]: With dead ends: 11 [2018-06-24 21:09:11,810 INFO ]: Without dead ends: 11 [2018-06-24 21:09:11,811 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:09:11,811 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:09:11,812 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 21:09:11,812 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:09:11,812 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-06-24 21:09:11,812 INFO ]: Start accepts. Automaton has 9 states and 21 transitions. Word has length 6 [2018-06-24 21:09:11,812 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:11,812 INFO ]: Abstraction has 9 states and 21 transitions. [2018-06-24 21:09:11,812 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:09:11,812 INFO ]: Start isEmpty. Operand 9 states and 21 transitions. [2018-06-24 21:09:11,813 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:09:11,813 INFO ]: Found error trace [2018-06-24 21:09:11,813 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:11,813 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:11,813 INFO ]: Analyzing trace with hash -1316693810, now seen corresponding path program 1 times [2018-06-24 21:09:11,813 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:11,813 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:11,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:11,814 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:11,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:11,827 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:11,889 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:11,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:11,889 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:09:11,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:11,912 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:11,913 INFO ]: Computing forward predicates... [2018-06-24 21:09:12,263 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:12,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:12,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-06-24 21:09:12,283 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:09:12,283 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:09:12,283 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:09:12,283 INFO ]: Start difference. First operand 9 states and 21 transitions. Second operand 7 states. [2018-06-24 21:09:12,397 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:12,398 INFO ]: Finished difference Result 11 states and 29 transitions. [2018-06-24 21:09:12,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:09:12,398 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 21:09:12,398 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:12,398 INFO ]: With dead ends: 11 [2018-06-24 21:09:12,398 INFO ]: Without dead ends: 11 [2018-06-24 21:09:12,399 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:09:12,399 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:09:12,400 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-24 21:09:12,400 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:09:12,400 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2018-06-24 21:09:12,400 INFO ]: Start accepts. Automaton has 10 states and 25 transitions. Word has length 7 [2018-06-24 21:09:12,400 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:12,400 INFO ]: Abstraction has 10 states and 25 transitions. [2018-06-24 21:09:12,400 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:09:12,401 INFO ]: Start isEmpty. Operand 10 states and 25 transitions. [2018-06-24 21:09:12,401 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:09:12,401 INFO ]: Found error trace [2018-06-24 21:09:12,401 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:12,401 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:12,401 INFO ]: Analyzing trace with hash -1312999726, now seen corresponding path program 1 times [2018-06-24 21:09:12,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:12,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:12,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:12,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:12,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:12,413 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:12,494 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:09:12,494 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:12,494 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:09:12,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:12,515 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:12,517 INFO ]: Computing forward predicates... [2018-06-24 21:09:12,617 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:09:12,635 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:12,636 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:09:12,636 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:09:12,636 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:09:12,636 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:09:12,636 INFO ]: Start difference. First operand 10 states and 25 transitions. Second operand 8 states. [2018-06-24 21:09:12,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:12,767 INFO ]: Finished difference Result 19 states and 61 transitions. [2018-06-24 21:09:12,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:09:12,768 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:09:12,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:12,769 INFO ]: With dead ends: 19 [2018-06-24 21:09:12,769 INFO ]: Without dead ends: 19 [2018-06-24 21:09:12,769 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:09:12,769 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 21:09:12,771 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 11. [2018-06-24 21:09:12,771 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:09:12,772 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2018-06-24 21:09:12,772 INFO ]: Start accepts. Automaton has 11 states and 29 transitions. Word has length 7 [2018-06-24 21:09:12,772 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:12,772 INFO ]: Abstraction has 11 states and 29 transitions. [2018-06-24 21:09:12,772 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:09:12,772 INFO ]: Start isEmpty. Operand 11 states and 29 transitions. [2018-06-24 21:09:12,772 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:09:12,772 INFO ]: Found error trace [2018-06-24 21:09:12,772 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 21:09:12,772 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:12,773 INFO ]: Analyzing trace with hash -1312969935, now seen corresponding path program 2 times [2018-06-24 21:09:12,773 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:12,773 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:12,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:12,773 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:12,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:12,786 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:12,852 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:09:12,852 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:12,852 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:09:12,858 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:09:12,876 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:09:12,876 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:12,878 INFO ]: Computing forward predicates... [2018-06-24 21:09:13,052 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:09:13,083 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:13,083 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 21:09:13,083 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:09:13,083 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:09:13,083 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:09:13,083 INFO ]: Start difference. First operand 11 states and 29 transitions. Second operand 7 states. [2018-06-24 21:09:13,409 WARN ]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-24 21:09:13,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:13,492 INFO ]: Finished difference Result 17 states and 53 transitions. [2018-06-24 21:09:13,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:09:13,493 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 21:09:13,493 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:13,493 INFO ]: With dead ends: 17 [2018-06-24 21:09:13,493 INFO ]: Without dead ends: 17 [2018-06-24 21:09:13,493 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:09:13,494 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:09:13,495 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-06-24 21:09:13,495 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:09:13,495 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2018-06-24 21:09:13,496 INFO ]: Start accepts. Automaton has 12 states and 33 transitions. Word has length 7 [2018-06-24 21:09:13,496 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:13,496 INFO ]: Abstraction has 12 states and 33 transitions. [2018-06-24 21:09:13,496 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:09:13,496 INFO ]: Start isEmpty. Operand 12 states and 33 transitions. [2018-06-24 21:09:13,496 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:09:13,496 INFO ]: Found error trace [2018-06-24 21:09:13,496 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:13,496 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:13,496 INFO ]: Analyzing trace with hash 2131692210, now seen corresponding path program 2 times [2018-06-24 21:09:13,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:13,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:13,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:13,497 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:13,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:13,508 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:13,567 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:13,567 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:13,567 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:09:13,573 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:09:13,586 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:09:13,586 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:13,587 INFO ]: Computing forward predicates... [2018-06-24 21:09:13,652 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:09:13,671 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:13,671 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-24 21:09:13,671 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:09:13,672 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:09:13,672 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:09:13,672 INFO ]: Start difference. First operand 12 states and 33 transitions. Second operand 9 states. [2018-06-24 21:09:14,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:14,117 INFO ]: Finished difference Result 24 states and 81 transitions. [2018-06-24 21:09:14,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:09:14,118 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-24 21:09:14,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:14,119 INFO ]: With dead ends: 24 [2018-06-24 21:09:14,119 INFO ]: Without dead ends: 24 [2018-06-24 21:09:14,119 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:09:14,119 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 21:09:14,121 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 13. [2018-06-24 21:09:14,121 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:09:14,121 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2018-06-24 21:09:14,122 INFO ]: Start accepts. Automaton has 13 states and 37 transitions. Word has length 8 [2018-06-24 21:09:14,122 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:14,126 INFO ]: Abstraction has 13 states and 37 transitions. [2018-06-24 21:09:14,126 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:09:14,126 INFO ]: Start isEmpty. Operand 13 states and 37 transitions. [2018-06-24 21:09:14,126 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:09:14,126 INFO ]: Found error trace [2018-06-24 21:09:14,126 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:14,126 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:14,127 INFO ]: Analyzing trace with hash -2047834961, now seen corresponding path program 2 times [2018-06-24 21:09:14,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:14,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:14,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:14,127 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:14,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:14,156 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:14,210 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:09:14,210 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:14,210 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:09:14,217 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:09:14,229 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:09:14,229 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:14,230 INFO ]: Computing forward predicates... [2018-06-24 21:09:14,333 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:09:14,352 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:14,352 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:09:14,352 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:09:14,352 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:09:14,353 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:09:14,353 INFO ]: Start difference. First operand 13 states and 37 transitions. Second operand 10 states. [2018-06-24 21:09:14,886 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 14 [2018-06-24 21:09:15,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:15,504 INFO ]: Finished difference Result 29 states and 101 transitions. [2018-06-24 21:09:15,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:09:15,505 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 21:09:15,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:15,506 INFO ]: With dead ends: 29 [2018-06-24 21:09:15,506 INFO ]: Without dead ends: 29 [2018-06-24 21:09:15,506 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:09:15,506 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:09:15,508 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 13. [2018-06-24 21:09:15,508 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:09:15,509 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2018-06-24 21:09:15,509 INFO ]: Start accepts. Automaton has 13 states and 37 transitions. Word has length 8 [2018-06-24 21:09:15,509 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:15,509 INFO ]: Abstraction has 13 states and 37 transitions. [2018-06-24 21:09:15,509 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:09:15,509 INFO ]: Start isEmpty. Operand 13 states and 37 transitions. [2018-06-24 21:09:15,509 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:15,509 INFO ]: Found error trace [2018-06-24 21:09:15,509 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:15,509 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:15,510 INFO ]: Analyzing trace with hash 1657476430, now seen corresponding path program 3 times [2018-06-24 21:09:15,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:15,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:15,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:15,510 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:15,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:15,522 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:15,606 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:09:15,606 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:15,606 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:09:15,613 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:09:15,629 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:09:15,629 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:15,631 INFO ]: Computing forward predicates... [2018-06-24 21:09:15,886 INFO ]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:15,913 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:15,913 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:09:15,914 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:09:15,914 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:09:15,914 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:09:15,914 INFO ]: Start difference. First operand 13 states and 37 transitions. Second operand 12 states. [2018-06-24 21:09:16,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:16,777 INFO ]: Finished difference Result 25 states and 85 transitions. [2018-06-24 21:09:16,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 21:09:16,779 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 21:09:16,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:16,780 INFO ]: With dead ends: 25 [2018-06-24 21:09:16,780 INFO ]: Without dead ends: 25 [2018-06-24 21:09:16,780 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:09:16,780 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 21:09:16,782 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-06-24 21:09:16,782 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:09:16,783 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2018-06-24 21:09:16,783 INFO ]: Start accepts. Automaton has 15 states and 45 transitions. Word has length 9 [2018-06-24 21:09:16,783 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:16,783 INFO ]: Abstraction has 15 states and 45 transitions. [2018-06-24 21:09:16,783 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:09:16,783 INFO ]: Start isEmpty. Operand 15 states and 45 transitions. [2018-06-24 21:09:16,784 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:16,784 INFO ]: Found error trace [2018-06-24 21:09:16,786 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:16,786 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:16,786 INFO ]: Analyzing trace with hash 942076530, now seen corresponding path program 3 times [2018-06-24 21:09:16,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:16,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:16,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:16,787 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:16,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:16,808 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:16,994 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:09:16,994 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:16,994 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:09:16,999 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:09:17,015 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:09:17,015 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:17,016 INFO ]: Computing forward predicates... [2018-06-24 21:09:17,137 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:09:17,157 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:17,157 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:09:17,158 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:09:17,158 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:09:17,158 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:09:17,158 INFO ]: Start difference. First operand 15 states and 45 transitions. Second operand 12 states. [2018-06-24 21:09:17,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:17,463 INFO ]: Finished difference Result 37 states and 133 transitions. [2018-06-24 21:09:17,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:09:17,464 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 21:09:17,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:17,465 INFO ]: With dead ends: 37 [2018-06-24 21:09:17,465 INFO ]: Without dead ends: 37 [2018-06-24 21:09:17,465 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:09:17,465 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 21:09:17,468 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 16. [2018-06-24 21:09:17,468 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:09:17,468 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2018-06-24 21:09:17,468 INFO ]: Start accepts. Automaton has 16 states and 49 transitions. Word has length 9 [2018-06-24 21:09:17,468 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:17,468 INFO ]: Abstraction has 16 states and 49 transitions. [2018-06-24 21:09:17,468 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:09:17,468 INFO ]: Start isEmpty. Operand 16 states and 49 transitions. [2018-06-24 21:09:17,469 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:09:17,469 INFO ]: Found error trace [2018-06-24 21:09:17,469 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 21:09:17,469 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:17,469 INFO ]: Analyzing trace with hash 942106321, now seen corresponding path program 3 times [2018-06-24 21:09:17,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:17,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:17,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:17,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:17,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:17,487 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:17,596 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:09:17,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:17,596 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:09:17,603 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:09:17,657 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:09:17,657 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:17,660 INFO ]: Computing forward predicates... [2018-06-24 21:09:18,005 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:09:18,034 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:18,035 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-24 21:09:18,035 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:09:18,035 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:09:18,035 INFO ]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:09:18,035 INFO ]: Start difference. First operand 16 states and 49 transitions. Second operand 11 states. [2018-06-24 21:09:18,493 WARN ]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-06-24 21:09:25,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:25,147 INFO ]: Finished difference Result 24 states and 81 transitions. [2018-06-24 21:09:25,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:09:25,147 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-24 21:09:25,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:25,148 INFO ]: With dead ends: 24 [2018-06-24 21:09:25,148 INFO ]: Without dead ends: 24 [2018-06-24 21:09:25,148 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:09:25,148 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 21:09:25,150 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-06-24 21:09:25,150 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:09:25,151 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 57 transitions. [2018-06-24 21:09:25,151 INFO ]: Start accepts. Automaton has 18 states and 57 transitions. Word has length 9 [2018-06-24 21:09:25,151 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:25,151 INFO ]: Abstraction has 18 states and 57 transitions. [2018-06-24 21:09:25,151 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:09:25,151 INFO ]: Start isEmpty. Operand 18 states and 57 transitions. [2018-06-24 21:09:25,151 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:09:25,151 INFO ]: Found error trace [2018-06-24 21:09:25,152 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:25,152 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:25,152 INFO ]: Analyzing trace with hash 729192819, now seen corresponding path program 1 times [2018-06-24 21:09:25,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:25,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:25,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:25,153 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:25,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:25,178 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:25,264 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:09:25,264 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:25,264 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:09:25,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:25,288 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:25,289 INFO ]: Computing forward predicates... [2018-06-24 21:09:25,421 INFO ]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:09:25,443 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:25,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-24 21:09:25,444 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:09:25,444 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:09:25,444 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:09:25,444 INFO ]: Start difference. First operand 18 states and 57 transitions. Second operand 11 states. [2018-06-24 21:09:26,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:26,152 INFO ]: Finished difference Result 49 states and 159 transitions. [2018-06-24 21:09:26,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 21:09:26,152 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-24 21:09:26,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:26,153 INFO ]: With dead ends: 49 [2018-06-24 21:09:26,153 INFO ]: Without dead ends: 49 [2018-06-24 21:09:26,153 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=778, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:09:26,153 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 21:09:26,157 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-06-24 21:09:26,157 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:09:26,158 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 109 transitions. [2018-06-24 21:09:26,158 INFO ]: Start accepts. Automaton has 34 states and 109 transitions. Word has length 10 [2018-06-24 21:09:26,158 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:26,158 INFO ]: Abstraction has 34 states and 109 transitions. [2018-06-24 21:09:26,158 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:09:26,158 INFO ]: Start isEmpty. Operand 34 states and 109 transitions. [2018-06-24 21:09:26,159 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:09:26,159 INFO ]: Found error trace [2018-06-24 21:09:26,159 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:26,159 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:26,159 INFO ]: Analyzing trace with hash -860841491, now seen corresponding path program 4 times [2018-06-24 21:09:26,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:26,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:26,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:26,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:09:26,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:26,168 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:26,222 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:09:26,223 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:26,223 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:09:26,229 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:09:26,246 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:09:26,246 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:26,247 INFO ]: Computing forward predicates... [2018-06-24 21:09:26,499 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:09:26,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:26,518 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:09:26,518 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:09:26,518 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:09:26,518 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:09:26,519 INFO ]: Start difference. First operand 34 states and 109 transitions. Second operand 14 states. [2018-06-24 21:09:26,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:26,966 INFO ]: Finished difference Result 83 states and 287 transitions. [2018-06-24 21:09:26,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:09:26,966 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-24 21:09:26,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:26,968 INFO ]: With dead ends: 83 [2018-06-24 21:09:26,968 INFO ]: Without dead ends: 83 [2018-06-24 21:09:26,968 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:09:26,968 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-24 21:09:26,973 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 34. [2018-06-24 21:09:26,973 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:09:26,974 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 109 transitions. [2018-06-24 21:09:26,974 INFO ]: Start accepts. Automaton has 34 states and 109 transitions. Word has length 10 [2018-06-24 21:09:26,975 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:26,975 INFO ]: Abstraction has 34 states and 109 transitions. [2018-06-24 21:09:26,975 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:09:26,975 INFO ]: Start isEmpty. Operand 34 states and 109 transitions. [2018-06-24 21:09:26,976 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:09:26,976 INFO ]: Found error trace [2018-06-24 21:09:26,976 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:26,976 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:26,976 INFO ]: Analyzing trace with hash -859947761, now seen corresponding path program 5 times [2018-06-24 21:09:26,976 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:26,976 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:26,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:26,976 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:26,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:26,984 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:27,083 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:09:27,084 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:27,084 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:09:27,091 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:09:27,124 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:09:27,124 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:27,125 INFO ]: Computing forward predicates... [2018-06-24 21:09:27,164 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:09:27,182 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:27,182 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 21:09:27,183 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:09:27,183 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:09:27,183 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:09:27,183 INFO ]: Start difference. First operand 34 states and 109 transitions. Second operand 8 states. [2018-06-24 21:09:27,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:27,412 INFO ]: Finished difference Result 89 states and 299 transitions. [2018-06-24 21:09:27,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:09:27,412 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 21:09:27,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:27,413 INFO ]: With dead ends: 89 [2018-06-24 21:09:27,413 INFO ]: Without dead ends: 89 [2018-06-24 21:09:27,413 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:09:27,413 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-24 21:09:27,419 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 34. [2018-06-24 21:09:27,419 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:09:27,420 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 109 transitions. [2018-06-24 21:09:27,420 INFO ]: Start accepts. Automaton has 34 states and 109 transitions. Word has length 10 [2018-06-24 21:09:27,420 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:27,420 INFO ]: Abstraction has 34 states and 109 transitions. [2018-06-24 21:09:27,420 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:09:27,420 INFO ]: Start isEmpty. Operand 34 states and 109 transitions. [2018-06-24 21:09:27,421 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:09:27,421 INFO ]: Found error trace [2018-06-24 21:09:27,421 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:27,421 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:27,421 INFO ]: Analyzing trace with hash 1158327211, now seen corresponding path program 2 times [2018-06-24 21:09:27,421 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:27,421 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:27,421 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:27,421 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:27,421 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:27,431 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:28,288 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:09:28,288 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:28,288 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:09:28,302 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:09:28,353 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:09:28,353 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:28,355 INFO ]: Computing forward predicates... [2018-06-24 21:09:28,986 INFO ]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:09:29,005 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:29,027 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-06-24 21:09:29,027 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:09:29,027 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:09:29,027 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:09:29,027 INFO ]: Start difference. First operand 34 states and 109 transitions. Second operand 14 states. [2018-06-24 21:09:30,922 WARN ]: Spent 302.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-06-24 21:09:31,184 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:31,184 INFO ]: Finished difference Result 159 states and 522 transitions. [2018-06-24 21:09:31,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 21:09:31,184 INFO ]: Start accepts. Automaton has 14 states. Word has length 11 [2018-06-24 21:09:31,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:31,185 INFO ]: With dead ends: 159 [2018-06-24 21:09:31,185 INFO ]: Without dead ends: 159 [2018-06-24 21:09:31,186 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=230, Invalid=1029, Unknown=1, NotChecked=0, Total=1260 [2018-06-24 21:09:31,186 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-24 21:09:31,196 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 84. [2018-06-24 21:09:31,196 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-24 21:09:31,198 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 273 transitions. [2018-06-24 21:09:31,198 INFO ]: Start accepts. Automaton has 84 states and 273 transitions. Word has length 11 [2018-06-24 21:09:31,198 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:31,198 INFO ]: Abstraction has 84 states and 273 transitions. [2018-06-24 21:09:31,198 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:09:31,198 INFO ]: Start isEmpty. Operand 84 states and 273 transitions. [2018-06-24 21:09:31,199 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:09:31,199 INFO ]: Found error trace [2018-06-24 21:09:31,199 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:31,199 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:31,199 INFO ]: Analyzing trace with hash 1159250732, now seen corresponding path program 3 times [2018-06-24 21:09:31,199 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:31,199 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:31,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:31,200 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:31,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:31,211 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:31,304 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:09:31,304 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:09:31,304 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:09:31,311 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:09:31,358 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:09:31,358 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:09:31,361 INFO ]: Computing forward predicates... [2018-06-24 21:09:31,865 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:09:31,883 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:09:31,883 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-24 21:09:31,883 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:09:31,884 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:09:31,884 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:09:31,884 INFO ]: Start difference. First operand 84 states and 273 transitions. Second operand 16 states. [2018-06-24 21:09:32,163 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:09:32,163 INFO ]: Finished difference Result 166 states and 557 transitions. [2018-06-24 21:09:32,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:09:32,163 INFO ]: Start accepts. Automaton has 16 states. Word has length 11 [2018-06-24 21:09:32,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:09:32,165 INFO ]: With dead ends: 166 [2018-06-24 21:09:32,165 INFO ]: Without dead ends: 166 [2018-06-24 21:09:32,165 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:09:32,165 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-24 21:09:32,171 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 86. [2018-06-24 21:09:32,171 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-24 21:09:32,173 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 281 transitions. [2018-06-24 21:09:32,173 INFO ]: Start accepts. Automaton has 86 states and 281 transitions. Word has length 11 [2018-06-24 21:09:32,173 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:09:32,173 INFO ]: Abstraction has 86 states and 281 transitions. [2018-06-24 21:09:32,173 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:09:32,173 INFO ]: Start isEmpty. Operand 86 states and 281 transitions. [2018-06-24 21:09:32,174 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:09:32,174 INFO ]: Found error trace [2018-06-24 21:09:32,174 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:09:32,174 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:09:32,174 INFO ]: Analyzing trace with hash 2018125262, now seen corresponding path program 4 times [2018-06-24 21:09:32,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:09:32,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:09:32,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:32,175 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:09:32,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:09:32,187 INFO ]: Conjunction of SSA is sat [2018-06-24 21:09:32,189 INFO ]: Counterexample might be feasible [2018-06-24 21:09:32,289 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:09:32,291 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:09:32 BasicIcfg [2018-06-24 21:09:32,291 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:09:32,291 INFO ]: Toolchain (without parser) took 22806.61 ms. Allocated memory was 309.3 MB in the beginning and 563.1 MB in the end (delta: 253.8 MB). Free memory was 263.9 MB in the beginning and 546.0 MB in the end (delta: -282.2 MB). Peak memory consumption was 168.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:09:32,296 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:09:32,297 INFO ]: ChcToBoogie took 63.00 ms. Allocated memory is still 309.3 MB. Free memory was 263.9 MB in the beginning and 261.9 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:09:32,297 INFO ]: Boogie Preprocessor took 51.24 ms. Allocated memory is still 309.3 MB. Free memory was 261.9 MB in the beginning and 259.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:09:32,297 INFO ]: RCFGBuilder took 335.73 ms. Allocated memory is still 309.3 MB. Free memory was 259.8 MB in the beginning and 248.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:09:32,298 INFO ]: BlockEncodingV2 took 78.91 ms. Allocated memory is still 309.3 MB. Free memory was 248.8 MB in the beginning and 245.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:09:32,298 INFO ]: TraceAbstraction took 22271.17 ms. Allocated memory was 309.3 MB in the beginning and 563.1 MB in the end (delta: 253.8 MB). Free memory was 245.8 MB in the beginning and 546.0 MB in the end (delta: -300.2 MB). Peak memory consumption was 150.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:09:32,310 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 23 edges - StatisticsResult: Encoded RCFG 8 locations, 19 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 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.00 ms. Allocated memory is still 309.3 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 51.24 ms. Allocated memory is still 309.3 MB. Free memory was 261.9 MB in the beginning and 259.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 335.73 ms. Allocated memory is still 309.3 MB. Free memory was 259.8 MB in the beginning and 248.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 78.91 ms. Allocated memory is still 309.3 MB. Free memory was 248.8 MB in the beginning and 245.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 22271.17 ms. Allocated memory was 309.3 MB in the beginning and 563.1 MB in the end (delta: 253.8 MB). Free memory was 245.8 MB in the beginning and 546.0 MB in the end (delta: -300.2 MB). Peak memory consumption was 150.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0); [L0] assume (-1 * hbv_False_3_Int == 0 && !(hbv_False_4_Int == hbv_False_5_Int)) && 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, hhv_REC_f_f_4_Int := hbv_False_1_Int, hbv_False_4_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_5_Int; [L0] havoc hbv_False_3_Int, hbv_False_5_Int, hbv_False_2_Int, hbv_False_4_Int, hbv_False_1_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -32 == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int) && hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0; [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, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && 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, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && 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, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int; [L0] assume ((((((hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hbv_REC_f_f_2_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -31 == hbv_REC_f_f_3_Int) && hbv_REC_f_f_2_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_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, hhv_REC_f_f_4_Int := hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && 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, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && 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, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. UNSAFE Result, 22.2s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 15.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 36 SDslu, 424 SDs, 0 SdLazy, 1774 SolverSat, 793 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=18, 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, 18 MinimizatonAttempts, 362 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 240 ConstructedInterpolants, 22 QuantifiedInterpolants, 11157 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1781 ConjunctsInSsa, 401 ConjunctsInUnsatCore, 33 InterpolantComputations, 3 PerfectInterpolantSequences, 36/281 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/025d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-09-32-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-09-32-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-09-32-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-09-32-327.csv Received shutdown request...