java -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/chccomp2018/chcToBoogie_automizer.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_2.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 11:44:59,399 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 11:44:59,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 11:44:59,413 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 11:44:59,414 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 11:44:59,415 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 11:44:59,416 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 11:44:59,421 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 11:44:59,423 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 11:44:59,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 11:44:59,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 11:44:59,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 11:44:59,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 11:44:59,434 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 11:44:59,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 11:44:59,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 11:44:59,438 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 11:44:59,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 11:44:59,442 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 11:44:59,443 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 11:44:59,444 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 11:44:59,447 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 11:44:59,447 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 11:44:59,448 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 11:44:59,449 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 11:44:59,450 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 11:44:59,451 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 11:44:59,451 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 11:44:59,453 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 11:44:59,453 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 11:44:59,454 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 11:44:59,455 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 11:44:59,455 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 11:44:59,456 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 11:44:59,457 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 11:44:59,457 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 11:44:59,471 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 11:44:59,471 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 11:44:59,471 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 11:44:59,471 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 11:44:59,473 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 11:44:59,473 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 11:44:59,473 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 11:44:59,473 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 11:44:59,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 11:44:59,474 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 11:44:59,475 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 11:44:59,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 11:44:59,475 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 11:44:59,475 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 11:44:59,475 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 11:44:59,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 11:44:59,476 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 11:44:59,477 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 11:44:59,477 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 11:44:59,543 INFO ]: Repository-Root is: /tmp [2018-06-18 11:44:59,557 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 11:44:59,561 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 11:44:59,562 INFO ]: Initializing SmtParser... [2018-06-18 11:44:59,562 INFO ]: SmtParser initialized [2018-06-18 11:44:59,563 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_2.array.smt2 [2018-06-18 11:44:59,565 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-18 11:44:59,664 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_2.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@41bee816 [2018-06-18 11:44:59,968 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_2.array.smt2 [2018-06-18 11:44:59,975 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 11:44:59,980 INFO ]: Walking toolchain with 4 elements. [2018-06-18 11:44:59,981 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 11:44:59,981 INFO ]: Initializing ChcToBoogie... [2018-06-18 11:44:59,981 INFO ]: ChcToBoogie initialized [2018-06-18 11:44:59,988 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 11:44:59" (1/1) ... [2018-06-18 11:45:00,055 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:45:00 Unit [2018-06-18 11:45:00,055 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 11:45:00,056 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 11:45:00,056 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 11:45:00,056 INFO ]: Boogie Preprocessor initialized [2018-06-18 11:45:00,080 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:45:00" (1/1) ... [2018-06-18 11:45:00,080 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:45:00" (1/1) ... [2018-06-18 11:45:00,092 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:45:00" (1/1) ... [2018-06-18 11:45:00,093 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:45:00" (1/1) ... [2018-06-18 11:45:00,108 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:45:00" (1/1) ... [2018-06-18 11:45:00,117 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:45:00" (1/1) ... [2018-06-18 11:45:00,118 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:45:00" (1/1) ... [2018-06-18 11:45:00,120 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 11:45:00,121 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 11:45:00,121 INFO ]: Initializing RCFGBuilder... [2018-06-18 11:45:00,121 INFO ]: RCFGBuilder initialized [2018-06-18 11:45:00,122 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:45:00" (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-18 11:45:00,150 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 11:45:00,150 INFO ]: Found specification of procedure False [2018-06-18 11:45:00,150 INFO ]: Found implementation of procedure False [2018-06-18 11:45:00,150 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-18 11:45:00,150 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-18 11:45:00,150 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-18 11:45:00,150 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 11:45:00,150 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 11:45:00,150 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-18 11:45:00,651 INFO ]: Using library mode [2018-06-18 11:45:00,652 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 11:45:00 BoogieIcfgContainer [2018-06-18 11:45:00,652 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 11:45:00,653 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 11:45:00,653 INFO ]: Initializing TraceAbstraction... [2018-06-18 11:45:00,657 INFO ]: TraceAbstraction initialized [2018-06-18 11:45:00,657 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 11:44:59" (1/3) ... [2018-06-18 11:45:00,658 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c102b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 11:45:00, skipping insertion in model container [2018-06-18 11:45:00,658 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:45:00" (2/3) ... [2018-06-18 11:45:00,658 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c102b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 11:45:00, skipping insertion in model container [2018-06-18 11:45:00,658 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 11:45:00" (3/3) ... [2018-06-18 11:45:00,660 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 11:45:00,670 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 11:45:00,679 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 11:45:00,728 INFO ]: Using default assertion order modulation [2018-06-18 11:45:00,728 INFO ]: Interprodecural is true [2018-06-18 11:45:00,728 INFO ]: Hoare is false [2018-06-18 11:45:00,728 INFO ]: Compute interpolants for FPandBP [2018-06-18 11:45:00,728 INFO ]: Backedges is TWOTRACK [2018-06-18 11:45:00,728 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 11:45:00,728 INFO ]: Difference is false [2018-06-18 11:45:00,728 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 11:45:00,728 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 11:45:00,743 INFO ]: Start isEmpty. Operand 23 states. [2018-06-18 11:45:00,756 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:45:00,756 INFO ]: Found error trace [2018-06-18 11:45:00,757 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:00,758 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:00,761 INFO ]: Analyzing trace with hash -153473982, now seen corresponding path program 1 times [2018-06-18 11:45:00,763 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:00,763 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:00,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:00,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:00,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:00,854 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:00,861 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:01,069 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2018-06-18 11:45:01,095 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:45:01,096 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:45:01,097 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:45:01,100 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:45:01,117 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:45:01,118 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:01,121 INFO ]: Start difference. First operand 23 states. Second operand 4 states. [2018-06-18 11:45:01,565 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:01,566 INFO ]: Finished difference Result 25 states and 54 transitions. [2018-06-18 11:45:01,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:45:01,568 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:45:01,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:01,583 INFO ]: With dead ends: 25 [2018-06-18 11:45:01,583 INFO ]: Without dead ends: 25 [2018-06-18 11:45:01,586 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:01,613 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 11:45:01,665 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-18 11:45:01,666 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-18 11:45:01,669 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 52 transitions. [2018-06-18 11:45:01,670 INFO ]: Start accepts. Automaton has 23 states and 52 transitions. Word has length 9 [2018-06-18 11:45:01,671 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:01,671 INFO ]: Abstraction has 23 states and 52 transitions. [2018-06-18 11:45:01,672 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:45:01,672 INFO ]: Start isEmpty. Operand 23 states and 52 transitions. [2018-06-18 11:45:01,675 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:45:01,675 INFO ]: Found error trace [2018-06-18 11:45:01,675 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:01,675 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:01,676 INFO ]: Analyzing trace with hash -1146672466, now seen corresponding path program 1 times [2018-06-18 11:45:01,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:01,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:01,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:01,678 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:01,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:01,693 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:01,693 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:01,933 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-18 11:45:01,935 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:45:01,935 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:45:01,935 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:45:01,936 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:45:01,937 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:45:01,937 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:01,938 INFO ]: Start difference. First operand 23 states and 52 transitions. Second operand 4 states. [2018-06-18 11:45:02,452 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:02,453 INFO ]: Finished difference Result 27 states and 65 transitions. [2018-06-18 11:45:02,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:45:02,456 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:45:02,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:02,457 INFO ]: With dead ends: 27 [2018-06-18 11:45:02,457 INFO ]: Without dead ends: 27 [2018-06-18 11:45:02,458 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:02,458 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 11:45:02,474 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-18 11:45:02,474 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:02,479 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 63 transitions. [2018-06-18 11:45:02,479 INFO ]: Start accepts. Automaton has 25 states and 63 transitions. Word has length 9 [2018-06-18 11:45:02,479 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:02,479 INFO ]: Abstraction has 25 states and 63 transitions. [2018-06-18 11:45:02,479 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:45:02,479 INFO ]: Start isEmpty. Operand 25 states and 63 transitions. [2018-06-18 11:45:02,481 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:45:02,481 INFO ]: Found error trace [2018-06-18 11:45:02,481 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:02,481 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:02,481 INFO ]: Analyzing trace with hash 1745710045, now seen corresponding path program 1 times [2018-06-18 11:45:02,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:02,481 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:02,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:02,484 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:02,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:02,526 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:02,527 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:02,666 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:45:02,666 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:45:02,666 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:45:02,666 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:45:02,667 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:45:02,667 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:02,667 INFO ]: Start difference. First operand 25 states and 63 transitions. Second operand 4 states. [2018-06-18 11:45:02,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:02,855 INFO ]: Finished difference Result 27 states and 63 transitions. [2018-06-18 11:45:02,855 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:45:02,855 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:45:02,855 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:02,856 INFO ]: With dead ends: 27 [2018-06-18 11:45:02,857 INFO ]: Without dead ends: 27 [2018-06-18 11:45:02,857 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:02,857 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 11:45:02,870 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-18 11:45:02,870 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:02,874 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 61 transitions. [2018-06-18 11:45:02,874 INFO ]: Start accepts. Automaton has 25 states and 61 transitions. Word has length 9 [2018-06-18 11:45:02,874 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:02,874 INFO ]: Abstraction has 25 states and 61 transitions. [2018-06-18 11:45:02,874 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:45:02,874 INFO ]: Start isEmpty. Operand 25 states and 61 transitions. [2018-06-18 11:45:02,876 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:45:02,876 INFO ]: Found error trace [2018-06-18 11:45:02,876 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:02,876 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:02,876 INFO ]: Analyzing trace with hash 752511561, now seen corresponding path program 1 times [2018-06-18 11:45:02,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:02,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:02,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:02,877 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:02,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:02,892 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:02,893 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:02,941 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:45:02,941 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:45:02,941 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:45:02,941 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:45:02,941 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:45:02,941 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:02,941 INFO ]: Start difference. First operand 25 states and 61 transitions. Second operand 4 states. [2018-06-18 11:45:03,279 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:03,279 INFO ]: Finished difference Result 27 states and 62 transitions. [2018-06-18 11:45:03,280 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:45:03,280 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:45:03,280 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:03,281 INFO ]: With dead ends: 27 [2018-06-18 11:45:03,281 INFO ]: Without dead ends: 27 [2018-06-18 11:45:03,281 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:03,281 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 11:45:03,291 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-18 11:45:03,293 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:03,294 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 60 transitions. [2018-06-18 11:45:03,294 INFO ]: Start accepts. Automaton has 25 states and 60 transitions. Word has length 9 [2018-06-18 11:45:03,294 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:03,295 INFO ]: Abstraction has 25 states and 60 transitions. [2018-06-18 11:45:03,295 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:45:03,295 INFO ]: Start isEmpty. Operand 25 states and 60 transitions. [2018-06-18 11:45:03,296 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:45:03,296 INFO ]: Found error trace [2018-06-18 11:45:03,296 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:03,296 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:03,296 INFO ]: Analyzing trace with hash -833925082, now seen corresponding path program 1 times [2018-06-18 11:45:03,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:03,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:03,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:03,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:03,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:03,314 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:03,317 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:03,370 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:45:03,370 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:45:03,370 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:45:03,370 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:45:03,370 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:45:03,370 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:03,370 INFO ]: Start difference. First operand 25 states and 60 transitions. Second operand 4 states. [2018-06-18 11:45:03,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:03,727 INFO ]: Finished difference Result 27 states and 61 transitions. [2018-06-18 11:45:03,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:45:03,729 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:45:03,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:03,730 INFO ]: With dead ends: 27 [2018-06-18 11:45:03,730 INFO ]: Without dead ends: 27 [2018-06-18 11:45:03,730 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:03,730 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 11:45:03,740 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-18 11:45:03,740 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:03,741 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 59 transitions. [2018-06-18 11:45:03,741 INFO ]: Start accepts. Automaton has 25 states and 59 transitions. Word has length 9 [2018-06-18 11:45:03,741 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:03,741 INFO ]: Abstraction has 25 states and 59 transitions. [2018-06-18 11:45:03,741 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:45:03,741 INFO ]: Start isEmpty. Operand 25 states and 59 transitions. [2018-06-18 11:45:03,742 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:45:03,742 INFO ]: Found error trace [2018-06-18 11:45:03,742 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:03,742 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:03,742 INFO ]: Analyzing trace with hash 1249110803, now seen corresponding path program 1 times [2018-06-18 11:45:03,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:03,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:03,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:03,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:03,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:03,773 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:03,774 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:04,102 WARN ]: Spent 211.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-18 11:45:04,295 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-18 11:45:04,295 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:45:04,296 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:45:04,296 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:45:04,296 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:45:04,296 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:45:04,296 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:04,296 INFO ]: Start difference. First operand 25 states and 59 transitions. Second operand 4 states. [2018-06-18 11:45:04,771 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:04,771 INFO ]: Finished difference Result 27 states and 59 transitions. [2018-06-18 11:45:04,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:45:04,772 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:45:04,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:04,772 INFO ]: With dead ends: 27 [2018-06-18 11:45:04,772 INFO ]: Without dead ends: 27 [2018-06-18 11:45:04,773 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:04,773 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 11:45:04,778 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-18 11:45:04,778 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:04,779 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 57 transitions. [2018-06-18 11:45:04,779 INFO ]: Start accepts. Automaton has 25 states and 57 transitions. Word has length 9 [2018-06-18 11:45:04,779 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:04,779 INFO ]: Abstraction has 25 states and 57 transitions. [2018-06-18 11:45:04,779 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:45:04,779 INFO ]: Start isEmpty. Operand 25 states and 57 transitions. [2018-06-18 11:45:04,781 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:04,781 INFO ]: Found error trace [2018-06-18 11:45:04,781 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:04,781 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:04,781 INFO ]: Analyzing trace with hash -267318325, now seen corresponding path program 1 times [2018-06-18 11:45:04,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:04,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:04,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:04,782 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:04,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:04,802 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:04,803 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:04,899 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:04,899 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:04,899 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:45:04,907 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:04,932 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:04,940 INFO ]: Computing forward predicates... [2018-06-18 11:45:05,019 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:05,045 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:05,045 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-18 11:45:05,045 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:45:05,046 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:45:05,046 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:45:05,046 INFO ]: Start difference. First operand 25 states and 57 transitions. Second operand 6 states. [2018-06-18 11:45:05,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:05,241 INFO ]: Finished difference Result 29 states and 70 transitions. [2018-06-18 11:45:05,243 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:45:05,243 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 11:45:05,244 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:05,245 INFO ]: With dead ends: 29 [2018-06-18 11:45:05,245 INFO ]: Without dead ends: 29 [2018-06-18 11:45:05,245 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:45:05,245 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 11:45:05,252 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-18 11:45:05,252 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:05,253 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 55 transitions. [2018-06-18 11:45:05,253 INFO ]: Start accepts. Automaton has 25 states and 55 transitions. Word has length 13 [2018-06-18 11:45:05,253 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:05,253 INFO ]: Abstraction has 25 states and 55 transitions. [2018-06-18 11:45:05,253 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:45:05,253 INFO ]: Start isEmpty. Operand 25 states and 55 transitions. [2018-06-18 11:45:05,254 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:05,254 INFO ]: Found error trace [2018-06-18 11:45:05,255 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:05,255 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:05,255 INFO ]: Analyzing trace with hash -11964294, now seen corresponding path program 1 times [2018-06-18 11:45:05,255 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:05,255 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:05,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:05,256 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:05,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:05,270 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:05,273 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:05,570 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:05,570 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:05,570 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:45:05,584 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:05,599 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:05,601 INFO ]: Computing forward predicates... [2018-06-18 11:45:05,617 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:05,639 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:05,639 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-18 11:45:05,640 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:45:05,640 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:45:05,640 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:45:05,640 INFO ]: Start difference. First operand 25 states and 55 transitions. Second operand 6 states. [2018-06-18 11:45:05,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:05,991 INFO ]: Finished difference Result 29 states and 67 transitions. [2018-06-18 11:45:05,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:45:05,991 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 11:45:05,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:05,992 INFO ]: With dead ends: 29 [2018-06-18 11:45:05,992 INFO ]: Without dead ends: 29 [2018-06-18 11:45:05,993 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:45:05,993 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 11:45:05,998 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-18 11:45:05,998 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:05,998 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2018-06-18 11:45:05,998 INFO ]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2018-06-18 11:45:05,999 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:05,999 INFO ]: Abstraction has 25 states and 52 transitions. [2018-06-18 11:45:05,999 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:45:05,999 INFO ]: Start isEmpty. Operand 25 states and 52 transitions. [2018-06-18 11:45:06,000 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:06,000 INFO ]: Found error trace [2018-06-18 11:45:06,000 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:06,000 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:06,000 INFO ]: Analyzing trace with hash -1613856080, now seen corresponding path program 1 times [2018-06-18 11:45:06,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:06,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:06,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:06,001 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:06,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:06,011 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:06,011 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:06,103 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:06,103 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:06,103 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-18 11:45:06,109 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:06,120 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:06,123 INFO ]: Computing forward predicates... [2018-06-18 11:45:06,146 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:06,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:06,177 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-18 11:45:06,177 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:45:06,178 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:45:06,178 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:45:06,178 INFO ]: Start difference. First operand 25 states and 52 transitions. Second operand 6 states. [2018-06-18 11:45:06,318 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:06,318 INFO ]: Finished difference Result 29 states and 66 transitions. [2018-06-18 11:45:06,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:45:06,319 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 11:45:06,319 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:06,320 INFO ]: With dead ends: 29 [2018-06-18 11:45:06,320 INFO ]: Without dead ends: 29 [2018-06-18 11:45:06,321 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:45:06,321 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 11:45:06,325 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-18 11:45:06,325 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:06,326 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 51 transitions. [2018-06-18 11:45:06,326 INFO ]: Start accepts. Automaton has 25 states and 51 transitions. Word has length 13 [2018-06-18 11:45:06,326 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:06,326 INFO ]: Abstraction has 25 states and 51 transitions. [2018-06-18 11:45:06,326 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:45:06,327 INFO ]: Start isEmpty. Operand 25 states and 51 transitions. [2018-06-18 11:45:06,327 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:06,327 INFO ]: Found error trace [2018-06-18 11:45:06,327 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:06,328 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:06,328 INFO ]: Analyzing trace with hash 1912237716, now seen corresponding path program 1 times [2018-06-18 11:45:06,328 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:06,328 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:06,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:06,329 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:06,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:06,361 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:06,362 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:06,412 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:06,412 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:45:06,412 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:45:06,412 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:45:06,412 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:45:06,412 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:06,412 INFO ]: Start difference. First operand 25 states and 51 transitions. Second operand 4 states. [2018-06-18 11:45:06,546 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:06,546 INFO ]: Finished difference Result 25 states and 58 transitions. [2018-06-18 11:45:06,546 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:45:06,546 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-18 11:45:06,546 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:06,547 INFO ]: With dead ends: 25 [2018-06-18 11:45:06,547 INFO ]: Without dead ends: 25 [2018-06-18 11:45:06,547 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:45:06,547 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 11:45:06,551 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-18 11:45:06,551 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-18 11:45:06,552 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 45 transitions. [2018-06-18 11:45:06,552 INFO ]: Start accepts. Automaton has 23 states and 45 transitions. Word has length 13 [2018-06-18 11:45:06,552 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:06,552 INFO ]: Abstraction has 23 states and 45 transitions. [2018-06-18 11:45:06,552 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:45:06,552 INFO ]: Start isEmpty. Operand 23 states and 45 transitions. [2018-06-18 11:45:06,553 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:06,553 INFO ]: Found error trace [2018-06-18 11:45:06,553 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:06,553 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:06,553 INFO ]: Analyzing trace with hash 578614546, now seen corresponding path program 1 times [2018-06-18 11:45:06,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:06,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:06,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:06,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:06,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:06,574 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:06,575 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:06,705 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:45:06,705 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:45:06,706 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-18 11:45:06,706 INFO ]: Interpolant automaton has 5 states [2018-06-18 11:45:06,706 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-18 11:45:06,706 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-18 11:45:06,706 INFO ]: Start difference. First operand 23 states and 45 transitions. Second operand 5 states. [2018-06-18 11:45:06,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:06,919 INFO ]: Finished difference Result 29 states and 72 transitions. [2018-06-18 11:45:06,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-18 11:45:06,919 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-18 11:45:06,919 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:06,920 INFO ]: With dead ends: 29 [2018-06-18 11:45:06,920 INFO ]: Without dead ends: 29 [2018-06-18 11:45:06,920 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-18 11:45:06,920 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 11:45:06,926 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-18 11:45:06,926 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:06,926 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 57 transitions. [2018-06-18 11:45:06,926 INFO ]: Start accepts. Automaton has 25 states and 57 transitions. Word has length 13 [2018-06-18 11:45:06,927 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:06,927 INFO ]: Abstraction has 25 states and 57 transitions. [2018-06-18 11:45:06,927 INFO ]: Interpolant automaton has 5 states. [2018-06-18 11:45:06,927 INFO ]: Start isEmpty. Operand 25 states and 57 transitions. [2018-06-18 11:45:06,927 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:06,927 INFO ]: Found error trace [2018-06-18 11:45:06,928 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:06,928 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:06,928 INFO ]: Analyzing trace with hash -1859106933, now seen corresponding path program 1 times [2018-06-18 11:45:06,928 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:06,928 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:06,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:06,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:06,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:06,951 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:06,952 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:07,143 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:45:07,143 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:45:07,143 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-18 11:45:07,143 INFO ]: Interpolant automaton has 5 states [2018-06-18 11:45:07,143 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-18 11:45:07,143 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-18 11:45:07,143 INFO ]: Start difference. First operand 25 states and 57 transitions. Second operand 5 states. [2018-06-18 11:45:07,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:07,347 INFO ]: Finished difference Result 29 states and 69 transitions. [2018-06-18 11:45:07,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-18 11:45:07,349 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-18 11:45:07,349 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:07,349 INFO ]: With dead ends: 29 [2018-06-18 11:45:07,349 INFO ]: Without dead ends: 29 [2018-06-18 11:45:07,350 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-18 11:45:07,350 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 11:45:07,358 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-18 11:45:07,358 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:07,359 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2018-06-18 11:45:07,359 INFO ]: Start accepts. Automaton has 25 states and 54 transitions. Word has length 13 [2018-06-18 11:45:07,359 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:07,359 INFO ]: Abstraction has 25 states and 54 transitions. [2018-06-18 11:45:07,359 INFO ]: Interpolant automaton has 5 states. [2018-06-18 11:45:07,359 INFO ]: Start isEmpty. Operand 25 states and 54 transitions. [2018-06-18 11:45:07,366 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:07,366 INFO ]: Found error trace [2018-06-18 11:45:07,366 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:07,366 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:07,366 INFO ]: Analyzing trace with hash -767923209, now seen corresponding path program 1 times [2018-06-18 11:45:07,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:07,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:07,367 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:07,367 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:07,367 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:07,379 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:07,379 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:07,643 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:07,643 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:45:07,643 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-18 11:45:07,643 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:45:07,643 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:45:07,643 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:45:07,643 INFO ]: Start difference. First operand 25 states and 54 transitions. Second operand 6 states. [2018-06-18 11:45:07,876 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:07,876 INFO ]: Finished difference Result 25 states and 52 transitions. [2018-06-18 11:45:07,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-18 11:45:07,877 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 11:45:07,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:07,878 INFO ]: With dead ends: 25 [2018-06-18 11:45:07,878 INFO ]: Without dead ends: 24 [2018-06-18 11:45:07,878 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:45:07,878 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-18 11:45:07,882 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-18 11:45:07,882 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-18 11:45:07,882 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2018-06-18 11:45:07,882 INFO ]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 13 [2018-06-18 11:45:07,882 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:07,882 INFO ]: Abstraction has 24 states and 50 transitions. [2018-06-18 11:45:07,882 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:45:07,882 INFO ]: Start isEmpty. Operand 24 states and 50 transitions. [2018-06-18 11:45:07,884 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:07,884 INFO ]: Found error trace [2018-06-18 11:45:07,884 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:07,884 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:07,884 INFO ]: Analyzing trace with hash -512569178, now seen corresponding path program 1 times [2018-06-18 11:45:07,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:07,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:07,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:07,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:07,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:07,892 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:07,893 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:08,069 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-18 11:45:08,106 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:08,106 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:08,106 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-18 11:45:08,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:08,140 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:08,142 INFO ]: Computing forward predicates... [2018-06-18 11:45:08,326 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:45:08,348 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-18 11:45:08,348 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2018-06-18 11:45:08,349 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:45:08,349 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:45:08,349 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:45:08,349 INFO ]: Start difference. First operand 24 states and 50 transitions. Second operand 6 states. [2018-06-18 11:45:08,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:08,477 INFO ]: Finished difference Result 28 states and 62 transitions. [2018-06-18 11:45:08,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:45:08,477 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 11:45:08,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:08,478 INFO ]: With dead ends: 28 [2018-06-18 11:45:08,478 INFO ]: Without dead ends: 28 [2018-06-18 11:45:08,478 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:45:08,478 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-18 11:45:08,483 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-18 11:45:08,483 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-18 11:45:08,484 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 48 transitions. [2018-06-18 11:45:08,484 INFO ]: Start accepts. Automaton has 24 states and 48 transitions. Word has length 13 [2018-06-18 11:45:08,484 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:08,484 INFO ]: Abstraction has 24 states and 48 transitions. [2018-06-18 11:45:08,484 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:45:08,484 INFO ]: Start isEmpty. Operand 24 states and 48 transitions. [2018-06-18 11:45:08,485 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:08,485 INFO ]: Found error trace [2018-06-18 11:45:08,485 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:08,485 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:08,485 INFO ]: Analyzing trace with hash 1666986863, now seen corresponding path program 1 times [2018-06-18 11:45:08,485 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:08,485 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:08,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:08,486 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:08,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:08,509 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:08,510 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:08,710 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:08,710 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:08,710 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-18 11:45:08,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:08,736 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:08,738 INFO ]: Computing forward predicates... [2018-06-18 11:45:08,782 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:08,804 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-18 11:45:08,804 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-06-18 11:45:08,804 INFO ]: Interpolant automaton has 7 states [2018-06-18 11:45:08,804 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-18 11:45:08,804 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:45:08,804 INFO ]: Start difference. First operand 24 states and 48 transitions. Second operand 7 states. [2018-06-18 11:45:08,940 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:08,940 INFO ]: Finished difference Result 28 states and 61 transitions. [2018-06-18 11:45:08,940 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:45:08,940 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-18 11:45:08,940 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:08,941 INFO ]: With dead ends: 28 [2018-06-18 11:45:08,941 INFO ]: Without dead ends: 28 [2018-06-18 11:45:08,941 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:45:08,941 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-18 11:45:08,945 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-18 11:45:08,945 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-18 11:45:08,945 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 47 transitions. [2018-06-18 11:45:08,945 INFO ]: Start accepts. Automaton has 24 states and 47 transitions. Word has length 13 [2018-06-18 11:45:08,945 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:08,945 INFO ]: Abstraction has 24 states and 47 transitions. [2018-06-18 11:45:08,945 INFO ]: Interpolant automaton has 7 states. [2018-06-18 11:45:08,946 INFO ]: Start isEmpty. Operand 24 states and 47 transitions. [2018-06-18 11:45:08,946 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:08,946 INFO ]: Found error trace [2018-06-18 11:45:08,946 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:08,946 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:08,947 INFO ]: Analyzing trace with hash -2114460964, now seen corresponding path program 1 times [2018-06-18 11:45:08,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:08,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:08,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:08,947 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:08,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:08,955 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:08,956 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:09,167 WARN ]: Spent 174.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-18 11:45:09,182 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:09,182 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:45:09,182 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-18 11:45:09,182 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:45:09,182 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:45:09,182 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:45:09,182 INFO ]: Start difference. First operand 24 states and 47 transitions. Second operand 6 states. [2018-06-18 11:45:09,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:09,247 INFO ]: Finished difference Result 26 states and 47 transitions. [2018-06-18 11:45:09,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-18 11:45:09,247 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 11:45:09,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:09,248 INFO ]: With dead ends: 26 [2018-06-18 11:45:09,248 INFO ]: Without dead ends: 25 [2018-06-18 11:45:09,248 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:45:09,248 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 11:45:09,251 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-18 11:45:09,251 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-18 11:45:09,252 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 43 transitions. [2018-06-18 11:45:09,252 INFO ]: Start accepts. Automaton has 23 states and 43 transitions. Word has length 13 [2018-06-18 11:45:09,252 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:09,252 INFO ]: Abstraction has 23 states and 43 transitions. [2018-06-18 11:45:09,252 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:45:09,252 INFO ]: Start isEmpty. Operand 23 states and 43 transitions. [2018-06-18 11:45:09,253 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:09,253 INFO ]: Found error trace [2018-06-18 11:45:09,253 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:09,253 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:09,253 INFO ]: Analyzing trace with hash -1150847041, now seen corresponding path program 1 times [2018-06-18 11:45:09,253 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:09,253 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:09,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:09,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:09,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:09,262 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:09,263 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:09,300 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:09,300 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:45:09,300 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-18 11:45:09,301 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:45:09,301 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:45:09,301 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:45:09,301 INFO ]: Start difference. First operand 23 states and 43 transitions. Second operand 6 states. [2018-06-18 11:45:09,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:09,419 INFO ]: Finished difference Result 29 states and 65 transitions. [2018-06-18 11:45:09,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:45:09,419 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 11:45:09,419 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:09,420 INFO ]: With dead ends: 29 [2018-06-18 11:45:09,420 INFO ]: Without dead ends: 29 [2018-06-18 11:45:09,420 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:45:09,420 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 11:45:09,424 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-18 11:45:09,424 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:09,425 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2018-06-18 11:45:09,425 INFO ]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2018-06-18 11:45:09,425 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:09,425 INFO ]: Abstraction has 25 states and 52 transitions. [2018-06-18 11:45:09,425 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:45:09,425 INFO ]: Start isEmpty. Operand 25 states and 52 transitions. [2018-06-18 11:45:09,426 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:09,426 INFO ]: Found error trace [2018-06-18 11:45:09,426 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:09,426 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:09,426 INFO ]: Analyzing trace with hash 451044745, now seen corresponding path program 1 times [2018-06-18 11:45:09,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:09,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:09,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:09,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:09,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:09,436 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:09,437 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:09,561 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:09,561 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:09,561 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-18 11:45:09,567 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:09,593 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:09,595 INFO ]: Computing forward predicates... [2018-06-18 11:45:09,813 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:09,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:09,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-18 11:45:09,833 INFO ]: Interpolant automaton has 10 states [2018-06-18 11:45:09,833 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-18 11:45:09,833 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:45:09,834 INFO ]: Start difference. First operand 25 states and 52 transitions. Second operand 10 states. [2018-06-18 11:45:12,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:12,260 INFO ]: Finished difference Result 31 states and 74 transitions. [2018-06-18 11:45:12,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 11:45:12,260 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-18 11:45:12,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:12,261 INFO ]: With dead ends: 31 [2018-06-18 11:45:12,261 INFO ]: Without dead ends: 31 [2018-06-18 11:45:12,261 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-18 11:45:12,261 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-18 11:45:12,266 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-18 11:45:12,266 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:12,267 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 50 transitions. [2018-06-18 11:45:12,267 INFO ]: Start accepts. Automaton has 25 states and 50 transitions. Word has length 13 [2018-06-18 11:45:12,267 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:12,267 INFO ]: Abstraction has 25 states and 50 transitions. [2018-06-18 11:45:12,267 INFO ]: Interpolant automaton has 10 states. [2018-06-18 11:45:12,267 INFO ]: Start isEmpty. Operand 25 states and 50 transitions. [2018-06-18 11:45:12,268 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:12,268 INFO ]: Found error trace [2018-06-18 11:45:12,268 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:12,268 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:12,268 INFO ]: Analyzing trace with hash 1028709000, now seen corresponding path program 1 times [2018-06-18 11:45:12,268 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:12,268 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:12,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:12,269 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:12,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:12,276 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:12,276 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:12,392 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:12,392 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:12,392 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-18 11:45:12,401 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:12,424 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:12,426 INFO ]: Computing forward predicates... [2018-06-18 11:45:12,513 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:12,534 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:12,534 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-18 11:45:12,534 INFO ]: Interpolant automaton has 8 states [2018-06-18 11:45:12,534 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 11:45:12,534 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:45:12,535 INFO ]: Start difference. First operand 25 states and 50 transitions. Second operand 8 states. [2018-06-18 11:45:12,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:12,848 INFO ]: Finished difference Result 31 states and 68 transitions. [2018-06-18 11:45:12,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 11:45:12,849 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-18 11:45:12,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:12,849 INFO ]: With dead ends: 31 [2018-06-18 11:45:12,849 INFO ]: Without dead ends: 31 [2018-06-18 11:45:12,850 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-18 11:45:12,850 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-18 11:45:12,853 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-18 11:45:12,854 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:12,854 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2018-06-18 11:45:12,854 INFO ]: Start accepts. Automaton has 25 states and 49 transitions. Word has length 13 [2018-06-18 11:45:12,854 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:12,854 INFO ]: Abstraction has 25 states and 49 transitions. [2018-06-18 11:45:12,854 INFO ]: Interpolant automaton has 8 states. [2018-06-18 11:45:12,854 INFO ]: Start isEmpty. Operand 25 states and 49 transitions. [2018-06-18 11:45:12,855 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:12,855 INFO ]: Found error trace [2018-06-18 11:45:12,855 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:12,855 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:12,855 INFO ]: Analyzing trace with hash -59663317, now seen corresponding path program 1 times [2018-06-18 11:45:12,855 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:12,855 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:12,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:12,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:12,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:12,861 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:12,861 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:12,946 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:12,946 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:12,946 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:45:12,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:12,963 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:12,966 INFO ]: Computing forward predicates... [2018-06-18 11:45:13,029 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:13,050 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:13,050 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-18 11:45:13,050 INFO ]: Interpolant automaton has 9 states [2018-06-18 11:45:13,050 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-18 11:45:13,050 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-18 11:45:13,051 INFO ]: Start difference. First operand 25 states and 49 transitions. Second operand 9 states. [2018-06-18 11:45:13,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:13,523 INFO ]: Finished difference Result 29 states and 61 transitions. [2018-06-18 11:45:13,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:45:13,524 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-18 11:45:13,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:13,524 INFO ]: With dead ends: 29 [2018-06-18 11:45:13,524 INFO ]: Without dead ends: 29 [2018-06-18 11:45:13,524 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-18 11:45:13,524 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 11:45:13,528 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-18 11:45:13,532 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:13,532 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 48 transitions. [2018-06-18 11:45:13,532 INFO ]: Start accepts. Automaton has 25 states and 48 transitions. Word has length 13 [2018-06-18 11:45:13,532 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:13,532 INFO ]: Abstraction has 25 states and 48 transitions. [2018-06-18 11:45:13,532 INFO ]: Interpolant automaton has 9 states. [2018-06-18 11:45:13,532 INFO ]: Start isEmpty. Operand 25 states and 48 transitions. [2018-06-18 11:45:13,533 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:45:13,533 INFO ]: Found error trace [2018-06-18 11:45:13,533 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:13,533 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:13,533 INFO ]: Analyzing trace with hash 1797582500, now seen corresponding path program 1 times [2018-06-18 11:45:13,534 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:13,534 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:13,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:13,534 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:13,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:13,542 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:13,542 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:13,971 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:13,971 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:13,971 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) [2018-06-18 11:45:14,009 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:45:14,034 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:14,036 INFO ]: Computing forward predicates... [2018-06-18 11:45:14,503 WARN ]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-18 11:45:14,833 WARN ]: Spent 148.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-06-18 11:45:14,835 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:45:14,858 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:14,858 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-18 11:45:14,859 INFO ]: Interpolant automaton has 9 states [2018-06-18 11:45:14,859 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-18 11:45:14,859 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-18 11:45:14,859 INFO ]: Start difference. First operand 25 states and 48 transitions. Second operand 9 states. [2018-06-18 11:45:15,070 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-06-18 11:45:15,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:15,296 INFO ]: Finished difference Result 31 states and 62 transitions. [2018-06-18 11:45:15,297 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 11:45:15,297 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-18 11:45:15,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:15,297 INFO ]: With dead ends: 31 [2018-06-18 11:45:15,297 INFO ]: Without dead ends: 31 [2018-06-18 11:45:15,298 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-18 11:45:15,298 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-18 11:45:15,307 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-18 11:45:15,307 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:45:15,307 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 47 transitions. [2018-06-18 11:45:15,307 INFO ]: Start accepts. Automaton has 25 states and 47 transitions. Word has length 13 [2018-06-18 11:45:15,308 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:15,308 INFO ]: Abstraction has 25 states and 47 transitions. [2018-06-18 11:45:15,308 INFO ]: Interpolant automaton has 9 states. [2018-06-18 11:45:15,308 INFO ]: Start isEmpty. Operand 25 states and 47 transitions. [2018-06-18 11:45:15,308 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:45:15,308 INFO ]: Found error trace [2018-06-18 11:45:15,308 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:15,308 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:15,309 INFO ]: Analyzing trace with hash 214842809, now seen corresponding path program 1 times [2018-06-18 11:45:15,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:15,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:15,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:15,309 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:15,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:15,339 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:15,343 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:15,522 WARN ]: Spent 121.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-06-18 11:45:15,579 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:15,579 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:15,579 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-18 11:45:15,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:15,602 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:15,604 INFO ]: Computing forward predicates... [2018-06-18 11:45:15,649 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:15,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:15,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-18 11:45:15,669 INFO ]: Interpolant automaton has 8 states [2018-06-18 11:45:15,670 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 11:45:15,670 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:45:15,670 INFO ]: Start difference. First operand 25 states and 47 transitions. Second operand 8 states. [2018-06-18 11:45:16,060 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:16,060 INFO ]: Finished difference Result 33 states and 81 transitions. [2018-06-18 11:45:16,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:45:16,062 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-18 11:45:16,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:16,062 INFO ]: With dead ends: 33 [2018-06-18 11:45:16,062 INFO ]: Without dead ends: 33 [2018-06-18 11:45:16,062 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:45:16,063 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-18 11:45:16,066 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-18 11:45:16,067 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 11:45:16,067 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 57 transitions. [2018-06-18 11:45:16,067 INFO ]: Start accepts. Automaton has 27 states and 57 transitions. Word has length 17 [2018-06-18 11:45:16,067 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:16,067 INFO ]: Abstraction has 27 states and 57 transitions. [2018-06-18 11:45:16,067 INFO ]: Interpolant automaton has 8 states. [2018-06-18 11:45:16,067 INFO ]: Start isEmpty. Operand 27 states and 57 transitions. [2018-06-18 11:45:16,068 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:45:16,068 INFO ]: Found error trace [2018-06-18 11:45:16,068 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:16,068 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:16,068 INFO ]: Analyzing trace with hash 1139827439, now seen corresponding path program 1 times [2018-06-18 11:45:16,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:16,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:16,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:16,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:16,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:16,079 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:16,080 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:16,272 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:16,272 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:16,272 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-18 11:45:16,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:16,293 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:16,295 INFO ]: Computing forward predicates... [2018-06-18 11:45:16,327 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:16,346 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:16,346 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-18 11:45:16,346 INFO ]: Interpolant automaton has 8 states [2018-06-18 11:45:16,346 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 11:45:16,346 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:45:16,347 INFO ]: Start difference. First operand 27 states and 57 transitions. Second operand 8 states. [2018-06-18 11:45:16,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:16,520 INFO ]: Finished difference Result 33 states and 78 transitions. [2018-06-18 11:45:16,521 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:45:16,521 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-18 11:45:16,521 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:16,521 INFO ]: With dead ends: 33 [2018-06-18 11:45:16,521 INFO ]: Without dead ends: 33 [2018-06-18 11:45:16,521 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-18 11:45:16,522 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-18 11:45:16,525 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-18 11:45:16,525 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 11:45:16,525 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 54 transitions. [2018-06-18 11:45:16,526 INFO ]: Start accepts. Automaton has 27 states and 54 transitions. Word has length 17 [2018-06-18 11:45:16,526 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:16,526 INFO ]: Abstraction has 27 states and 54 transitions. [2018-06-18 11:45:16,526 INFO ]: Interpolant automaton has 8 states. [2018-06-18 11:45:16,526 INFO ]: Start isEmpty. Operand 27 states and 54 transitions. [2018-06-18 11:45:16,527 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:45:16,527 INFO ]: Found error trace [2018-06-18 11:45:16,527 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:16,527 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:16,527 INFO ]: Analyzing trace with hash -247649506, now seen corresponding path program 1 times [2018-06-18 11:45:16,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:16,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:16,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:16,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:16,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:16,540 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:16,541 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:16,611 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:16,611 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:16,611 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-18 11:45:16,632 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:16,651 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:16,653 INFO ]: Computing forward predicates... [2018-06-18 11:45:16,726 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:16,760 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:16,760 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-18 11:45:16,760 INFO ]: Interpolant automaton has 8 states [2018-06-18 11:45:16,761 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 11:45:16,761 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:45:16,761 INFO ]: Start difference. First operand 27 states and 54 transitions. Second operand 8 states. [2018-06-18 11:45:17,252 WARN ]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-18 11:45:17,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:17,482 INFO ]: Finished difference Result 33 states and 76 transitions. [2018-06-18 11:45:17,482 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:45:17,482 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-18 11:45:17,482 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:17,482 INFO ]: With dead ends: 33 [2018-06-18 11:45:17,482 INFO ]: Without dead ends: 33 [2018-06-18 11:45:17,482 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:45:17,483 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-18 11:45:17,485 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-18 11:45:17,485 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 11:45:17,485 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 52 transitions. [2018-06-18 11:45:17,485 INFO ]: Start accepts. Automaton has 27 states and 52 transitions. Word has length 17 [2018-06-18 11:45:17,485 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:17,485 INFO ]: Abstraction has 27 states and 52 transitions. [2018-06-18 11:45:17,485 INFO ]: Interpolant automaton has 8 states. [2018-06-18 11:45:17,486 INFO ]: Start isEmpty. Operand 27 states and 52 transitions. [2018-06-18 11:45:17,486 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:45:17,486 INFO ]: Found error trace [2018-06-18 11:45:17,486 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:17,486 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:17,486 INFO ]: Analyzing trace with hash -284102243, now seen corresponding path program 1 times [2018-06-18 11:45:17,487 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:17,487 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:17,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:17,487 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:17,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:17,502 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:17,502 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:17,618 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:45:17,618 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:17,618 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-18 11:45:17,627 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:17,645 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:17,648 INFO ]: Computing forward predicates... [2018-06-18 11:45:17,716 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:45:17,735 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:17,736 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-18 11:45:17,736 INFO ]: Interpolant automaton has 8 states [2018-06-18 11:45:17,736 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 11:45:17,736 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:45:17,736 INFO ]: Start difference. First operand 27 states and 52 transitions. Second operand 8 states. [2018-06-18 11:45:17,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:17,933 INFO ]: Finished difference Result 33 states and 75 transitions. [2018-06-18 11:45:17,934 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:45:17,934 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-18 11:45:17,934 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:17,934 INFO ]: With dead ends: 33 [2018-06-18 11:45:17,935 INFO ]: Without dead ends: 33 [2018-06-18 11:45:17,935 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:45:17,935 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-18 11:45:17,937 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-18 11:45:17,937 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 11:45:17,938 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 51 transitions. [2018-06-18 11:45:17,938 INFO ]: Start accepts. Automaton has 27 states and 51 transitions. Word has length 17 [2018-06-18 11:45:17,938 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:17,938 INFO ]: Abstraction has 27 states and 51 transitions. [2018-06-18 11:45:17,938 INFO ]: Interpolant automaton has 8 states. [2018-06-18 11:45:17,938 INFO ]: Start isEmpty. Operand 27 states and 51 transitions. [2018-06-18 11:45:17,939 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:45:17,939 INFO ]: Found error trace [2018-06-18 11:45:17,939 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:17,939 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:17,939 INFO ]: Analyzing trace with hash 1678978477, now seen corresponding path program 1 times [2018-06-18 11:45:17,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:17,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:17,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:17,940 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:17,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:17,953 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:17,954 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:18,035 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:18,036 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:18,036 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-18 11:45:18,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:18,056 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:18,059 INFO ]: Computing forward predicates... [2018-06-18 11:45:18,209 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:18,229 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:18,229 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-18 11:45:18,229 INFO ]: Interpolant automaton has 11 states [2018-06-18 11:45:18,229 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-18 11:45:18,229 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-18 11:45:18,230 INFO ]: Start difference. First operand 27 states and 51 transitions. Second operand 11 states. [2018-06-18 11:45:18,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:18,480 INFO ]: Finished difference Result 37 states and 87 transitions. [2018-06-18 11:45:18,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 11:45:18,480 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-18 11:45:18,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:18,481 INFO ]: With dead ends: 37 [2018-06-18 11:45:18,481 INFO ]: Without dead ends: 37 [2018-06-18 11:45:18,481 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-18 11:45:18,481 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-18 11:45:18,485 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-06-18 11:45:18,485 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 11:45:18,486 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 61 transitions. [2018-06-18 11:45:18,486 INFO ]: Start accepts. Automaton has 29 states and 61 transitions. Word has length 17 [2018-06-18 11:45:18,486 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:18,486 INFO ]: Abstraction has 29 states and 61 transitions. [2018-06-18 11:45:18,486 INFO ]: Interpolant automaton has 11 states. [2018-06-18 11:45:18,486 INFO ]: Start isEmpty. Operand 29 states and 61 transitions. [2018-06-18 11:45:18,487 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:45:18,487 INFO ]: Found error trace [2018-06-18 11:45:18,488 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:18,488 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:18,488 INFO ]: Analyzing trace with hash -1691004189, now seen corresponding path program 1 times [2018-06-18 11:45:18,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:18,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:18,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:18,488 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:18,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:18,514 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:18,515 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:18,907 WARN ]: Spent 216.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-06-18 11:45:18,931 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:18,931 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:18,931 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:45:18,939 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:18,954 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:18,956 INFO ]: Computing forward predicates... [2018-06-18 11:45:19,137 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:19,168 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:19,168 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-18 11:45:19,168 INFO ]: Interpolant automaton has 12 states [2018-06-18 11:45:19,168 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-18 11:45:19,168 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-18 11:45:19,168 INFO ]: Start difference. First operand 29 states and 61 transitions. Second operand 12 states. [2018-06-18 11:45:20,298 WARN ]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-18 11:45:22,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:22,581 INFO ]: Finished difference Result 35 states and 83 transitions. [2018-06-18 11:45:22,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:45:22,581 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-18 11:45:22,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:22,582 INFO ]: With dead ends: 35 [2018-06-18 11:45:22,582 INFO ]: Without dead ends: 35 [2018-06-18 11:45:22,582 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=250, Unknown=1, NotChecked=0, Total=306 [2018-06-18 11:45:22,582 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-18 11:45:22,586 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-18 11:45:22,586 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 11:45:22,586 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 59 transitions. [2018-06-18 11:45:22,586 INFO ]: Start accepts. Automaton has 29 states and 59 transitions. Word has length 17 [2018-06-18 11:45:22,587 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:22,587 INFO ]: Abstraction has 29 states and 59 transitions. [2018-06-18 11:45:22,587 INFO ]: Interpolant automaton has 12 states. [2018-06-18 11:45:22,587 INFO ]: Start isEmpty. Operand 29 states and 59 transitions. [2018-06-18 11:45:22,587 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:45:22,587 INFO ]: Found error trace [2018-06-18 11:45:22,587 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:22,588 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:22,588 INFO ]: Analyzing trace with hash -303527244, now seen corresponding path program 1 times [2018-06-18 11:45:22,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:22,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:22,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:22,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:22,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:22,602 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:22,603 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:23,028 WARN ]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-18 11:45:23,047 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:23,047 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:23,047 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-18 11:45:23,053 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:23,074 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:23,077 INFO ]: Computing forward predicates... [2018-06-18 11:45:23,149 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:23,170 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:23,170 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-18 11:45:23,170 INFO ]: Interpolant automaton has 8 states [2018-06-18 11:45:23,170 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 11:45:23,170 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:45:23,170 INFO ]: Start difference. First operand 29 states and 59 transitions. Second operand 8 states. [2018-06-18 11:45:23,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:23,358 INFO ]: Finished difference Result 35 states and 82 transitions. [2018-06-18 11:45:23,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:45:23,358 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-18 11:45:23,358 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:23,359 INFO ]: With dead ends: 35 [2018-06-18 11:45:23,359 INFO ]: Without dead ends: 35 [2018-06-18 11:45:23,359 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:45:23,359 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-18 11:45:23,362 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-18 11:45:23,362 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 11:45:23,363 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2018-06-18 11:45:23,363 INFO ]: Start accepts. Automaton has 29 states and 58 transitions. Word has length 17 [2018-06-18 11:45:23,363 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:23,363 INFO ]: Abstraction has 29 states and 58 transitions. [2018-06-18 11:45:23,363 INFO ]: Interpolant automaton has 8 states. [2018-06-18 11:45:23,363 INFO ]: Start isEmpty. Operand 29 states and 58 transitions. [2018-06-18 11:45:23,364 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:45:23,364 INFO ]: Found error trace [2018-06-18 11:45:23,364 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:23,364 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:23,364 INFO ]: Analyzing trace with hash 1180033425, now seen corresponding path program 1 times [2018-06-18 11:45:23,364 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:23,364 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:23,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:23,365 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:23,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:23,381 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:23,383 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:23,508 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:23,508 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:23,508 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-18 11:45:23,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:23,528 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:23,531 INFO ]: Computing forward predicates... [2018-06-18 11:45:23,635 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:23,655 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:23,655 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-18 11:45:23,655 INFO ]: Interpolant automaton has 10 states [2018-06-18 11:45:23,656 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-18 11:45:23,656 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:45:23,656 INFO ]: Start difference. First operand 29 states and 58 transitions. Second operand 10 states. [2018-06-18 11:45:24,240 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:24,240 INFO ]: Finished difference Result 39 states and 91 transitions. [2018-06-18 11:45:24,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 11:45:24,241 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-18 11:45:24,241 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:24,242 INFO ]: With dead ends: 39 [2018-06-18 11:45:24,242 INFO ]: Without dead ends: 39 [2018-06-18 11:45:24,242 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-18 11:45:24,242 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-18 11:45:24,247 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 29. [2018-06-18 11:45:24,247 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 11:45:24,248 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 57 transitions. [2018-06-18 11:45:24,248 INFO ]: Start accepts. Automaton has 29 states and 57 transitions. Word has length 17 [2018-06-18 11:45:24,248 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:24,248 INFO ]: Abstraction has 29 states and 57 transitions. [2018-06-18 11:45:24,248 INFO ]: Interpolant automaton has 10 states. [2018-06-18 11:45:24,248 INFO ]: Start isEmpty. Operand 29 states and 57 transitions. [2018-06-18 11:45:24,249 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:45:24,249 INFO ]: Found error trace [2018-06-18 11:45:24,249 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:24,249 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:24,249 INFO ]: Analyzing trace with hash 2141470792, now seen corresponding path program 1 times [2018-06-18 11:45:24,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:24,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:24,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:24,250 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:24,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:24,255 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:24,256 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:24,455 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:45:24,455 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:24,455 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-18 11:45:24,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:24,475 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:24,477 INFO ]: Computing forward predicates... [2018-06-18 11:45:24,533 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:45:24,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:24,554 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-06-18 11:45:24,554 INFO ]: Interpolant automaton has 8 states [2018-06-18 11:45:24,554 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 11:45:24,554 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:45:24,554 INFO ]: Start difference. First operand 29 states and 57 transitions. Second operand 8 states. [2018-06-18 11:45:24,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:24,683 INFO ]: Finished difference Result 35 states and 79 transitions. [2018-06-18 11:45:24,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:45:24,683 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-18 11:45:24,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:24,683 INFO ]: With dead ends: 35 [2018-06-18 11:45:24,683 INFO ]: Without dead ends: 35 [2018-06-18 11:45:24,684 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:45:24,684 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-18 11:45:24,686 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-18 11:45:24,686 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 11:45:24,686 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 51 transitions. [2018-06-18 11:45:24,686 INFO ]: Start accepts. Automaton has 27 states and 51 transitions. Word has length 17 [2018-06-18 11:45:24,686 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:24,686 INFO ]: Abstraction has 27 states and 51 transitions. [2018-06-18 11:45:24,686 INFO ]: Interpolant automaton has 8 states. [2018-06-18 11:45:24,686 INFO ]: Start isEmpty. Operand 27 states and 51 transitions. [2018-06-18 11:45:24,686 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:45:24,686 INFO ]: Found error trace [2018-06-18 11:45:24,686 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:24,686 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:24,687 INFO ]: Analyzing trace with hash -1122216413, now seen corresponding path program 2 times [2018-06-18 11:45:24,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:24,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:24,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:24,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:24,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:24,693 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:24,694 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:24,772 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:45:24,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:24,772 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-18 11:45:24,780 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 11:45:24,796 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:45:24,796 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:24,798 INFO ]: Computing forward predicates... [2018-06-18 11:45:24,820 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:45:24,841 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-18 11:45:24,841 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-18 11:45:24,841 INFO ]: Interpolant automaton has 8 states [2018-06-18 11:45:24,841 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 11:45:24,841 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:45:24,841 INFO ]: Start difference. First operand 27 states and 51 transitions. Second operand 8 states. [2018-06-18 11:45:25,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:25,110 INFO ]: Finished difference Result 48 states and 99 transitions. [2018-06-18 11:45:25,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-18 11:45:25,111 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-18 11:45:25,111 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:25,111 INFO ]: With dead ends: 48 [2018-06-18 11:45:25,111 INFO ]: Without dead ends: 48 [2018-06-18 11:45:25,111 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-18 11:45:25,111 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-18 11:45:25,115 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 36. [2018-06-18 11:45:25,115 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-18 11:45:25,119 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 75 transitions. [2018-06-18 11:45:25,119 INFO ]: Start accepts. Automaton has 36 states and 75 transitions. Word has length 17 [2018-06-18 11:45:25,119 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:25,119 INFO ]: Abstraction has 36 states and 75 transitions. [2018-06-18 11:45:25,119 INFO ]: Interpolant automaton has 8 states. [2018-06-18 11:45:25,119 INFO ]: Start isEmpty. Operand 36 states and 75 transitions. [2018-06-18 11:45:25,120 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:45:25,120 INFO ]: Found error trace [2018-06-18 11:45:25,120 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:25,120 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:25,120 INFO ]: Analyzing trace with hash 1935124424, now seen corresponding path program 1 times [2018-06-18 11:45:25,120 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:25,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:25,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:25,121 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:45:25,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:25,129 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:25,129 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:25,483 WARN ]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-18 11:45:25,762 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:45:25,762 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:25,762 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-18 11:45:25,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:25,783 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:25,784 INFO ]: Computing forward predicates... [2018-06-18 11:45:25,973 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:45:25,993 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-18 11:45:25,993 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-18 11:45:25,993 INFO ]: Interpolant automaton has 8 states [2018-06-18 11:45:25,993 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 11:45:25,993 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:45:25,993 INFO ]: Start difference. First operand 36 states and 75 transitions. Second operand 8 states. [2018-06-18 11:45:26,632 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:26,632 INFO ]: Finished difference Result 44 states and 89 transitions. [2018-06-18 11:45:26,633 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 11:45:26,633 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-18 11:45:26,633 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:26,633 INFO ]: With dead ends: 44 [2018-06-18 11:45:26,633 INFO ]: Without dead ends: 36 [2018-06-18 11:45:26,634 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-18 11:45:26,634 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-18 11:45:26,639 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-06-18 11:45:26,639 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-18 11:45:26,640 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 64 transitions. [2018-06-18 11:45:26,640 INFO ]: Start accepts. Automaton has 32 states and 64 transitions. Word has length 17 [2018-06-18 11:45:26,640 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:26,640 INFO ]: Abstraction has 32 states and 64 transitions. [2018-06-18 11:45:26,640 INFO ]: Interpolant automaton has 8 states. [2018-06-18 11:45:26,640 INFO ]: Start isEmpty. Operand 32 states and 64 transitions. [2018-06-18 11:45:26,641 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 11:45:26,641 INFO ]: Found error trace [2018-06-18 11:45:26,641 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:26,641 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:26,641 INFO ]: Analyzing trace with hash -1731707272, now seen corresponding path program 2 times [2018-06-18 11:45:26,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:26,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:26,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:26,642 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:26,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:26,652 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:26,653 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:26,866 WARN ]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-18 11:45:26,882 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-18 11:45:26,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:26,882 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-18 11:45:26,887 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 11:45:26,907 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:45:26,907 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:26,909 INFO ]: Computing forward predicates... [2018-06-18 11:45:26,993 INFO ]: Checked inductivity of 19 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 11:45:27,013 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:27,013 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 9 [2018-06-18 11:45:27,014 INFO ]: Interpolant automaton has 9 states [2018-06-18 11:45:27,014 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-18 11:45:27,014 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-18 11:45:27,014 INFO ]: Start difference. First operand 32 states and 64 transitions. Second operand 9 states. [2018-06-18 11:45:27,312 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:27,312 INFO ]: Finished difference Result 39 states and 63 transitions. [2018-06-18 11:45:27,313 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-18 11:45:27,313 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-18 11:45:27,313 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:27,313 INFO ]: With dead ends: 39 [2018-06-18 11:45:27,313 INFO ]: Without dead ends: 33 [2018-06-18 11:45:27,313 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-06-18 11:45:27,313 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-18 11:45:27,316 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-18 11:45:27,316 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 11:45:27,316 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 48 transitions. [2018-06-18 11:45:27,316 INFO ]: Start accepts. Automaton has 29 states and 48 transitions. Word has length 21 [2018-06-18 11:45:27,316 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:27,316 INFO ]: Abstraction has 29 states and 48 transitions. [2018-06-18 11:45:27,316 INFO ]: Interpolant automaton has 9 states. [2018-06-18 11:45:27,317 INFO ]: Start isEmpty. Operand 29 states and 48 transitions. [2018-06-18 11:45:27,319 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 11:45:27,319 INFO ]: Found error trace [2018-06-18 11:45:27,319 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:27,319 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:27,319 INFO ]: Analyzing trace with hash 394750501, now seen corresponding path program 1 times [2018-06-18 11:45:27,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:27,319 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:27,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:27,320 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:45:27,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:27,328 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:27,329 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:27,602 WARN ]: Spent 138.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-06-18 11:45:27,732 INFO ]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-18 11:45:27,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:27,732 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:45:27,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:27,766 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:27,768 INFO ]: Computing forward predicates... [2018-06-18 11:45:27,937 INFO ]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-18 11:45:27,957 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:45:27,957 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-18 11:45:27,958 INFO ]: Interpolant automaton has 15 states [2018-06-18 11:45:27,958 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-18 11:45:27,958 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-18 11:45:27,958 INFO ]: Start difference. First operand 29 states and 48 transitions. Second operand 15 states. [2018-06-18 11:45:28,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:28,247 INFO ]: Finished difference Result 39 states and 64 transitions. [2018-06-18 11:45:28,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 11:45:28,248 INFO ]: Start accepts. Automaton has 15 states. Word has length 21 [2018-06-18 11:45:28,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:28,248 INFO ]: With dead ends: 39 [2018-06-18 11:45:28,248 INFO ]: Without dead ends: 37 [2018-06-18 11:45:28,248 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-06-18 11:45:28,248 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-18 11:45:28,250 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 27. [2018-06-18 11:45:28,250 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 11:45:28,250 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2018-06-18 11:45:28,250 INFO ]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 21 [2018-06-18 11:45:28,251 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:28,251 INFO ]: Abstraction has 27 states and 42 transitions. [2018-06-18 11:45:28,251 INFO ]: Interpolant automaton has 15 states. [2018-06-18 11:45:28,251 INFO ]: Start isEmpty. Operand 27 states and 42 transitions. [2018-06-18 11:45:28,251 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 11:45:28,251 INFO ]: Found error trace [2018-06-18 11:45:28,251 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:45:28,251 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:45:28,251 INFO ]: Analyzing trace with hash 1413127743, now seen corresponding path program 1 times [2018-06-18 11:45:28,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:45:28,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:45:28,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:28,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:28,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:45:28,259 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:28,260 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:45:28,356 INFO ]: Checked inductivity of 18 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 11:45:28,356 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:45:28,356 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:45:28,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:45:28,379 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:45:28,380 INFO ]: Computing forward predicates... [2018-06-18 11:45:28,412 INFO ]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 11:45:28,432 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-18 11:45:28,432 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2018-06-18 11:45:28,432 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:45:28,432 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:45:28,432 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:45:28,432 INFO ]: Start difference. First operand 27 states and 42 transitions. Second operand 6 states. [2018-06-18 11:45:28,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:45:28,491 INFO ]: Finished difference Result 23 states and 34 transitions. [2018-06-18 11:45:28,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:45:28,491 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-18 11:45:28,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:45:28,491 INFO ]: With dead ends: 23 [2018-06-18 11:45:28,491 INFO ]: Without dead ends: 0 [2018-06-18 11:45:28,492 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:45:28,492 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-18 11:45:28,492 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-18 11:45:28,492 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-18 11:45:28,492 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-18 11:45:28,492 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-06-18 11:45:28,492 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:45:28,492 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-18 11:45:28,492 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:45:28,492 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-18 11:45:28,492 INFO ]: Finished isEmpty. No accepting run. [2018-06-18 11:45:28,496 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 11:45:28 BoogieIcfgContainer [2018-06-18 11:45:28,496 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 11:45:28,497 INFO ]: Toolchain (without parser) took 28521.71 ms. Allocated memory was 306.2 MB in the beginning and 598.7 MB in the end (delta: 292.6 MB). Free memory was 258.6 MB in the beginning and 473.8 MB in the end (delta: -215.2 MB). Peak memory consumption was 77.4 MB. Max. memory is 3.6 GB. [2018-06-18 11:45:28,498 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 11:45:28,498 INFO ]: ChcToBoogie took 74.88 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 11:45:28,498 INFO ]: Boogie Preprocessor took 63.98 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 254.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 11:45:28,498 INFO ]: RCFGBuilder took 530.89 ms. Allocated memory is still 306.2 MB. Free memory was 254.6 MB in the beginning and 240.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-18 11:45:28,499 INFO ]: TraceAbstraction took 27842.58 ms. Allocated memory was 306.2 MB in the beginning and 598.7 MB in the end (delta: 292.6 MB). Free memory was 240.6 MB in the beginning and 473.8 MB in the end (delta: -233.1 MB). Peak memory consumption was 59.4 MB. Max. memory is 3.6 GB. [2018-06-18 11:45:28,501 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 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 74.88 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 63.98 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 254.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 530.89 ms. Allocated memory is still 306.2 MB. Free memory was 254.6 MB in the beginning and 240.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 27842.58 ms. Allocated memory was 306.2 MB in the beginning and 598.7 MB in the end (delta: 292.6 MB). Free memory was 240.6 MB in the beginning and 473.8 MB in the end (delta: -233.1 MB). Peak memory consumption was 59.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 1 error locations. SAFE Result, 27.7s OverallTime, 35 OverallIterations, 4 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1240 SDtfs, 157 SDslu, 3155 SDs, 0 SdLazy, 4578 SolverSat, 231 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 629 GetRequests, 332 SyntacticMatches, 55 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=31, 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.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 162 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 866 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 808 ConstructedInterpolants, 8 QuantifiedInterpolants, 75840 SizeOfPredicates, 146 NumberOfNonLiveVariables, 2664 ConjunctsInSsa, 675 ConjunctsInUnsatCore, 58 InterpolantComputations, 17 PerfectInterpolantSequences, 250/380 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strncmp_2.array.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_11-45-28-513.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strncmp_2.array.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_11-45-28-513.csv Received shutdown request...