java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/012b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:11:15,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:11:15,507 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:11:15,519 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:11:15,520 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:11:15,521 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:11:15,522 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:11:15,529 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:11:15,531 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:11:15,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:11:15,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:11:15,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:11:15,534 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:11:15,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:11:15,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:11:15,541 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:11:15,542 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:11:15,555 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:11:15,557 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:11:15,558 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:11:15,559 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:11:15,561 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:11:15,561 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:11:15,561 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:11:15,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:11:15,568 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:11:15,569 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:11:15,570 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:11:15,571 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:11:15,571 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:11:15,572 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:11:15,572 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:11:15,573 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:11:15,573 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:11:15,576 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:11:15,577 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:11:15,603 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:11:15,604 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:11:15,608 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:11:15,608 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:11:15,609 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:11:15,609 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:11:15,610 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:11:15,610 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:11:15,610 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:11:15,610 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:11:15,610 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:11:15,611 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:11:15,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:11:15,611 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:11:15,611 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:11:15,611 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:11:15,612 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:11:15,613 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:11:15,613 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:11:15,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:11:15,613 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:11:15,615 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:11:15,615 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:11:15,664 INFO ]: Repository-Root is: /tmp [2018-06-25 09:11:15,680 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:11:15,685 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:11:15,686 INFO ]: Initializing SmtParser... [2018-06-25 09:11:15,687 INFO ]: SmtParser initialized [2018-06-25 09:11:15,687 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/012b-horn.smt2 [2018-06-25 09:11:15,688 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:11:15,774 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/012b-horn.smt2 unknown [2018-06-25 09:11:15,927 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/012b-horn.smt2 [2018-06-25 09:11:15,932 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:11:15,937 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:11:15,938 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:11:15,938 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:11:15,938 INFO ]: ChcToBoogie initialized [2018-06-25 09:11:15,941 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:11:15" (1/1) ... [2018-06-25 09:11:15,997 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:15 Unit [2018-06-25 09:11:15,997 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:11:15,998 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:11:15,998 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:11:15,998 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:11:16,021 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:15" (1/1) ... [2018-06-25 09:11:16,022 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:15" (1/1) ... [2018-06-25 09:11:16,027 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:15" (1/1) ... [2018-06-25 09:11:16,028 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:15" (1/1) ... [2018-06-25 09:11:16,030 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:15" (1/1) ... [2018-06-25 09:11:16,033 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:15" (1/1) ... [2018-06-25 09:11:16,034 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:15" (1/1) ... [2018-06-25 09:11:16,036 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:11:16,036 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:11:16,036 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:11:16,036 INFO ]: RCFGBuilder initialized [2018-06-25 09:11:16,039 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:15" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:11:16,053 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:11:16,053 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:11:16,053 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:11:16,053 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:11:16,053 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:11:16,053 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:11:16,428 INFO ]: Using library mode [2018-06-25 09:11:16,428 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:11:16 BoogieIcfgContainer [2018-06-25 09:11:16,428 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:11:16,430 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:11:16,430 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:11:16,434 INFO ]: TraceAbstraction initialized [2018-06-25 09:11:16,434 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:11:15" (1/3) ... [2018-06-25 09:11:16,435 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587021cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:11:16, skipping insertion in model container [2018-06-25 09:11:16,435 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:15" (2/3) ... [2018-06-25 09:11:16,435 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587021cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:11:16, skipping insertion in model container [2018-06-25 09:11:16,435 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:11:16" (3/3) ... [2018-06-25 09:11:16,437 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:11:16,444 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:11:16,451 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:11:16,486 INFO ]: Using default assertion order modulation [2018-06-25 09:11:16,488 INFO ]: Interprodecural is true [2018-06-25 09:11:16,488 INFO ]: Hoare is false [2018-06-25 09:11:16,488 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:11:16,488 INFO ]: Backedges is TWOTRACK [2018-06-25 09:11:16,488 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:11:16,488 INFO ]: Difference is false [2018-06-25 09:11:16,488 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:11:16,488 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:11:16,501 INFO ]: Start isEmpty. Operand 12 states. [2018-06-25 09:11:16,511 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 09:11:16,511 INFO ]: Found error trace [2018-06-25 09:11:16,512 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 09:11:16,512 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:16,515 INFO ]: Analyzing trace with hash 2118833424, now seen corresponding path program 1 times [2018-06-25 09:11:16,517 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:16,517 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:16,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:16,548 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:16,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:16,578 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:16,609 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:16,611 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:16,611 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-25 09:11:16,612 INFO ]: Interpolant automaton has 2 states [2018-06-25 09:11:16,625 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-25 09:11:16,625 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:11:16,628 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-25 09:11:16,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:16,644 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-25 09:11:16,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-25 09:11:16,645 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-25 09:11:16,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:16,651 INFO ]: With dead ends: 10 [2018-06-25 09:11:16,651 INFO ]: Without dead ends: 10 [2018-06-25 09:11:16,652 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:11:16,664 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:16,679 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:16,680 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:16,680 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-25 09:11:16,681 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 6 [2018-06-25 09:11:16,681 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:16,681 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-25 09:11:16,681 INFO ]: Interpolant automaton has 2 states. [2018-06-25 09:11:16,681 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-25 09:11:16,681 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:11:16,681 INFO ]: Found error trace [2018-06-25 09:11:16,681 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:16,682 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:16,682 INFO ]: Analyzing trace with hash 1263908916, now seen corresponding path program 1 times [2018-06-25 09:11:16,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:16,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:16,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:16,683 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:16,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:16,702 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:16,780 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:16,780 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:16,780 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:16,781 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:16,781 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:16,781 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:16,782 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 3 states. [2018-06-25 09:11:16,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:16,869 INFO ]: Finished difference Result 14 states and 21 transitions. [2018-06-25 09:11:16,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:16,869 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:11:16,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:16,872 INFO ]: With dead ends: 14 [2018-06-25 09:11:16,872 INFO ]: Without dead ends: 14 [2018-06-25 09:11:16,872 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:16,872 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:11:16,875 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-25 09:11:16,875 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:16,875 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-25 09:11:16,875 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 7 [2018-06-25 09:11:16,875 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:16,875 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-25 09:11:16,875 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:16,875 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-25 09:11:16,876 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:16,876 INFO ]: Found error trace [2018-06-25 09:11:16,876 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:16,876 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:16,876 INFO ]: Analyzing trace with hash 524141432, now seen corresponding path program 1 times [2018-06-25 09:11:16,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:16,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:16,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:16,877 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:16,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:16,888 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:16,928 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:16,929 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:16,929 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:16,929 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:16,929 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:16,929 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:16,929 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2018-06-25 09:11:16,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:16,950 INFO ]: Finished difference Result 10 states and 13 transitions. [2018-06-25 09:11:16,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:16,951 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:11:16,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:16,951 INFO ]: With dead ends: 10 [2018-06-25 09:11:16,951 INFO ]: Without dead ends: 10 [2018-06-25 09:11:16,951 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:16,951 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:16,952 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:16,953 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:16,953 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-25 09:11:16,953 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2018-06-25 09:11:16,953 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:16,953 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-25 09:11:16,953 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:16,953 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-25 09:11:16,954 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:16,954 INFO ]: Found error trace [2018-06-25 09:11:16,954 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:16,955 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:16,955 INFO ]: Analyzing trace with hash 516604309, now seen corresponding path program 1 times [2018-06-25 09:11:16,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:16,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:16,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:16,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:16,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:16,971 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:17,075 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:17,075 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:17,075 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:11:17,075 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:11:17,075 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:11:17,075 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:11:17,075 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 4 states. [2018-06-25 09:11:17,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:17,154 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-25 09:11:17,154 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:11:17,154 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:11:17,154 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:17,155 INFO ]: With dead ends: 14 [2018-06-25 09:11:17,155 INFO ]: Without dead ends: 14 [2018-06-25 09:11:17,155 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:11:17,155 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:11:17,157 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-25 09:11:17,157 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:17,157 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-06-25 09:11:17,157 INFO ]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2018-06-25 09:11:17,158 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:17,158 INFO ]: Abstraction has 11 states and 14 transitions. [2018-06-25 09:11:17,158 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:11:17,158 INFO ]: Start isEmpty. Operand 11 states and 14 transitions. [2018-06-25 09:11:17,158 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:17,158 INFO ]: Found error trace [2018-06-25 09:11:17,158 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:17,158 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:17,158 INFO ]: Analyzing trace with hash 520894213, now seen corresponding path program 1 times [2018-06-25 09:11:17,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:17,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:17,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:17,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:17,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:17,168 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:17,224 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:17,224 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:17,224 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-25 09:11:17,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:17,264 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:17,272 INFO ]: Computing forward predicates... [2018-06-25 09:11:17,298 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:17,341 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:17,341 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:11:17,341 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:11:17,341 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:11:17,341 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:11:17,342 INFO ]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2018-06-25 09:11:17,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:17,376 INFO ]: Finished difference Result 11 states and 13 transitions. [2018-06-25 09:11:17,378 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:11:17,378 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:11:17,378 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:17,378 INFO ]: With dead ends: 11 [2018-06-25 09:11:17,378 INFO ]: Without dead ends: 11 [2018-06-25 09:11:17,379 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:11:17,379 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:11:17,380 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:11:17,380 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:17,380 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-25 09:11:17,380 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-06-25 09:11:17,380 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:17,380 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-25 09:11:17,380 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:11:17,380 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-25 09:11:17,381 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:11:17,381 INFO ]: Found error trace [2018-06-25 09:11:17,381 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:17,381 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:17,381 INFO ]: Analyzing trace with hash -1164843297, now seen corresponding path program 1 times [2018-06-25 09:11:17,381 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:17,381 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:17,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:17,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:17,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:17,403 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:17,556 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:17,557 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:17,557 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:11:17,557 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:11:17,557 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:11:17,557 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:11:17,557 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-06-25 09:11:17,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:17,600 INFO ]: Finished difference Result 11 states and 12 transitions. [2018-06-25 09:11:17,601 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:11:17,601 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:11:17,601 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:17,601 INFO ]: With dead ends: 11 [2018-06-25 09:11:17,601 INFO ]: Without dead ends: 10 [2018-06-25 09:11:17,601 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:11:17,602 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:17,603 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:17,603 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:17,603 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-25 09:11:17,603 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2018-06-25 09:11:17,603 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:17,603 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-25 09:11:17,603 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:11:17,603 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-25 09:11:17,603 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:11:17,603 INFO ]: Found error trace [2018-06-25 09:11:17,604 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:17,604 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:17,604 INFO ]: Analyzing trace with hash -1042015004, now seen corresponding path program 1 times [2018-06-25 09:11:17,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:17,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:17,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:17,605 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:17,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:17,618 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:17,741 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:17,741 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:17,741 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-25 09:11:17,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:17,776 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:17,779 INFO ]: Computing forward predicates... [2018-06-25 09:11:18,010 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:18,030 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:18,030 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 09:11:18,030 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:11:18,030 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:11:18,030 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:11:18,031 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. [2018-06-25 09:11:18,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:18,375 INFO ]: Finished difference Result 22 states and 28 transitions. [2018-06-25 09:11:18,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:11:18,375 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 09:11:18,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:18,376 INFO ]: With dead ends: 22 [2018-06-25 09:11:18,376 INFO ]: Without dead ends: 22 [2018-06-25 09:11:18,376 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:11:18,376 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:11:18,378 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-06-25 09:11:18,378 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:11:18,382 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-25 09:11:18,382 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 9 [2018-06-25 09:11:18,382 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:18,382 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-25 09:11:18,382 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:11:18,382 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-25 09:11:18,383 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:11:18,383 INFO ]: Found error trace [2018-06-25 09:11:18,383 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:18,383 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:18,383 INFO ]: Analyzing trace with hash -639685020, now seen corresponding path program 1 times [2018-06-25 09:11:18,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:18,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:18,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:18,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:18,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:18,402 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:18,443 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:18,443 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:18,443 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:18,450 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:18,481 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:18,483 INFO ]: Computing forward predicates... [2018-06-25 09:11:18,506 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:18,540 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:18,540 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 09:11:18,541 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:11:18,541 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:11:18,541 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:11:18,541 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 6 states. [2018-06-25 09:11:18,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:18,833 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-25 09:11:18,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:11:18,834 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-25 09:11:18,834 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:18,834 INFO ]: With dead ends: 16 [2018-06-25 09:11:18,834 INFO ]: Without dead ends: 14 [2018-06-25 09:11:18,834 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:11:18,834 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:11:18,836 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:11:18,836 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:11:18,836 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-25 09:11:18,836 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2018-06-25 09:11:18,836 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:18,836 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-25 09:11:18,836 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:11:18,836 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-25 09:11:18,837 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:11:18,837 INFO ]: Found error trace [2018-06-25 09:11:18,837 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:18,837 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:18,837 INFO ]: Analyzing trace with hash -1126975233, now seen corresponding path program 2 times [2018-06-25 09:11:18,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:18,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:18,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:18,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:18,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:18,871 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:18,996 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:18,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:18,996 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:19,004 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:11:19,045 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:11:19,045 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:19,049 INFO ]: Computing forward predicates... [2018-06-25 09:11:19,577 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:19,610 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:19,610 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-25 09:11:19,611 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:11:19,611 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:11:19,611 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:11:19,611 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 12 states. [2018-06-25 09:11:19,908 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:19,908 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-25 09:11:19,910 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:11:19,910 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-25 09:11:19,910 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:19,910 INFO ]: With dead ends: 16 [2018-06-25 09:11:19,910 INFO ]: Without dead ends: 16 [2018-06-25 09:11:19,910 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:11:19,910 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:11:19,912 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-25 09:11:19,912 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:11:19,912 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-25 09:11:19,912 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-06-25 09:11:19,912 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:19,912 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-25 09:11:19,912 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:11:19,912 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-25 09:11:19,912 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:11:19,912 INFO ]: Found error trace [2018-06-25 09:11:19,913 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:19,913 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:19,913 INFO ]: Analyzing trace with hash -576201547, now seen corresponding path program 3 times [2018-06-25 09:11:19,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:19,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:19,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:19,914 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:19,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:19,926 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:20,046 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:20,047 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:20,047 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:20,053 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:11:20,082 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-25 09:11:20,082 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:20,085 INFO ]: Computing forward predicates... [2018-06-25 09:11:20,227 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:20,258 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:20,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-25 09:11:20,258 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:11:20,259 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:11:20,259 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:11:20,259 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 11 states. [2018-06-25 09:11:20,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:20,345 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-25 09:11:20,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:11:20,346 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-25 09:11:20,346 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:20,347 INFO ]: With dead ends: 20 [2018-06-25 09:11:20,347 INFO ]: Without dead ends: 20 [2018-06-25 09:11:20,347 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:11:20,347 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:11:20,349 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-25 09:11:20,349 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:11:20,349 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-25 09:11:20,349 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-06-25 09:11:20,349 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:20,349 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-25 09:11:20,349 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:11:20,349 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-25 09:11:20,350 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:11:20,350 INFO ]: Found error trace [2018-06-25 09:11:20,350 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:20,350 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:20,350 INFO ]: Analyzing trace with hash -682086465, now seen corresponding path program 4 times [2018-06-25 09:11:20,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:20,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:20,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:20,351 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:20,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:20,374 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:20,468 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:20,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:20,469 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:20,475 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:11:20,506 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:11:20,506 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:20,508 INFO ]: Computing forward predicates... [2018-06-25 09:11:20,518 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:20,539 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:20,539 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-25 09:11:20,540 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:11:20,540 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:11:20,540 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:11:20,540 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 8 states. [2018-06-25 09:11:20,578 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:20,578 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-25 09:11:20,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:11:20,578 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-25 09:11:20,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:20,578 INFO ]: With dead ends: 17 [2018-06-25 09:11:20,578 INFO ]: Without dead ends: 14 [2018-06-25 09:11:20,579 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:11:20,579 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:11:20,580 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:11:20,580 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:11:20,581 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-25 09:11:20,581 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 13 [2018-06-25 09:11:20,581 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:20,581 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-25 09:11:20,581 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:11:20,581 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-25 09:11:20,581 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:11:20,581 INFO ]: Found error trace [2018-06-25 09:11:20,581 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:20,581 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:20,581 INFO ]: Analyzing trace with hash 1391786116, now seen corresponding path program 5 times [2018-06-25 09:11:20,581 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:20,581 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:20,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:20,582 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:20,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:20,595 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:21,084 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:21,085 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:21,085 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:21,091 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:11:21,110 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 09:11:21,110 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:21,116 INFO ]: Computing forward predicates... [2018-06-25 09:11:21,649 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:21,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:21,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-25 09:11:21,669 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:11:21,669 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:11:21,669 INFO ]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:11:21,670 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 16 states. [2018-06-25 09:11:22,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:22,483 INFO ]: Finished difference Result 37 states and 46 transitions. [2018-06-25 09:11:22,483 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:11:22,483 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-25 09:11:22,483 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:22,484 INFO ]: With dead ends: 37 [2018-06-25 09:11:22,484 INFO ]: Without dead ends: 37 [2018-06-25 09:11:22,485 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:11:22,485 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:11:22,487 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-06-25 09:11:22,487 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:11:22,487 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-06-25 09:11:22,487 INFO ]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 13 [2018-06-25 09:11:22,488 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:22,488 INFO ]: Abstraction has 20 states and 26 transitions. [2018-06-25 09:11:22,488 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:11:22,488 INFO ]: Start isEmpty. Operand 20 states and 26 transitions. [2018-06-25 09:11:22,488 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:11:22,488 INFO ]: Found error trace [2018-06-25 09:11:22,488 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:22,488 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:22,488 INFO ]: Analyzing trace with hash 195988944, now seen corresponding path program 6 times [2018-06-25 09:11:22,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:22,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:22,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:22,489 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:22,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:22,499 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:22,760 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:22,760 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:22,760 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-25 09:11:22,767 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:11:22,788 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-25 09:11:22,788 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:22,794 INFO ]: Computing forward predicates... [2018-06-25 09:11:22,912 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:22,930 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:22,931 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-25 09:11:22,931 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:11:22,931 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:11:22,931 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:11:22,931 INFO ]: Start difference. First operand 20 states and 26 transitions. Second operand 14 states. [2018-06-25 09:11:23,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:23,093 INFO ]: Finished difference Result 27 states and 34 transitions. [2018-06-25 09:11:23,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:11:23,093 INFO ]: Start accepts. Automaton has 14 states. Word has length 14 [2018-06-25 09:11:23,093 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:23,094 INFO ]: With dead ends: 27 [2018-06-25 09:11:23,094 INFO ]: Without dead ends: 27 [2018-06-25 09:11:23,094 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:11:23,094 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:11:23,098 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-25 09:11:23,098 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:11:23,098 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-25 09:11:23,098 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 14 [2018-06-25 09:11:23,098 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:23,098 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-25 09:11:23,098 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:11:23,098 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-25 09:11:23,099 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:11:23,099 INFO ]: Found error trace [2018-06-25 09:11:23,099 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:23,099 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:23,099 INFO ]: Analyzing trace with hash 1780982276, now seen corresponding path program 7 times [2018-06-25 09:11:23,099 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:23,099 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:23,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:23,099 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:23,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:23,117 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:23,330 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:23,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:23,330 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:23,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:23,350 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:23,351 INFO ]: Computing forward predicates... [2018-06-25 09:11:23,360 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:23,380 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:23,380 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-25 09:11:23,380 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:11:23,380 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:11:23,381 INFO ]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:11:23,381 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 10 states. [2018-06-25 09:11:23,468 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:23,468 INFO ]: Finished difference Result 24 states and 29 transitions. [2018-06-25 09:11:23,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:11:23,469 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-25 09:11:23,469 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:23,469 INFO ]: With dead ends: 24 [2018-06-25 09:11:23,469 INFO ]: Without dead ends: 20 [2018-06-25 09:11:23,469 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:11:23,469 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:11:23,471 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:11:23,471 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:11:23,471 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-06-25 09:11:23,472 INFO ]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2018-06-25 09:11:23,472 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:23,472 INFO ]: Abstraction has 20 states and 25 transitions. [2018-06-25 09:11:23,472 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:11:23,472 INFO ]: Start isEmpty. Operand 20 states and 25 transitions. [2018-06-25 09:11:23,472 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:11:23,472 INFO ]: Found error trace [2018-06-25 09:11:23,472 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:23,472 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:23,472 INFO ]: Analyzing trace with hash 1646522847, now seen corresponding path program 8 times [2018-06-25 09:11:23,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:23,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:23,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:23,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:23,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:23,485 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:23,670 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:23,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:23,670 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:23,676 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:11:23,710 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:11:23,710 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:23,714 INFO ]: Computing forward predicates... [2018-06-25 09:11:25,228 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:25,247 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:25,247 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-25 09:11:25,247 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:11:25,247 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:11:25,247 INFO ]: CoverageRelationStatistics Valid=69, Invalid=307, Unknown=4, NotChecked=0, Total=380 [2018-06-25 09:11:25,247 INFO ]: Start difference. First operand 20 states and 25 transitions. Second operand 20 states. [2018-06-25 09:11:30,036 WARN ]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-25 09:11:36,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:36,306 INFO ]: Finished difference Result 45 states and 55 transitions. [2018-06-25 09:11:36,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:11:36,306 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-25 09:11:36,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:36,307 INFO ]: With dead ends: 45 [2018-06-25 09:11:36,307 INFO ]: Without dead ends: 45 [2018-06-25 09:11:36,308 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=325, Invalid=994, Unknown=13, NotChecked=0, Total=1332 [2018-06-25 09:11:36,308 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 09:11:36,310 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 23. [2018-06-25 09:11:36,310 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:11:36,310 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-06-25 09:11:36,310 INFO ]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 15 [2018-06-25 09:11:36,310 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:36,310 INFO ]: Abstraction has 23 states and 30 transitions. [2018-06-25 09:11:36,310 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:11:36,310 INFO ]: Start isEmpty. Operand 23 states and 30 transitions. [2018-06-25 09:11:36,313 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:11:36,313 INFO ]: Found error trace [2018-06-25 09:11:36,313 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:36,313 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:36,313 INFO ]: Analyzing trace with hash -497106987, now seen corresponding path program 9 times [2018-06-25 09:11:36,313 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:36,313 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:36,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:36,314 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:36,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:36,324 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:36,552 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:36,553 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:36,553 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:36,563 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:11:36,583 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:11:36,583 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:36,586 INFO ]: Computing forward predicates... [2018-06-25 09:11:36,798 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:36,820 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:36,820 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-25 09:11:36,820 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:11:36,821 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:11:36,821 INFO ]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:11:36,821 INFO ]: Start difference. First operand 23 states and 30 transitions. Second operand 17 states. [2018-06-25 09:11:37,245 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:37,245 INFO ]: Finished difference Result 31 states and 39 transitions. [2018-06-25 09:11:37,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:11:37,245 INFO ]: Start accepts. Automaton has 17 states. Word has length 16 [2018-06-25 09:11:37,245 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:37,246 INFO ]: With dead ends: 31 [2018-06-25 09:11:37,246 INFO ]: Without dead ends: 31 [2018-06-25 09:11:37,246 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:11:37,246 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:11:37,248 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-06-25 09:11:37,248 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:11:37,249 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-06-25 09:11:37,249 INFO ]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2018-06-25 09:11:37,249 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:37,249 INFO ]: Abstraction has 24 states and 31 transitions. [2018-06-25 09:11:37,249 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:11:37,249 INFO ]: Start isEmpty. Operand 24 states and 31 transitions. [2018-06-25 09:11:37,249 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:11:37,249 INFO ]: Found error trace [2018-06-25 09:11:37,249 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:37,249 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:37,250 INFO ]: Analyzing trace with hash 1769844895, now seen corresponding path program 10 times [2018-06-25 09:11:37,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:37,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:37,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:37,250 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:37,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:37,260 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:37,395 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:37,396 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:37,396 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:37,401 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:11:37,419 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:11:37,419 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:37,420 INFO ]: Computing forward predicates... [2018-06-25 09:11:37,430 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:37,463 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:37,463 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-25 09:11:37,463 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:11:37,463 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:11:37,463 INFO ]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:11:37,463 INFO ]: Start difference. First operand 24 states and 31 transitions. Second operand 12 states. [2018-06-25 09:11:37,801 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:37,801 INFO ]: Finished difference Result 28 states and 34 transitions. [2018-06-25 09:11:37,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:11:37,801 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-25 09:11:37,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:37,801 INFO ]: With dead ends: 28 [2018-06-25 09:11:37,801 INFO ]: Without dead ends: 23 [2018-06-25 09:11:37,802 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:11:37,802 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:11:37,805 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-25 09:11:37,806 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:11:37,806 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-06-25 09:11:37,806 INFO ]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 17 [2018-06-25 09:11:37,806 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:37,806 INFO ]: Abstraction has 23 states and 29 transitions. [2018-06-25 09:11:37,806 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:11:37,806 INFO ]: Start isEmpty. Operand 23 states and 29 transitions. [2018-06-25 09:11:37,806 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:11:37,806 INFO ]: Found error trace [2018-06-25 09:11:37,806 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:37,806 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:37,806 INFO ]: Analyzing trace with hash 1896569892, now seen corresponding path program 11 times [2018-06-25 09:11:37,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:37,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:37,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:37,807 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:37,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:37,824 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:38,089 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:38,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:38,089 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:38,094 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:11:38,116 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:11:38,116 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:38,120 INFO ]: Computing forward predicates... [2018-06-25 09:11:44,884 INFO ]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:44,903 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:44,903 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-25 09:11:44,903 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:11:44,904 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:11:44,904 INFO ]: CoverageRelationStatistics Valid=92, Invalid=456, Unknown=4, NotChecked=0, Total=552 [2018-06-25 09:11:44,904 INFO ]: Start difference. First operand 23 states and 29 transitions. Second operand 24 states. [2018-06-25 09:11:51,186 WARN ]: Spent 6.16 s on a formula simplification that was a NOOP. DAG size: 73 [2018-06-25 09:11:59,248 WARN ]: Spent 8.03 s on a formula simplification that was a NOOP. DAG size: 73 [2018-06-25 09:12:07,507 WARN ]: Spent 8.10 s on a formula simplification that was a NOOP. DAG size: 74 [2018-06-25 09:12:14,611 WARN ]: Spent 7.06 s on a formula simplification that was a NOOP. DAG size: 73 [2018-06-25 09:12:16,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:16,683 INFO ]: Finished difference Result 28 states and 34 transitions. [2018-06-25 09:12:16,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:12:16,684 INFO ]: Start accepts. Automaton has 24 states. Word has length 17 [2018-06-25 09:12:16,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:16,684 INFO ]: With dead ends: 28 [2018-06-25 09:12:16,684 INFO ]: Without dead ends: 28 [2018-06-25 09:12:16,685 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=182, Invalid=626, Unknown=4, NotChecked=0, Total=812 [2018-06-25 09:12:16,685 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 09:12:16,686 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-06-25 09:12:16,686 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:12:16,687 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-25 09:12:16,687 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-06-25 09:12:16,687 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:16,687 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-25 09:12:16,687 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:12:16,687 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-25 09:12:16,687 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:12:16,687 INFO ]: Found error trace [2018-06-25 09:12:16,687 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:16,687 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:16,688 INFO ]: Analyzing trace with hash -1335583184, now seen corresponding path program 12 times [2018-06-25 09:12:16,688 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:16,688 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:16,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:16,688 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:16,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:16,702 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:17,048 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:17,048 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:17,048 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:12:17,056 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:12:17,081 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:12:17,081 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:17,085 INFO ]: Computing forward predicates... [2018-06-25 09:12:17,228 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:17,247 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:17,247 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-25 09:12:17,247 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:12:17,247 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:12:17,247 INFO ]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:12:17,247 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 20 states. [2018-06-25 09:12:17,511 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:17,511 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-25 09:12:17,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:12:17,511 INFO ]: Start accepts. Automaton has 20 states. Word has length 18 [2018-06-25 09:12:17,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:17,511 INFO ]: With dead ends: 29 [2018-06-25 09:12:17,511 INFO ]: Without dead ends: 29 [2018-06-25 09:12:17,512 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:12:17,512 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:12:17,514 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-25 09:12:17,514 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:12:17,517 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-25 09:12:17,518 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-06-25 09:12:17,518 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:17,518 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-25 09:12:17,518 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:12:17,518 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-25 09:12:17,518 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:12:17,518 INFO ]: Found error trace [2018-06-25 09:12:17,518 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:17,518 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:17,518 INFO ]: Analyzing trace with hash 1546886564, now seen corresponding path program 13 times [2018-06-25 09:12:17,518 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:17,518 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:17,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:17,519 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:17,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:17,534 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:17,619 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:17,619 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:17,619 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-25 09:12:17,625 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:17,651 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:17,653 INFO ]: Computing forward predicates... [2018-06-25 09:12:17,664 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:17,698 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:17,698 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-25 09:12:17,698 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:12:17,698 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:12:17,698 INFO ]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:12:17,699 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 14 states. [2018-06-25 09:12:17,847 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:17,847 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-25 09:12:17,847 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:12:17,848 INFO ]: Start accepts. Automaton has 14 states. Word has length 19 [2018-06-25 09:12:17,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:17,848 INFO ]: With dead ends: 26 [2018-06-25 09:12:17,848 INFO ]: Without dead ends: 20 [2018-06-25 09:12:17,848 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:12:17,848 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:12:17,850 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:12:17,850 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:12:17,850 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-25 09:12:17,850 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2018-06-25 09:12:17,850 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:17,851 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-25 09:12:17,851 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:12:17,851 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-25 09:12:17,851 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:12:17,851 INFO ]: Found error trace [2018-06-25 09:12:17,851 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:17,851 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:17,851 INFO ]: Analyzing trace with hash 1180394175, now seen corresponding path program 14 times [2018-06-25 09:12:17,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:17,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:17,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:17,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:17,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:17,881 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:18,144 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:18,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:18,144 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) [2018-06-25 09:12:18,160 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:12:18,190 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:12:18,190 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:18,196 INFO ]: Computing forward predicates... [2018-06-25 09:12:19,532 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:19,551 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:19,556 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-06-25 09:12:19,556 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:12:19,556 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:12:19,556 INFO ]: CoverageRelationStatistics Valid=118, Invalid=634, Unknown=4, NotChecked=0, Total=756 [2018-06-25 09:12:19,556 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 28 states. [2018-06-25 09:12:19,956 WARN ]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-06-25 09:12:20,378 WARN ]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-06-25 09:12:20,555 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 119 [2018-06-25 09:12:20,939 WARN ]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-06-25 09:12:21,928 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 120 [2018-06-25 09:12:22,297 WARN ]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-06-25 09:12:23,098 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 119 [2018-06-25 09:12:23,326 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 119 [2018-06-25 09:12:25,487 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 95 [2018-06-25 09:12:28,728 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-06-25 09:12:29,289 WARN ]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-06-25 09:12:29,397 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:29,397 INFO ]: Finished difference Result 64 states and 77 transitions. [2018-06-25 09:12:29,397 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-25 09:12:29,397 INFO ]: Start accepts. Automaton has 28 states. Word has length 19 [2018-06-25 09:12:29,397 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:29,398 INFO ]: With dead ends: 64 [2018-06-25 09:12:29,398 INFO ]: Without dead ends: 64 [2018-06-25 09:12:29,398 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=811, Invalid=2718, Unknown=11, NotChecked=0, Total=3540 [2018-06-25 09:12:29,398 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-25 09:12:29,401 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 29. [2018-06-25 09:12:29,401 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 09:12:29,401 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-06-25 09:12:29,401 INFO ]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 19 [2018-06-25 09:12:29,401 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:29,401 INFO ]: Abstraction has 29 states and 38 transitions. [2018-06-25 09:12:29,401 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:12:29,401 INFO ]: Start isEmpty. Operand 29 states and 38 transitions. [2018-06-25 09:12:29,401 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:12:29,401 INFO ]: Found error trace [2018-06-25 09:12:29,401 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:29,402 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:29,402 INFO ]: Analyzing trace with hash -2062193931, now seen corresponding path program 15 times [2018-06-25 09:12:29,402 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:29,402 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:29,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:29,402 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:29,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:29,427 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:29,934 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:29,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:29,956 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:12:29,964 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:12:29,986 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:12:29,986 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:29,990 INFO ]: Computing forward predicates... [2018-06-25 09:12:30,162 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:30,181 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:30,181 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-06-25 09:12:30,181 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:12:30,181 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:12:30,181 INFO ]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:12:30,181 INFO ]: Start difference. First operand 29 states and 38 transitions. Second operand 23 states. [2018-06-25 09:12:30,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:30,516 INFO ]: Finished difference Result 39 states and 49 transitions. [2018-06-25 09:12:30,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:12:30,516 INFO ]: Start accepts. Automaton has 23 states. Word has length 20 [2018-06-25 09:12:30,516 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:30,516 INFO ]: With dead ends: 39 [2018-06-25 09:12:30,516 INFO ]: Without dead ends: 39 [2018-06-25 09:12:30,517 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:12:30,517 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:12:30,519 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-06-25 09:12:30,519 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:12:30,520 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2018-06-25 09:12:30,520 INFO ]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 20 [2018-06-25 09:12:30,520 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:30,520 INFO ]: Abstraction has 30 states and 39 transitions. [2018-06-25 09:12:30,520 INFO ]: Interpolant automaton has 23 states. [2018-06-25 09:12:30,520 INFO ]: Start isEmpty. Operand 30 states and 39 transitions. [2018-06-25 09:12:30,520 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:12:30,520 INFO ]: Found error trace [2018-06-25 09:12:30,520 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:30,520 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:30,520 INFO ]: Analyzing trace with hash 496789887, now seen corresponding path program 16 times [2018-06-25 09:12:30,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:30,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:30,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:30,521 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:30,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:30,531 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:30,651 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:30,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:30,651 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:12:30,657 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:12:30,694 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:12:30,694 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:30,697 INFO ]: Computing forward predicates... [2018-06-25 09:12:30,714 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:30,733 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:30,733 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-25 09:12:30,733 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:12:30,734 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:12:30,734 INFO ]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:12:30,734 INFO ]: Start difference. First operand 30 states and 39 transitions. Second operand 16 states. [2018-06-25 09:12:30,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:30,822 INFO ]: Finished difference Result 36 states and 44 transitions. [2018-06-25 09:12:30,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:12:30,823 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-25 09:12:30,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:30,823 INFO ]: With dead ends: 36 [2018-06-25 09:12:30,823 INFO ]: Without dead ends: 29 [2018-06-25 09:12:30,823 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:12:30,823 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:12:30,825 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-25 09:12:30,825 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 09:12:30,825 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-06-25 09:12:30,825 INFO ]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 21 [2018-06-25 09:12:30,825 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:30,825 INFO ]: Abstraction has 29 states and 37 transitions. [2018-06-25 09:12:30,825 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:12:30,825 INFO ]: Start isEmpty. Operand 29 states and 37 transitions. [2018-06-25 09:12:30,826 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:12:30,826 INFO ]: Found error trace [2018-06-25 09:12:30,826 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:30,826 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:30,826 INFO ]: Analyzing trace with hash 2020427716, now seen corresponding path program 17 times [2018-06-25 09:12:30,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:30,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:30,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:30,826 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:30,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:30,843 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:31,276 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:31,276 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:31,276 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:12:31,287 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:12:31,374 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-25 09:12:31,374 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 09:12:31,382 INFO ]: Computing forward predicates... [2018-06-25 09:12:31,384 INFO ]: Timeout while computing interpolants [2018-06-25 09:12:31,584 WARN ]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:12:31,584 WARN ]: Verification canceled [2018-06-25 09:12:31,587 WARN ]: Timeout [2018-06-25 09:12:31,587 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:12:31 BoogieIcfgContainer [2018-06-25 09:12:31,587 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:12:31,588 INFO ]: Toolchain (without parser) took 75655.90 ms. Allocated memory was 309.3 MB in the beginning and 443.5 MB in the end (delta: 134.2 MB). Free memory was 264.7 MB in the beginning and 358.2 MB in the end (delta: -93.5 MB). Peak memory consumption was 40.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:31,591 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:12:31,591 INFO ]: ChcToBoogie took 59.98 ms. Allocated memory is still 309.3 MB. Free memory was 264.7 MB in the beginning and 262.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:31,591 INFO ]: Boogie Preprocessor took 37.83 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 261.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:31,591 INFO ]: RCFGBuilder took 392.16 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 252.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:31,592 INFO ]: TraceAbstraction took 75157.72 ms. Allocated memory was 309.3 MB in the beginning and 443.5 MB in the end (delta: 134.2 MB). Free memory was 251.7 MB in the beginning and 358.2 MB in the end (delta: -106.5 MB). Peak memory consumption was 27.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:31,593 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.98 ms. Allocated memory is still 309.3 MB. Free memory was 264.7 MB in the beginning and 262.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.83 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 261.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 392.16 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 252.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 75157.72 ms. Allocated memory was 309.3 MB in the beginning and 443.5 MB in the end (delta: 134.2 MB). Free memory was 251.7 MB in the beginning and 358.2 MB in the end (delta: -106.5 MB). Peak memory consumption was 27.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 22 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 6 quantified variables from 8 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. TIMEOUT Result, 75.1s OverallTime, 24 OverallIterations, 7 TraceHistogramMax, 56.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 178 SDtfs, 381 SDslu, 1027 SDs, 0 SdLazy, 1524 SolverSat, 540 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 213 SyntacticMatches, 10 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 65.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 134 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 533 ConstructedInterpolants, 22 QuantifiedInterpolants, 66925 SizeOfPredicates, 69 NumberOfNonLiveVariables, 2601 ConjunctsInSsa, 1392 ConjunctsInUnsatCore, 41 InterpolantComputations, 5 PerfectInterpolantSequences, 168/683 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/012b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-12-31-602.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/012b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-12-31-602.csv Completed graceful shutdown