java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/003d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:04:30,245 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:04:30,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:04:30,258 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:04:30,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:04:30,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:04:30,263 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:04:30,265 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:04:30,267 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:04:30,267 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:04:30,270 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:04:30,270 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:04:30,271 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:04:30,272 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:04:30,272 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:04:30,273 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:04:30,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:04:30,277 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:04:30,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:04:30,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:04:30,288 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:04:30,290 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:04:30,290 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:04:30,290 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:04:30,294 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:04:30,295 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:04:30,296 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:04:30,297 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:04:30,297 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:04:30,302 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:04:30,303 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:04:30,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:04:30,304 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:04:30,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:04:30,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:04:30,305 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:04:30,319 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:04:30,320 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:04:30,320 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:04:30,320 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:04:30,321 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:04:30,321 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:04:30,321 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:04:30,322 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:04:30,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:04:30,322 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:04:30,322 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:04:30,322 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:04:30,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:04:30,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:04:30,323 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:04:30,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:04:30,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:04:30,324 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:04:30,324 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:04:30,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:04:30,324 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:04:30,325 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:04:30,325 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:04:30,376 INFO ]: Repository-Root is: /tmp [2018-06-25 09:04:30,397 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:04:30,401 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:04:30,403 INFO ]: Initializing SmtParser... [2018-06-25 09:04:30,403 INFO ]: SmtParser initialized [2018-06-25 09:04:30,404 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/003d-horn.smt2 [2018-06-25 09:04:30,405 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:04:30,496 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003d-horn.smt2 unknown [2018-06-25 09:04:30,728 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003d-horn.smt2 [2018-06-25 09:04:30,738 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:04:30,744 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:04:30,744 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:04:30,744 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:04:30,744 INFO ]: ChcToBoogie initialized [2018-06-25 09:04:30,747 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:04:30" (1/1) ... [2018-06-25 09:04:30,802 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:30 Unit [2018-06-25 09:04:30,802 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:04:30,802 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:04:30,802 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:04:30,802 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:04:30,821 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:30" (1/1) ... [2018-06-25 09:04:30,822 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:30" (1/1) ... [2018-06-25 09:04:30,827 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:30" (1/1) ... [2018-06-25 09:04:30,827 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:30" (1/1) ... [2018-06-25 09:04:30,831 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:30" (1/1) ... [2018-06-25 09:04:30,833 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:30" (1/1) ... [2018-06-25 09:04:30,834 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:30" (1/1) ... [2018-06-25 09:04:30,836 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:04:30,836 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:04:30,836 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:04:30,836 INFO ]: RCFGBuilder initialized [2018-06-25 09:04:30,837 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:30" (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-25 09:04:30,847 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:04:30,848 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:04:30,848 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:04:30,848 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:04:30,848 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:04:30,848 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-25 09:04:31,157 INFO ]: Using library mode [2018-06-25 09:04:31,158 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:04:31 BoogieIcfgContainer [2018-06-25 09:04:31,158 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:04:31,166 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:04:31,166 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:04:31,169 INFO ]: TraceAbstraction initialized [2018-06-25 09:04:31,169 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:04:30" (1/3) ... [2018-06-25 09:04:31,170 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6837e98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:04:31, skipping insertion in model container [2018-06-25 09:04:31,170 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:30" (2/3) ... [2018-06-25 09:04:31,170 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6837e98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:04:31, skipping insertion in model container [2018-06-25 09:04:31,170 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:04:31" (3/3) ... [2018-06-25 09:04:31,172 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:04:31,181 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:04:31,190 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:04:31,230 INFO ]: Using default assertion order modulation [2018-06-25 09:04:31,231 INFO ]: Interprodecural is true [2018-06-25 09:04:31,231 INFO ]: Hoare is false [2018-06-25 09:04:31,231 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:04:31,231 INFO ]: Backedges is TWOTRACK [2018-06-25 09:04:31,231 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:04:31,231 INFO ]: Difference is false [2018-06-25 09:04:31,231 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:04:31,231 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:04:31,242 INFO ]: Start isEmpty. Operand 10 states. [2018-06-25 09:04:31,253 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:04:31,253 INFO ]: Found error trace [2018-06-25 09:04:31,253 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:31,253 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:31,258 INFO ]: Analyzing trace with hash -1694561178, now seen corresponding path program 1 times [2018-06-25 09:04:31,260 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:31,260 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:31,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:31,298 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:31,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:31,351 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:31,422 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:31,423 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:04:31,423 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:04:31,425 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:04:31,437 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:04:31,438 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:04:31,440 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-25 09:04:31,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:31,609 INFO ]: Finished difference Result 9 states and 17 transitions. [2018-06-25 09:04:31,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:04:31,611 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:04:31,612 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:31,623 INFO ]: With dead ends: 9 [2018-06-25 09:04:31,623 INFO ]: Without dead ends: 9 [2018-06-25 09:04:31,626 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:04:31,647 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:04:31,661 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:04:31,662 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:04:31,663 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-06-25 09:04:31,663 INFO ]: Start accepts. Automaton has 9 states and 17 transitions. Word has length 7 [2018-06-25 09:04:31,664 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:31,664 INFO ]: Abstraction has 9 states and 17 transitions. [2018-06-25 09:04:31,664 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:04:31,664 INFO ]: Start isEmpty. Operand 9 states and 17 transitions. [2018-06-25 09:04:31,664 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:04:31,665 INFO ]: Found error trace [2018-06-25 09:04:31,665 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:31,665 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:31,665 INFO ]: Analyzing trace with hash -989351719, now seen corresponding path program 1 times [2018-06-25 09:04:31,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:31,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:31,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:31,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:31,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:31,687 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:31,771 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:31,771 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:31,771 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:04:31,788 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:31,852 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:31,862 INFO ]: Computing forward predicates... [2018-06-25 09:04:31,926 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:31,946 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:04:31,946 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-25 09:04:31,947 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:04:31,947 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:04:31,947 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:04:31,947 INFO ]: Start difference. First operand 9 states and 17 transitions. Second operand 6 states. [2018-06-25 09:04:32,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:32,633 INFO ]: Finished difference Result 11 states and 23 transitions. [2018-06-25 09:04:32,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:04:32,635 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-25 09:04:32,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:32,635 INFO ]: With dead ends: 11 [2018-06-25 09:04:32,635 INFO ]: Without dead ends: 9 [2018-06-25 09:04:32,636 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:04:32,636 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:04:32,638 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:04:32,638 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:04:32,638 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-06-25 09:04:32,638 INFO ]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 8 [2018-06-25 09:04:32,638 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:32,638 INFO ]: Abstraction has 9 states and 15 transitions. [2018-06-25 09:04:32,638 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:04:32,638 INFO ]: Start isEmpty. Operand 9 states and 15 transitions. [2018-06-25 09:04:32,638 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:04:32,639 INFO ]: Found error trace [2018-06-25 09:04:32,639 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:32,639 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:32,639 INFO ]: Analyzing trace with hash -985657635, now seen corresponding path program 1 times [2018-06-25 09:04:32,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:32,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:32,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:32,641 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:32,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:32,676 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:32,765 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:32,765 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:04:32,765 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:04:32,766 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:04:32,766 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:04:32,766 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:04:32,766 INFO ]: Start difference. First operand 9 states and 15 transitions. Second operand 3 states. [2018-06-25 09:04:32,850 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:32,850 INFO ]: Finished difference Result 10 states and 19 transitions. [2018-06-25 09:04:32,850 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:04:32,850 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:04:32,850 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:32,851 INFO ]: With dead ends: 10 [2018-06-25 09:04:32,851 INFO ]: Without dead ends: 10 [2018-06-25 09:04:32,851 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:04:32,851 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:04:32,852 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-25 09:04:32,852 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:04:32,853 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-06-25 09:04:32,853 INFO ]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 8 [2018-06-25 09:04:32,853 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:32,853 INFO ]: Abstraction has 9 states and 15 transitions. [2018-06-25 09:04:32,853 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:04:32,853 INFO ]: Start isEmpty. Operand 9 states and 15 transitions. [2018-06-25 09:04:32,853 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:04:32,853 INFO ]: Found error trace [2018-06-25 09:04:32,853 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:32,854 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:32,854 INFO ]: Analyzing trace with hash -999510450, now seen corresponding path program 1 times [2018-06-25 09:04:32,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:32,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:32,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:32,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:32,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:32,872 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:32,989 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:32,989 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:32,990 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:04:33,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:33,096 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:33,098 INFO ]: Computing forward predicates... [2018-06-25 09:04:33,146 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:33,165 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:04:33,165 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-25 09:04:33,166 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:04:33,166 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:04:33,166 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:04:33,166 INFO ]: Start difference. First operand 9 states and 15 transitions. Second operand 6 states. [2018-06-25 09:04:33,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:33,608 INFO ]: Finished difference Result 14 states and 35 transitions. [2018-06-25 09:04:33,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:04:33,608 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-25 09:04:33,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:33,609 INFO ]: With dead ends: 14 [2018-06-25 09:04:33,609 INFO ]: Without dead ends: 10 [2018-06-25 09:04:33,609 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:04:33,609 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:04:33,610 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-25 09:04:33,610 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:04:33,610 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-25 09:04:33,610 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-25 09:04:33,610 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:33,610 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-25 09:04:33,610 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:04:33,610 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-25 09:04:33,611 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:04:33,611 INFO ]: Found error trace [2018-06-25 09:04:33,611 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:33,611 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:33,611 INFO ]: Analyzing trace with hash -983810593, now seen corresponding path program 1 times [2018-06-25 09:04:33,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:33,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:33,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:33,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:33,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:33,629 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:33,786 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:33,786 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:33,786 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-25 09:04:33,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:33,828 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:33,831 INFO ]: Computing forward predicates... [2018-06-25 09:04:33,905 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:33,925 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:33,925 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:04:33,925 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:04:33,926 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:04:33,926 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:04:33,926 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-06-25 09:04:33,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:33,981 INFO ]: Finished difference Result 13 states and 19 transitions. [2018-06-25 09:04:33,981 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:04:33,981 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:04:33,981 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:33,982 INFO ]: With dead ends: 13 [2018-06-25 09:04:33,982 INFO ]: Without dead ends: 13 [2018-06-25 09:04:33,982 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:04:33,982 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:04:33,983 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-25 09:04:33,984 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:04:33,984 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-06-25 09:04:33,984 INFO ]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 8 [2018-06-25 09:04:33,984 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:33,984 INFO ]: Abstraction has 11 states and 15 transitions. [2018-06-25 09:04:33,984 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:04:33,984 INFO ]: Start isEmpty. Operand 11 states and 15 transitions. [2018-06-25 09:04:33,984 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:04:33,984 INFO ]: Found error trace [2018-06-25 09:04:33,984 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:33,985 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:33,985 INFO ]: Analyzing trace with hash -293866817, now seen corresponding path program 2 times [2018-06-25 09:04:33,985 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:33,985 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:33,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:33,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:33,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:34,037 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:34,166 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:34,167 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:34,167 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-25 09:04:34,173 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:04:34,214 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:04:34,214 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:34,218 INFO ]: Computing forward predicates... [2018-06-25 09:04:34,380 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:34,402 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:34,402 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 09:04:34,402 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:04:34,403 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:04:34,403 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:04:34,403 INFO ]: Start difference. First operand 11 states and 15 transitions. Second operand 7 states. [2018-06-25 09:04:34,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:34,447 INFO ]: Finished difference Result 13 states and 19 transitions. [2018-06-25 09:04:34,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:04:34,447 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-25 09:04:34,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:34,448 INFO ]: With dead ends: 13 [2018-06-25 09:04:34,448 INFO ]: Without dead ends: 13 [2018-06-25 09:04:34,448 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:04:34,448 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:04:34,449 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-25 09:04:34,449 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:04:34,449 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-25 09:04:34,450 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 10 [2018-06-25 09:04:34,450 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:34,450 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-25 09:04:34,450 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:04:34,450 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-25 09:04:34,450 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:04:34,450 INFO ]: Found error trace [2018-06-25 09:04:34,450 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:34,450 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:34,450 INFO ]: Analyzing trace with hash -666045780, now seen corresponding path program 1 times [2018-06-25 09:04:34,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:34,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:34,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:34,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:34,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:34,467 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:34,525 INFO ]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:34,525 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:34,525 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-25 09:04:34,531 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:34,580 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:34,582 INFO ]: Computing forward predicates... [2018-06-25 09:04:34,586 INFO ]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:34,616 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:34,617 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:04:34,617 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:04:34,617 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:04:34,617 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:04:34,619 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 4 states. [2018-06-25 09:04:34,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:34,757 INFO ]: Finished difference Result 16 states and 25 transitions. [2018-06-25 09:04:34,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:04:34,758 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-25 09:04:34,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:34,759 INFO ]: With dead ends: 16 [2018-06-25 09:04:34,759 INFO ]: Without dead ends: 16 [2018-06-25 09:04:34,759 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:04:34,759 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:04:34,760 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 09:04:34,760 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:04:34,761 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-25 09:04:34,761 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 10 [2018-06-25 09:04:34,761 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:34,761 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-25 09:04:34,761 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:04:34,761 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-25 09:04:34,761 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:04:34,761 INFO ]: Found error trace [2018-06-25 09:04:34,761 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:34,761 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:34,761 INFO ]: Analyzing trace with hash -511958362, now seen corresponding path program 3 times [2018-06-25 09:04:34,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:34,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:34,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:34,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:34,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:34,796 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:35,128 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:35,128 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:35,128 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-25 09:04:35,134 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:04:35,186 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:04:35,186 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:35,189 INFO ]: Computing forward predicates... [2018-06-25 09:04:35,289 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:35,311 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:35,311 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 09:04:35,311 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:04:35,311 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:04:35,311 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:04:35,311 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 8 states. [2018-06-25 09:04:35,414 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:35,414 INFO ]: Finished difference Result 15 states and 23 transitions. [2018-06-25 09:04:35,415 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:04:35,415 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-25 09:04:35,415 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:35,415 INFO ]: With dead ends: 15 [2018-06-25 09:04:35,415 INFO ]: Without dead ends: 15 [2018-06-25 09:04:35,416 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:04:35,416 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:04:35,417 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-25 09:04:35,417 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:04:35,417 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-25 09:04:35,417 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 11 [2018-06-25 09:04:35,418 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:35,418 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-25 09:04:35,418 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:04:35,418 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-25 09:04:35,418 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:04:35,418 INFO ]: Found error trace [2018-06-25 09:04:35,418 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:35,418 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:35,418 INFO ]: Analyzing trace with hash 835395673, now seen corresponding path program 2 times [2018-06-25 09:04:35,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:35,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:35,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:35,419 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:35,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:35,432 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:35,494 INFO ]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:35,494 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:35,494 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-25 09:04:35,500 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:04:35,531 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:04:35,531 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:35,533 INFO ]: Computing forward predicates... [2018-06-25 09:04:35,537 INFO ]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:35,557 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:35,558 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 09:04:35,558 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:04:35,558 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:04:35,558 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:04:35,558 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 5 states. [2018-06-25 09:04:35,578 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:35,578 INFO ]: Finished difference Result 19 states and 31 transitions. [2018-06-25 09:04:35,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:04:35,578 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-25 09:04:35,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:35,579 INFO ]: With dead ends: 19 [2018-06-25 09:04:35,579 INFO ]: Without dead ends: 19 [2018-06-25 09:04:35,579 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:04:35,579 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:04:35,582 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-06-25 09:04:35,582 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:04:35,582 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-25 09:04:35,582 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 11 [2018-06-25 09:04:35,582 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:35,582 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-25 09:04:35,582 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:04:35,582 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-25 09:04:35,583 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:04:35,583 INFO ]: Found error trace [2018-06-25 09:04:35,583 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:35,583 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:35,583 INFO ]: Analyzing trace with hash 1317138335, now seen corresponding path program 4 times [2018-06-25 09:04:35,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:35,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:35,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:35,584 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:35,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:35,612 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:36,209 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:36,209 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:36,209 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) [2018-06-25 09:04:36,227 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:36,269 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:04:36,269 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:36,273 INFO ]: Computing forward predicates... [2018-06-25 09:04:36,331 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:36,354 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:36,355 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 09:04:36,355 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:04:36,355 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:04:36,355 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:04:36,355 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 9 states. [2018-06-25 09:04:36,459 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:36,459 INFO ]: Finished difference Result 17 states and 27 transitions. [2018-06-25 09:04:36,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:04:36,459 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-25 09:04:36,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:36,460 INFO ]: With dead ends: 17 [2018-06-25 09:04:36,460 INFO ]: Without dead ends: 17 [2018-06-25 09:04:36,460 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:04:36,460 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:04:36,461 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-25 09:04:36,462 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:04:36,462 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-06-25 09:04:36,462 INFO ]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 12 [2018-06-25 09:04:36,462 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:36,462 INFO ]: Abstraction has 14 states and 21 transitions. [2018-06-25 09:04:36,462 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:04:36,462 INFO ]: Start isEmpty. Operand 14 states and 21 transitions. [2018-06-25 09:04:36,462 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:04:36,462 INFO ]: Found error trace [2018-06-25 09:04:36,462 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:36,463 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:36,463 INFO ]: Analyzing trace with hash 135440460, now seen corresponding path program 3 times [2018-06-25 09:04:36,463 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:36,463 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:36,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:36,463 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:36,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:36,476 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:36,569 INFO ]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:36,569 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:36,569 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-25 09:04:36,577 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:04:36,626 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:04:36,626 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:36,628 INFO ]: Computing forward predicates... [2018-06-25 09:04:36,633 INFO ]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:36,655 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:36,655 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 09:04:36,655 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:04:36,655 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:04:36,655 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:04:36,655 INFO ]: Start difference. First operand 14 states and 21 transitions. Second operand 6 states. [2018-06-25 09:04:36,673 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:36,673 INFO ]: Finished difference Result 22 states and 37 transitions. [2018-06-25 09:04:36,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:04:36,674 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-25 09:04:36,674 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:36,674 INFO ]: With dead ends: 22 [2018-06-25 09:04:36,674 INFO ]: Without dead ends: 22 [2018-06-25 09:04:36,674 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:04:36,674 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:04:36,677 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-06-25 09:04:36,677 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:04:36,678 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-06-25 09:04:36,678 INFO ]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 12 [2018-06-25 09:04:36,678 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:36,678 INFO ]: Abstraction has 14 states and 21 transitions. [2018-06-25 09:04:36,678 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:04:36,678 INFO ]: Start isEmpty. Operand 14 states and 21 transitions. [2018-06-25 09:04:36,679 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:04:36,679 INFO ]: Found error trace [2018-06-25 09:04:36,679 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:36,679 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:36,679 INFO ]: Analyzing trace with hash -2110406202, now seen corresponding path program 5 times [2018-06-25 09:04:36,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:36,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:36,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:36,680 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:36,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:36,703 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:36,998 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:36,998 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:36,998 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-25 09:04:37,004 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:04:37,091 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:04:37,091 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:37,096 INFO ]: Computing forward predicates... [2018-06-25 09:04:37,438 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:37,458 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:37,458 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-25 09:04:37,481 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:04:37,481 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:04:37,481 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:04:37,482 INFO ]: Start difference. First operand 14 states and 21 transitions. Second operand 10 states. [2018-06-25 09:04:37,601 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:37,602 INFO ]: Finished difference Result 19 states and 31 transitions. [2018-06-25 09:04:37,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:04:37,602 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-25 09:04:37,602 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:37,602 INFO ]: With dead ends: 19 [2018-06-25 09:04:37,602 INFO ]: Without dead ends: 19 [2018-06-25 09:04:37,602 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:04:37,603 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:04:37,604 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-25 09:04:37,604 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:04:37,604 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-25 09:04:37,604 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 13 [2018-06-25 09:04:37,604 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:37,605 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-25 09:04:37,605 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:04:37,605 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-25 09:04:37,605 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:04:37,605 INFO ]: Found error trace [2018-06-25 09:04:37,605 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:37,605 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:37,605 INFO ]: Analyzing trace with hash -88334663, now seen corresponding path program 4 times [2018-06-25 09:04:37,605 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:37,605 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:37,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:37,606 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:37,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:37,620 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:37,674 INFO ]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:37,674 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:37,674 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-25 09:04:37,680 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:04:37,723 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:04:37,723 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:37,725 INFO ]: Computing forward predicates... [2018-06-25 09:04:37,731 INFO ]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:37,754 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:37,754 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-25 09:04:37,754 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:04:37,754 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:04:37,754 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:04:37,754 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 7 states. [2018-06-25 09:04:37,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:37,797 INFO ]: Finished difference Result 25 states and 43 transitions. [2018-06-25 09:04:37,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:04:37,798 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-25 09:04:37,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:37,798 INFO ]: With dead ends: 25 [2018-06-25 09:04:37,798 INFO ]: Without dead ends: 25 [2018-06-25 09:04:37,798 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:04:37,798 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:04:37,800 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-06-25 09:04:37,800 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:04:37,800 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-25 09:04:37,800 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 13 [2018-06-25 09:04:37,801 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:37,801 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-25 09:04:37,801 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:04:37,801 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-25 09:04:37,801 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:04:37,801 INFO ]: Found error trace [2018-06-25 09:04:37,801 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:37,801 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:37,801 INFO ]: Analyzing trace with hash -990104449, now seen corresponding path program 6 times [2018-06-25 09:04:37,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:37,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:37,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:37,802 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:37,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:37,840 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:38,039 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:38,039 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:38,039 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-25 09:04:38,055 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:04:38,128 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-25 09:04:38,128 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:38,133 INFO ]: Computing forward predicates... [2018-06-25 09:04:38,309 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:38,330 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:38,330 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-25 09:04:38,330 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:04:38,330 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:04:38,330 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:04:38,330 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 11 states. [2018-06-25 09:04:38,524 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:38,525 INFO ]: Finished difference Result 21 states and 35 transitions. [2018-06-25 09:04:38,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:04:38,525 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-25 09:04:38,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:38,525 INFO ]: With dead ends: 21 [2018-06-25 09:04:38,525 INFO ]: Without dead ends: 21 [2018-06-25 09:04:38,525 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:04:38,526 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:04:38,527 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-06-25 09:04:38,527 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:04:38,527 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2018-06-25 09:04:38,528 INFO ]: Start accepts. Automaton has 16 states and 25 transitions. Word has length 14 [2018-06-25 09:04:38,528 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:38,528 INFO ]: Abstraction has 16 states and 25 transitions. [2018-06-25 09:04:38,528 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:04:38,528 INFO ]: Start isEmpty. Operand 16 states and 25 transitions. [2018-06-25 09:04:38,528 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:04:38,528 INFO ]: Found error trace [2018-06-25 09:04:38,528 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:38,528 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:38,528 INFO ]: Analyzing trace with hash 1564571116, now seen corresponding path program 5 times [2018-06-25 09:04:38,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:38,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:38,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:38,529 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:38,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:38,544 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:38,753 INFO ]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:38,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:38,753 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-25 09:04:38,761 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:04:38,819 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-25 09:04:38,820 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:38,822 INFO ]: Computing forward predicates... [2018-06-25 09:04:38,828 INFO ]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:38,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:38,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-25 09:04:38,851 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:04:38,851 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:04:38,851 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:04:38,851 INFO ]: Start difference. First operand 16 states and 25 transitions. Second operand 8 states. [2018-06-25 09:04:38,874 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:38,874 INFO ]: Finished difference Result 28 states and 49 transitions. [2018-06-25 09:04:38,874 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:04:38,874 INFO ]: Start accepts. Automaton has 8 states. Word has length 14 [2018-06-25 09:04:38,874 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:38,874 INFO ]: With dead ends: 28 [2018-06-25 09:04:38,874 INFO ]: Without dead ends: 28 [2018-06-25 09:04:38,875 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:04:38,875 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 09:04:38,877 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-06-25 09:04:38,877 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:04:38,877 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2018-06-25 09:04:38,877 INFO ]: Start accepts. Automaton has 16 states and 25 transitions. Word has length 14 [2018-06-25 09:04:38,877 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:38,877 INFO ]: Abstraction has 16 states and 25 transitions. [2018-06-25 09:04:38,877 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:04:38,877 INFO ]: Start isEmpty. Operand 16 states and 25 transitions. [2018-06-25 09:04:38,878 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:04:38,878 INFO ]: Found error trace [2018-06-25 09:04:38,878 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:38,878 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:38,878 INFO ]: Analyzing trace with hash -620488474, now seen corresponding path program 7 times [2018-06-25 09:04:38,878 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:38,878 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:38,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:38,879 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:38,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:38,910 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:39,348 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:39,348 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:39,348 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:39,354 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:39,422 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:39,428 INFO ]: Computing forward predicates... [2018-06-25 09:04:39,633 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:39,653 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:39,653 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-25 09:04:39,653 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:04:39,653 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:04:39,653 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:04:39,653 INFO ]: Start difference. First operand 16 states and 25 transitions. Second operand 12 states. [2018-06-25 09:04:39,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:39,963 INFO ]: Finished difference Result 23 states and 39 transitions. [2018-06-25 09:04:39,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:04:39,963 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-25 09:04:39,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:39,963 INFO ]: With dead ends: 23 [2018-06-25 09:04:39,963 INFO ]: Without dead ends: 23 [2018-06-25 09:04:39,964 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:04:39,964 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:04:39,965 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-25 09:04:39,965 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:04:39,965 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2018-06-25 09:04:39,966 INFO ]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 15 [2018-06-25 09:04:39,966 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:39,966 INFO ]: Abstraction has 17 states and 27 transitions. [2018-06-25 09:04:39,966 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:04:39,966 INFO ]: Start isEmpty. Operand 17 states and 27 transitions. [2018-06-25 09:04:39,966 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:04:39,966 INFO ]: Found error trace [2018-06-25 09:04:39,966 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:39,966 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:39,966 INFO ]: Analyzing trace with hash 1265042713, now seen corresponding path program 6 times [2018-06-25 09:04:39,966 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:39,966 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:39,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:39,967 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:39,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:39,981 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:40,815 INFO ]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:40,815 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:40,815 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) [2018-06-25 09:04:40,831 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:40,949 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-25 09:04:40,949 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:40,952 INFO ]: Computing forward predicates... [2018-06-25 09:04:40,962 INFO ]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:40,999 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:40,999 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-25 09:04:40,999 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:04:41,000 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:04:41,000 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:04:41,000 INFO ]: Start difference. First operand 17 states and 27 transitions. Second operand 9 states. [2018-06-25 09:04:41,220 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:41,220 INFO ]: Finished difference Result 31 states and 55 transitions. [2018-06-25 09:04:41,220 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:04:41,220 INFO ]: Start accepts. Automaton has 9 states. Word has length 15 [2018-06-25 09:04:41,220 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:41,220 INFO ]: With dead ends: 31 [2018-06-25 09:04:41,220 INFO ]: Without dead ends: 31 [2018-06-25 09:04:41,221 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:04:41,221 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:04:41,222 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-06-25 09:04:41,222 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:04:41,223 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2018-06-25 09:04:41,223 INFO ]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 15 [2018-06-25 09:04:41,223 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:41,223 INFO ]: Abstraction has 17 states and 27 transitions. [2018-06-25 09:04:41,223 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:04:41,223 INFO ]: Start isEmpty. Operand 17 states and 27 transitions. [2018-06-25 09:04:41,223 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:04:41,223 INFO ]: Found error trace [2018-06-25 09:04:41,223 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:41,223 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:41,223 INFO ]: Analyzing trace with hash -2047295137, now seen corresponding path program 8 times [2018-06-25 09:04:41,223 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:41,223 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:41,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:41,227 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:41,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:41,254 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:41,457 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:41,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:41,457 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:41,463 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:04:41,534 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:04:41,534 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:41,541 INFO ]: Computing forward predicates... [2018-06-25 09:04:41,741 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:41,760 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:41,760 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-25 09:04:41,760 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:04:41,760 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:04:41,760 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:04:41,761 INFO ]: Start difference. First operand 17 states and 27 transitions. Second operand 13 states. [2018-06-25 09:04:41,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:41,968 INFO ]: Finished difference Result 25 states and 43 transitions. [2018-06-25 09:04:41,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:04:41,968 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-25 09:04:41,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:41,969 INFO ]: With dead ends: 25 [2018-06-25 09:04:41,969 INFO ]: Without dead ends: 25 [2018-06-25 09:04:41,969 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:04:41,969 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:04:41,971 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-25 09:04:41,971 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:04:41,971 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2018-06-25 09:04:41,971 INFO ]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 16 [2018-06-25 09:04:41,971 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:41,971 INFO ]: Abstraction has 18 states and 29 transitions. [2018-06-25 09:04:41,971 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:04:41,971 INFO ]: Start isEmpty. Operand 18 states and 29 transitions. [2018-06-25 09:04:41,971 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:04:41,971 INFO ]: Found error trace [2018-06-25 09:04:41,971 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:41,972 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:41,972 INFO ]: Analyzing trace with hash 569596812, now seen corresponding path program 7 times [2018-06-25 09:04:41,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:41,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:41,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:41,972 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:41,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:41,987 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:42,274 INFO ]: Checked inductivity of 45 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:42,274 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:42,274 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:42,279 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:42,329 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:42,332 INFO ]: Computing forward predicates... [2018-06-25 09:04:42,337 INFO ]: Checked inductivity of 45 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:42,371 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:42,371 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-25 09:04:42,371 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:04:42,371 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:04:42,371 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:04:42,371 INFO ]: Start difference. First operand 18 states and 29 transitions. Second operand 10 states. [2018-06-25 09:04:42,647 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:42,647 INFO ]: Finished difference Result 34 states and 61 transitions. [2018-06-25 09:04:42,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:04:42,695 INFO ]: Start accepts. Automaton has 10 states. Word has length 16 [2018-06-25 09:04:42,696 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:42,696 INFO ]: With dead ends: 34 [2018-06-25 09:04:42,696 INFO ]: Without dead ends: 34 [2018-06-25 09:04:42,696 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:04:42,696 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:04:42,698 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 18. [2018-06-25 09:04:42,698 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:04:42,698 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2018-06-25 09:04:42,698 INFO ]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 16 [2018-06-25 09:04:42,699 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:42,699 INFO ]: Abstraction has 18 states and 29 transitions. [2018-06-25 09:04:42,699 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:04:42,699 INFO ]: Start isEmpty. Operand 18 states and 29 transitions. [2018-06-25 09:04:42,699 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:04:42,699 INFO ]: Found error trace [2018-06-25 09:04:42,699 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:42,699 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:42,699 INFO ]: Analyzing trace with hash 966338566, now seen corresponding path program 9 times [2018-06-25 09:04:42,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:42,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:42,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:42,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:42,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:42,723 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:42,918 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:42,918 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:42,919 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:42,932 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:04:43,015 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-25 09:04:43,015 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:43,021 INFO ]: Computing forward predicates... [2018-06-25 09:04:43,107 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:43,128 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:43,128 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-25 09:04:43,128 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:04:43,128 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:04:43,128 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:04:43,128 INFO ]: Start difference. First operand 18 states and 29 transitions. Second operand 14 states. [2018-06-25 09:04:43,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:43,359 INFO ]: Finished difference Result 27 states and 47 transitions. [2018-06-25 09:04:43,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:04:43,359 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-25 09:04:43,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:43,359 INFO ]: With dead ends: 27 [2018-06-25 09:04:43,359 INFO ]: Without dead ends: 27 [2018-06-25 09:04:43,360 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:04:43,360 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:04:43,361 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-06-25 09:04:43,361 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:04:43,362 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-06-25 09:04:43,362 INFO ]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 17 [2018-06-25 09:04:43,362 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:43,362 INFO ]: Abstraction has 19 states and 31 transitions. [2018-06-25 09:04:43,362 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:04:43,362 INFO ]: Start isEmpty. Operand 19 states and 31 transitions. [2018-06-25 09:04:43,362 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:04:43,362 INFO ]: Found error trace [2018-06-25 09:04:43,362 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:43,362 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:43,362 INFO ]: Analyzing trace with hash 485610361, now seen corresponding path program 8 times [2018-06-25 09:04:43,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:43,362 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:43,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:43,363 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:43,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:43,394 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:43,610 INFO ]: Checked inductivity of 55 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:43,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:43,610 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:43,616 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:04:43,671 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:04:43,671 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:43,674 INFO ]: Computing forward predicates... [2018-06-25 09:04:43,683 INFO ]: Checked inductivity of 55 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:04:43,714 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:43,714 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-25 09:04:43,714 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:04:43,714 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:04:43,714 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:04:43,715 INFO ]: Start difference. First operand 19 states and 31 transitions. Second operand 11 states. [2018-06-25 09:04:43,753 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:43,753 INFO ]: Finished difference Result 37 states and 67 transitions. [2018-06-25 09:04:43,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:04:43,753 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-25 09:04:43,753 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:43,753 INFO ]: With dead ends: 37 [2018-06-25 09:04:43,753 INFO ]: Without dead ends: 37 [2018-06-25 09:04:43,754 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:04:43,754 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:04:43,755 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-06-25 09:04:43,755 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:04:43,756 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-06-25 09:04:43,756 INFO ]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 17 [2018-06-25 09:04:43,756 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:43,756 INFO ]: Abstraction has 19 states and 31 transitions. [2018-06-25 09:04:43,756 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:04:43,756 INFO ]: Start isEmpty. Operand 19 states and 31 transitions. [2018-06-25 09:04:43,756 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:04:43,756 INFO ]: Found error trace [2018-06-25 09:04:43,756 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:43,756 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:43,756 INFO ]: Analyzing trace with hash -100297153, now seen corresponding path program 10 times [2018-06-25 09:04:43,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:43,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:43,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:43,757 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:43,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:43,778 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:44,042 INFO ]: Checked inductivity of 66 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:44,042 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:44,042 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:44,052 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:04:44,129 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:04:44,129 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:44,133 INFO ]: Computing forward predicates... [2018-06-25 09:04:44,186 INFO ]: Checked inductivity of 66 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:44,218 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:44,218 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-25 09:04:44,218 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:04:44,218 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:04:44,218 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:04:44,218 INFO ]: Start difference. First operand 19 states and 31 transitions. Second operand 13 states. [2018-06-25 09:04:45,000 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:45,000 INFO ]: Finished difference Result 40 states and 73 transitions. [2018-06-25 09:04:45,002 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:04:45,002 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-25 09:04:45,002 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:45,002 INFO ]: With dead ends: 40 [2018-06-25 09:04:45,002 INFO ]: Without dead ends: 40 [2018-06-25 09:04:45,003 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:04:45,003 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 09:04:45,004 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 19. [2018-06-25 09:04:45,004 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:04:45,005 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-06-25 09:04:45,005 INFO ]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 18 [2018-06-25 09:04:45,005 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:45,005 INFO ]: Abstraction has 19 states and 31 transitions. [2018-06-25 09:04:45,005 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:04:45,005 INFO ]: Start isEmpty. Operand 19 states and 31 transitions. [2018-06-25 09:04:45,005 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:04:45,005 INFO ]: Found error trace [2018-06-25 09:04:45,005 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:45,005 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:45,006 INFO ]: Analyzing trace with hash 1776365810, now seen corresponding path program 9 times [2018-06-25 09:04:45,006 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:45,006 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:45,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:45,006 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:45,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:45,030 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:45,283 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:45,283 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:45,283 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:45,289 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:04:45,357 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-25 09:04:45,357 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:45,362 INFO ]: Computing forward predicates... [2018-06-25 09:04:45,753 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:45,772 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:45,772 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-25 09:04:45,772 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:04:45,772 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:04:45,772 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:04:45,772 INFO ]: Start difference. First operand 19 states and 31 transitions. Second operand 15 states. [2018-06-25 09:04:45,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:45,986 INFO ]: Finished difference Result 42 states and 77 transitions. [2018-06-25 09:04:45,988 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:04:45,988 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-25 09:04:45,988 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:45,988 INFO ]: With dead ends: 42 [2018-06-25 09:04:45,988 INFO ]: Without dead ends: 42 [2018-06-25 09:04:45,989 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:04:45,989 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 09:04:45,990 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 20. [2018-06-25 09:04:45,990 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:04:45,991 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2018-06-25 09:04:45,991 INFO ]: Start accepts. Automaton has 20 states and 33 transitions. Word has length 18 [2018-06-25 09:04:45,991 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:45,991 INFO ]: Abstraction has 20 states and 33 transitions. [2018-06-25 09:04:45,991 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:04:45,991 INFO ]: Start isEmpty. Operand 20 states and 33 transitions. [2018-06-25 09:04:45,991 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:04:45,991 INFO ]: Found error trace [2018-06-25 09:04:45,991 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:45,991 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:45,991 INFO ]: Analyzing trace with hash -1224570407, now seen corresponding path program 10 times [2018-06-25 09:04:45,991 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:45,992 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:45,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:45,999 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:45,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:46,036 INFO ]: Conjunction of SSA is sat [2018-06-25 09:04:46,046 INFO ]: Counterexample might be feasible [2018-06-25 09:04:46,072 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:04:46 BoogieIcfgContainer [2018-06-25 09:04:46,072 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:04:46,072 INFO ]: Toolchain (without parser) took 15334.07 ms. Allocated memory was 303.6 MB in the beginning and 434.1 MB in the end (delta: 130.5 MB). Free memory was 257.9 MB in the beginning and 192.7 MB in the end (delta: 65.2 MB). Peak memory consumption was 195.8 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:46,074 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 303.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:04:46,074 INFO ]: ChcToBoogie took 58.03 ms. Allocated memory is still 303.6 MB. Free memory was 257.9 MB in the beginning and 255.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:46,075 INFO ]: Boogie Preprocessor took 33.35 ms. Allocated memory is still 303.6 MB. Free memory was 255.9 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:46,075 INFO ]: RCFGBuilder took 321.47 ms. Allocated memory is still 303.6 MB. Free memory was 254.0 MB in the beginning and 241.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:46,075 INFO ]: TraceAbstraction took 14905.81 ms. Allocated memory was 303.6 MB in the beginning and 434.1 MB in the end (delta: 130.5 MB). Free memory was 241.9 MB in the beginning and 192.7 MB in the end (delta: 49.2 MB). Peak memory consumption was 179.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:46,080 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 303.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.03 ms. Allocated memory is still 303.6 MB. Free memory was 257.9 MB in the beginning and 255.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 33.35 ms. Allocated memory is still 303.6 MB. Free memory was 255.9 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 321.47 ms. Allocated memory is still 303.6 MB. Free memory was 254.0 MB in the beginning and 241.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 14905.81 ms. Allocated memory was 303.6 MB in the beginning and 434.1 MB in the end (delta: 130.5 MB). Free memory was 241.9 MB in the beginning and 192.7 MB in the end (delta: 49.2 MB). Peak memory consumption was 179.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, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] assume (((!(hbv_False_7_Int - hbv_False_8_Int + -1 >= 0) && !(hbv_False_9_Int == hbv_False_10_Int)) && !(hbv_False_5_Int - hbv_False_6_Int + -1 >= 0)) && hbv_False_3_Int == hbv_False_4_Int) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hbv_False_7_Int, hbv_False_11_Int, hbv_False_8_Int, hbv_False_12_Int, hbv_False_9_Int, hbv_False_5_Int, hbv_False_13_Int, hbv_False_6_Int, hbv_False_14_Int, hbv_False_10_Int, hbv_False_3_Int, hbv_False_1_Int, hbv_False_4_Int, hbv_False_2_Int; [L0] havoc hbv_False_13_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_4_Int, hbv_False_6_Int, hbv_False_2_Int, hbv_False_9_Int, hbv_False_12_Int, hbv_False_3_Int, hbv_False_5_Int, hbv_False_11_Int, hbv_False_10_Int, hbv_False_14_Int, hbv_False_1_Int; [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int; [L0] havoc hbv_INV1_1_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_4_Int, hbv_INV1_6_Int; [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && -1 * hhv_INV1_8_Int == -10) && hhv_INV1_10_Int == hhv_INV1_12_Int) && hbv_INV1_3_Int + hbv_INV1_4_Int == hhv_INV1_9_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && hbv_INV1_5_Int + -10 == 0) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_4_Int, hbv_INV1_3_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int; [L0] havoc hbv_INV1_1_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_4_Int, hbv_INV1_6_Int; [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int; [L0] havoc hbv_INV1_1_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_4_Int, hbv_INV1_6_Int; [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int; [L0] havoc hbv_INV1_1_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_4_Int, hbv_INV1_6_Int; [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int; [L0] havoc hbv_INV1_1_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_4_Int, hbv_INV1_6_Int; [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int; [L0] havoc hbv_INV1_1_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_4_Int, hbv_INV1_6_Int; [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int; [L0] havoc hbv_INV1_1_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_4_Int, hbv_INV1_6_Int; [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int; [L0] havoc hbv_INV1_1_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_4_Int, hbv_INV1_6_Int; [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int; [L0] havoc hbv_INV1_1_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_4_Int, hbv_INV1_6_Int; [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int; [L0] havoc hbv_INV1_1_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_4_Int, hbv_INV1_6_Int; [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int; [L0] havoc hbv_INV1_1_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_4_Int, hbv_INV1_6_Int; [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int; [L0] havoc hbv_INV1_1_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_4_Int, hbv_INV1_6_Int; [L0] assume ((((((((((hhv_INV1_10_Int == hhv_INV1_0_Int && -1 * hhv_INV1_2_Int == 0) && hhv_INV1_12_Int == hhv_INV1_5_Int) && -1 * hhv_INV1_7_Int == 0) && -1 * hhv_INV1_3_Int == 0) && hhv_INV1_8_Int == hhv_INV1_6_Int) && -1 * hhv_INV1_9_Int == 0) && hhv_INV1_0_Int == hhv_INV1_5_Int) && hhv_INV1_1_Int == hhv_INV1_6_Int) && -1 * hhv_INV1_4_Int == 0) && hhv_INV1_13_Int == hhv_INV1_6_Int) && hhv_INV1_11_Int == hhv_INV1_1_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. UNSAFE Result, 14.8s OverallTime, 24 OverallIterations, 11 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 180 SDtfs, 24 SDslu, 638 SDs, 0 SdLazy, 1950 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 256 SyntacticMatches, 31 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=23, 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, 23 MinimizatonAttempts, 171 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 586 NumberOfCodeBlocks, 586 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 62667 SizeOfPredicates, 77 NumberOfNonLiveVariables, 8117 ConjunctsInSsa, 1425 ConjunctsInUnsatCore, 44 InterpolantComputations, 4 PerfectInterpolantSequences, 217/1135 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/003d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-04-46-099.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-04-46-099.csv Received shutdown request...