java -Xss1g -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/010-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:25:11,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:25:11,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:25:11,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:25:11,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:25:11,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:25:11,756 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:25:11,758 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:25:11,760 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:25:11,761 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:25:11,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:25:11,764 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:25:11,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:25:11,769 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:25:11,770 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:25:11,771 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:25:11,773 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:25:11,786 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:25:11,788 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:25:11,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:25:11,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:25:11,792 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:25:11,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:25:11,792 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:25:11,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:25:11,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:25:11,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:25:11,799 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:25:11,806 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:25:11,806 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:25:11,807 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:25:11,807 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:25:11,808 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:25:11,808 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:25:11,809 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:25:11,809 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:25:11,831 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:25:11,832 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:25:11,832 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:25:11,832 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:25:11,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:25:11,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:25:11,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:25:11,835 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:25:11,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:25:11,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:25:11,835 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:25:11,835 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:25:11,836 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:25:11,836 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:25:11,836 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:25:11,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:25:11,836 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:25:11,838 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:25:11,839 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:25:11,886 INFO ]: Repository-Root is: /tmp [2018-06-22 01:25:11,899 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:25:11,902 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:25:11,904 INFO ]: Initializing SmtParser... [2018-06-22 01:25:11,904 INFO ]: SmtParser initialized [2018-06-22 01:25:11,904 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/010-horn.smt2 [2018-06-22 01:25:11,906 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-22 01:25:11,995 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/010-horn.smt2 unknown [2018-06-22 01:25:12,186 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/010-horn.smt2 [2018-06-22 01:25:12,190 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:25:12,197 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:25:12,197 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:25:12,197 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:25:12,198 INFO ]: ChcToBoogie initialized [2018-06-22 01:25:12,201 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:25:12" (1/1) ... [2018-06-22 01:25:12,255 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:12 Unit [2018-06-22 01:25:12,255 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:25:12,256 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:25:12,256 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:25:12,256 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:25:12,277 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:12" (1/1) ... [2018-06-22 01:25:12,277 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:12" (1/1) ... [2018-06-22 01:25:12,283 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:12" (1/1) ... [2018-06-22 01:25:12,284 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:12" (1/1) ... [2018-06-22 01:25:12,286 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:12" (1/1) ... [2018-06-22 01:25:12,288 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:12" (1/1) ... [2018-06-22 01:25:12,289 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:12" (1/1) ... [2018-06-22 01:25:12,291 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:25:12,293 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:25:12,293 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:25:12,293 INFO ]: RCFGBuilder initialized [2018-06-22 01:25:12,294 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:12" (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-22 01:25:12,311 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:25:12,311 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:25:12,311 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:25:12,311 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:25:12,311 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:25:12,311 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-22 01:25:12,541 INFO ]: Using library mode [2018-06-22 01:25:12,541 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:25:12 BoogieIcfgContainer [2018-06-22 01:25:12,541 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:25:12,551 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:25:12,551 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:25:12,554 INFO ]: TraceAbstraction initialized [2018-06-22 01:25:12,555 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:25:12" (1/3) ... [2018-06-22 01:25:12,555 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d03161f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:25:12, skipping insertion in model container [2018-06-22 01:25:12,556 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:12" (2/3) ... [2018-06-22 01:25:12,556 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d03161f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:25:12, skipping insertion in model container [2018-06-22 01:25:12,556 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:25:12" (3/3) ... [2018-06-22 01:25:12,558 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:25:12,573 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:25:12,589 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:25:12,664 INFO ]: Using default assertion order modulation [2018-06-22 01:25:12,665 INFO ]: Interprodecural is true [2018-06-22 01:25:12,665 INFO ]: Hoare is false [2018-06-22 01:25:12,665 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:25:12,665 INFO ]: Backedges is TWOTRACK [2018-06-22 01:25:12,665 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:25:12,665 INFO ]: Difference is false [2018-06-22 01:25:12,665 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:25:12,665 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:25:12,679 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 01:25:12,690 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:25:12,690 INFO ]: Found error trace [2018-06-22 01:25:12,691 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:12,691 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:12,697 INFO ]: Analyzing trace with hash -204902306, now seen corresponding path program 1 times [2018-06-22 01:25:12,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:12,700 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:12,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:12,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:12,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:12,784 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:12,858 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:12,859 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:25:12,859 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:25:12,860 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:25:12,871 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:25:12,871 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:12,873 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 01:25:12,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:12,955 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-22 01:25:12,956 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:25:12,957 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:25:12,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:12,964 INFO ]: With dead ends: 9 [2018-06-22 01:25:12,964 INFO ]: Without dead ends: 9 [2018-06-22 01:25:12,966 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-22 01:25:12,980 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:25:12,997 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:25:12,999 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:25:13,000 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-22 01:25:13,002 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-22 01:25:13,002 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:13,002 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-22 01:25:13,002 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:25:13,002 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-22 01:25:13,002 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:25:13,002 INFO ]: Found error trace [2018-06-22 01:25:13,002 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:13,002 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:13,002 INFO ]: Analyzing trace with hash -2054566951, now seen corresponding path program 1 times [2018-06-22 01:25:13,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:13,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:13,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:13,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:13,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:13,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:13,128 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:13,128 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:13,129 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-22 01:25:13,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:13,180 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:13,186 INFO ]: Computing forward predicates... [2018-06-22 01:25:13,289 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:13,323 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:13,323 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:25:13,323 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:25:13,323 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:25:13,323 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:25:13,323 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 5 states. [2018-06-22 01:25:13,610 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:13,610 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-22 01:25:13,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:25:13,611 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:25:13,611 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:13,611 INFO ]: With dead ends: 10 [2018-06-22 01:25:13,611 INFO ]: Without dead ends: 10 [2018-06-22 01:25:13,612 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:25:13,612 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:25:13,613 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:25:13,613 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:25:13,613 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-22 01:25:13,613 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 8 [2018-06-22 01:25:13,613 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:13,613 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-22 01:25:13,613 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:25:13,613 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-22 01:25:13,614 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:25:13,614 INFO ]: Found error trace [2018-06-22 01:25:13,615 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:13,615 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:13,615 INFO ]: Analyzing trace with hash -2050872867, now seen corresponding path program 1 times [2018-06-22 01:25:13,615 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:13,615 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:13,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:13,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:13,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:13,633 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:13,727 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:13,727 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:13,727 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-22 01:25:13,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:13,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:13,772 INFO ]: Computing forward predicates... [2018-06-22 01:25:13,798 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:13,822 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:13,822 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:25:13,822 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:25:13,822 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:25:13,822 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:25:13,823 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 5 states. [2018-06-22 01:25:14,019 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-06-22 01:25:14,058 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:14,058 INFO ]: Finished difference Result 13 states and 23 transitions. [2018-06-22 01:25:14,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:25:14,059 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:25:14,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:14,060 INFO ]: With dead ends: 13 [2018-06-22 01:25:14,060 INFO ]: Without dead ends: 13 [2018-06-22 01:25:14,060 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:25:14,060 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:25:14,062 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:25:14,062 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:25:14,063 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-06-22 01:25:14,063 INFO ]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-06-22 01:25:14,063 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:14,063 INFO ]: Abstraction has 13 states and 23 transitions. [2018-06-22 01:25:14,063 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:25:14,063 INFO ]: Start isEmpty. Operand 13 states and 23 transitions. [2018-06-22 01:25:14,063 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:25:14,063 INFO ]: Found error trace [2018-06-22 01:25:14,063 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:14,064 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:14,064 INFO ]: Analyzing trace with hash 735371198, now seen corresponding path program 2 times [2018-06-22 01:25:14,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:14,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:14,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:14,065 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:14,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:14,080 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:14,150 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:14,150 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:14,150 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-22 01:25:14,160 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:25:14,234 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:25:14,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:14,236 INFO ]: Computing forward predicates... [2018-06-22 01:25:14,306 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:14,327 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:25:14,327 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-06-22 01:25:14,327 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:25:14,327 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:25:14,327 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:25:14,328 INFO ]: Start difference. First operand 13 states and 23 transitions. Second operand 5 states. [2018-06-22 01:25:14,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:14,499 INFO ]: Finished difference Result 15 states and 23 transitions. [2018-06-22 01:25:14,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:25:14,500 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-22 01:25:14,500 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:14,501 INFO ]: With dead ends: 15 [2018-06-22 01:25:14,501 INFO ]: Without dead ends: 10 [2018-06-22 01:25:14,501 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:25:14,501 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:25:14,502 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:25:14,502 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:25:14,502 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-22 01:25:14,502 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2018-06-22 01:25:14,502 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:14,502 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-22 01:25:14,502 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:25:14,503 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-22 01:25:14,503 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:25:14,503 INFO ]: Found error trace [2018-06-22 01:25:14,503 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:14,503 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:14,503 INFO ]: Analyzing trace with hash 739065282, now seen corresponding path program 1 times [2018-06-22 01:25:14,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:14,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:14,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:14,505 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:14,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:14,525 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:14,644 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:14,644 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:14,644 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-22 01:25:14,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:14,687 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:14,689 INFO ]: Computing forward predicates... [2018-06-22 01:25:14,711 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:14,734 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:14,734 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-22 01:25:14,734 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:25:14,735 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:25:14,735 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:25:14,735 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2018-06-22 01:25:14,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:14,796 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-22 01:25:14,796 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:25:14,796 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-22 01:25:14,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:14,797 INFO ]: With dead ends: 11 [2018-06-22 01:25:14,797 INFO ]: Without dead ends: 11 [2018-06-22 01:25:14,797 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:25:14,797 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:25:14,798 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:25:14,798 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:25:14,799 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-22 01:25:14,799 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-22 01:25:14,799 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:14,799 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-22 01:25:14,799 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:25:14,799 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-22 01:25:14,799 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:25:14,799 INFO ]: Found error trace [2018-06-22 01:25:14,799 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:14,799 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:14,800 INFO ]: Analyzing trace with hash 1442318585, now seen corresponding path program 2 times [2018-06-22 01:25:14,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:14,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:14,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:14,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:14,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:14,818 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:15,197 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:15,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:15,197 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-22 01:25:15,219 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:25:15,267 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:25:15,267 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:15,269 INFO ]: Computing forward predicates... [2018-06-22 01:25:15,422 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:15,453 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:15,453 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:25:15,454 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:25:15,454 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:25:15,454 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:25:15,454 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-06-22 01:25:15,513 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:15,513 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-22 01:25:15,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:25:15,515 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-22 01:25:15,515 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:15,515 INFO ]: With dead ends: 12 [2018-06-22 01:25:15,515 INFO ]: Without dead ends: 12 [2018-06-22 01:25:15,516 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:25:15,516 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:25:15,519 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:25:15,519 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:25:15,520 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-22 01:25:15,520 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-22 01:25:15,520 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:15,520 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-22 01:25:15,520 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:25:15,520 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-22 01:25:15,520 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:25:15,520 INFO ]: Found error trace [2018-06-22 01:25:15,520 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:15,520 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:15,521 INFO ]: Analyzing trace with hash 1768334498, now seen corresponding path program 3 times [2018-06-22 01:25:15,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:15,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:15,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:15,522 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:15,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:15,541 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:15,672 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:15,672 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:15,672 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-22 01:25:15,680 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:25:15,710 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:25:15,710 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:15,713 INFO ]: Computing forward predicates... [2018-06-22 01:25:15,742 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:15,764 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:15,764 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:25:15,764 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:25:15,764 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:25:15,764 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:25:15,764 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2018-06-22 01:25:15,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:15,806 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-22 01:25:15,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:25:15,809 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-22 01:25:15,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:15,809 INFO ]: With dead ends: 13 [2018-06-22 01:25:15,809 INFO ]: Without dead ends: 13 [2018-06-22 01:25:15,810 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:25:15,810 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:25:15,811 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:25:15,811 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:25:15,811 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-22 01:25:15,811 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-22 01:25:15,811 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:15,811 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-22 01:25:15,811 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:25:15,811 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-22 01:25:15,812 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:25:15,812 INFO ]: Found error trace [2018-06-22 01:25:15,812 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:15,812 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:15,812 INFO ]: Analyzing trace with hash -1010074087, now seen corresponding path program 4 times [2018-06-22 01:25:15,812 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:15,812 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:15,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:15,813 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:15,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:15,831 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:15,974 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:15,974 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:15,974 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-22 01:25:15,983 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:25:16,024 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:25:16,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:16,028 INFO ]: Computing forward predicates... [2018-06-22 01:25:16,108 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:16,129 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:16,129 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:25:16,130 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:25:16,130 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:25:16,130 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:25:16,130 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-06-22 01:25:16,192 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:16,193 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-22 01:25:16,193 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:25:16,193 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-22 01:25:16,193 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:16,194 INFO ]: With dead ends: 14 [2018-06-22 01:25:16,194 INFO ]: Without dead ends: 14 [2018-06-22 01:25:16,194 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:25:16,194 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:25:16,195 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:25:16,195 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:25:16,196 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-22 01:25:16,196 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-22 01:25:16,196 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:16,196 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-22 01:25:16,196 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:25:16,196 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-22 01:25:16,196 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:25:16,196 INFO ]: Found error trace [2018-06-22 01:25:16,196 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:16,196 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:16,197 INFO ]: Analyzing trace with hash -1241394302, now seen corresponding path program 5 times [2018-06-22 01:25:16,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:16,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:16,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:16,197 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:16,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:16,230 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:16,403 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:16,403 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:16,403 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:25:16,418 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:16,478 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:25:16,478 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:16,482 INFO ]: Computing forward predicates... [2018-06-22 01:25:16,512 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:16,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:16,543 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:25:16,544 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:25:16,544 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:25:16,544 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:25:16,544 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 9 states. [2018-06-22 01:25:16,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:16,617 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-22 01:25:16,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:25:16,617 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 01:25:16,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:16,618 INFO ]: With dead ends: 15 [2018-06-22 01:25:16,618 INFO ]: Without dead ends: 15 [2018-06-22 01:25:16,618 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:25:16,618 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:25:16,619 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:25:16,619 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:25:16,620 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-22 01:25:16,620 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-22 01:25:16,620 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:16,620 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-22 01:25:16,620 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:25:16,620 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-22 01:25:16,620 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:25:16,620 INFO ]: Found error trace [2018-06-22 01:25:16,620 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:16,620 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:16,620 INFO ]: Analyzing trace with hash 177613625, now seen corresponding path program 6 times [2018-06-22 01:25:16,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:16,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:16,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:16,621 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:16,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:16,638 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:16,909 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:16,909 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:16,909 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-22 01:25:16,915 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:25:16,950 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:25:16,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:16,954 INFO ]: Computing forward predicates... [2018-06-22 01:25:16,977 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:17,008 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:17,008 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 01:25:17,009 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:25:17,009 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:25:17,009 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:25:17,009 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2018-06-22 01:25:17,084 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:17,084 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-22 01:25:17,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:25:17,085 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-22 01:25:17,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:17,085 INFO ]: With dead ends: 16 [2018-06-22 01:25:17,085 INFO ]: Without dead ends: 16 [2018-06-22 01:25:17,086 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:25:17,086 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:25:17,087 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 01:25:17,087 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:25:17,087 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-22 01:25:17,087 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-22 01:25:17,087 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:17,087 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-22 01:25:17,087 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:25:17,087 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-22 01:25:17,087 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:25:17,087 INFO ]: Found error trace [2018-06-22 01:25:17,087 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:17,087 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:17,087 INFO ]: Analyzing trace with hash 1217186402, now seen corresponding path program 7 times [2018-06-22 01:25:17,087 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:17,087 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:17,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:17,088 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:17,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:17,105 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:18,406 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:18,406 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:18,406 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-22 01:25:18,413 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:18,463 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:18,467 INFO ]: Computing forward predicates... [2018-06-22 01:25:18,559 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:18,587 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:18,587 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 01:25:18,587 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:25:18,587 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:25:18,587 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:25:18,587 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 11 states. [2018-06-22 01:25:18,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:18,697 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-22 01:25:18,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:25:18,698 INFO ]: Start accepts. Automaton has 11 states. Word has length 15 [2018-06-22 01:25:18,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:18,698 INFO ]: With dead ends: 17 [2018-06-22 01:25:18,698 INFO ]: Without dead ends: 17 [2018-06-22 01:25:18,698 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:25:18,698 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:25:18,700 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 01:25:18,700 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:25:18,700 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-22 01:25:18,700 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-22 01:25:18,701 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:18,701 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-22 01:25:18,701 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:25:18,701 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-22 01:25:18,701 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:25:18,701 INFO ]: Found error trace [2018-06-22 01:25:18,701 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:18,701 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:18,701 INFO ]: Analyzing trace with hash -915795879, now seen corresponding path program 8 times [2018-06-22 01:25:18,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:18,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:18,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:18,702 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:18,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:18,727 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:18,990 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:18,990 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:18,990 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-22 01:25:18,996 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:25:19,046 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:25:19,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:19,051 INFO ]: Computing forward predicates... [2018-06-22 01:25:19,079 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:19,112 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:19,112 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 01:25:19,112 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:25:19,112 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:25:19,112 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:25:19,112 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 12 states. [2018-06-22 01:25:19,422 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:19,422 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-22 01:25:19,423 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:25:19,423 INFO ]: Start accepts. Automaton has 12 states. Word has length 16 [2018-06-22 01:25:19,423 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:19,423 INFO ]: With dead ends: 18 [2018-06-22 01:25:19,423 INFO ]: Without dead ends: 18 [2018-06-22 01:25:19,423 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:25:19,424 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:25:19,425 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:25:19,425 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:25:19,425 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-22 01:25:19,425 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-22 01:25:19,426 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:19,426 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-22 01:25:19,426 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:25:19,426 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-22 01:25:19,426 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:25:19,426 INFO ]: Found error trace [2018-06-22 01:25:19,426 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:19,426 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:19,426 INFO ]: Analyzing trace with hash 1681230146, now seen corresponding path program 9 times [2018-06-22 01:25:19,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:19,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:19,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:19,427 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:19,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:19,455 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:19,676 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:19,676 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:19,676 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-22 01:25:19,682 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:25:19,724 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:25:19,724 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:19,729 INFO ]: Computing forward predicates... [2018-06-22 01:25:19,757 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:19,788 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:19,788 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 01:25:19,789 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:25:19,789 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:25:19,789 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:25:19,789 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 13 states. [2018-06-22 01:25:19,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:19,947 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-22 01:25:19,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:25:19,947 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 01:25:19,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:19,948 INFO ]: With dead ends: 19 [2018-06-22 01:25:19,948 INFO ]: Without dead ends: 19 [2018-06-22 01:25:19,948 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:25:19,948 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:25:19,949 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:25:19,949 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:25:19,950 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-22 01:25:19,950 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-22 01:25:19,950 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:19,950 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-22 01:25:19,950 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:25:19,950 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-22 01:25:19,950 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:25:19,950 INFO ]: Found error trace [2018-06-22 01:25:19,950 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:19,951 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:19,951 INFO ]: Analyzing trace with hash 584658297, now seen corresponding path program 10 times [2018-06-22 01:25:19,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:19,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:19,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:19,951 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:19,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:19,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:20,194 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:20,194 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:20,194 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-22 01:25:20,200 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:25:20,252 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:25:20,252 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:20,257 INFO ]: Computing forward predicates... [2018-06-22 01:25:20,295 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:20,323 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:20,323 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-22 01:25:20,323 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:25:20,323 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:25:20,323 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:25:20,323 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 14 states. [2018-06-22 01:25:20,471 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:20,471 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-22 01:25:20,474 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:25:20,474 INFO ]: Start accepts. Automaton has 14 states. Word has length 18 [2018-06-22 01:25:20,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:20,474 INFO ]: With dead ends: 20 [2018-06-22 01:25:20,474 INFO ]: Without dead ends: 20 [2018-06-22 01:25:20,474 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:25:20,474 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:25:20,476 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 01:25:20,476 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:25:20,476 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-22 01:25:20,476 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-22 01:25:20,476 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:20,476 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-22 01:25:20,476 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:25:20,476 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-22 01:25:20,477 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:25:20,477 INFO ]: Found error trace [2018-06-22 01:25:20,477 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:20,477 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:20,477 INFO ]: Analyzing trace with hash 950669346, now seen corresponding path program 11 times [2018-06-22 01:25:20,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:20,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:20,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:20,478 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:20,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:20,497 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:20,858 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:20,858 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:20,858 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:20,864 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:25:20,926 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:25:20,926 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:20,932 INFO ]: Computing forward predicates... [2018-06-22 01:25:20,968 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:20,996 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:20,996 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-22 01:25:20,996 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:25:20,996 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:25:20,996 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:25:20,997 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 15 states. [2018-06-22 01:25:21,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:21,112 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-22 01:25:21,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:25:21,113 INFO ]: Start accepts. Automaton has 15 states. Word has length 19 [2018-06-22 01:25:21,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:21,113 INFO ]: With dead ends: 21 [2018-06-22 01:25:21,113 INFO ]: Without dead ends: 21 [2018-06-22 01:25:21,114 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:25:21,114 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:25:21,115 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 01:25:21,115 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:25:21,116 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-22 01:25:21,116 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-22 01:25:21,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:21,116 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-22 01:25:21,116 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:25:21,116 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-22 01:25:21,117 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:25:21,117 INFO ]: Found error trace [2018-06-22 01:25:21,117 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:21,117 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:21,117 INFO ]: Analyzing trace with hash -587890023, now seen corresponding path program 12 times [2018-06-22 01:25:21,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:21,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:21,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:21,117 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:21,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:21,138 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:21,521 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:21,522 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:21,522 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-22 01:25:21,530 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:25:21,614 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 01:25:21,614 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:21,622 INFO ]: Computing forward predicates... [2018-06-22 01:25:21,706 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:21,731 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:21,731 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-22 01:25:21,731 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:25:21,731 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:25:21,731 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:25:21,731 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 16 states. [2018-06-22 01:25:21,910 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:21,910 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-22 01:25:21,924 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:25:21,924 INFO ]: Start accepts. Automaton has 16 states. Word has length 20 [2018-06-22 01:25:21,924 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:21,925 INFO ]: With dead ends: 22 [2018-06-22 01:25:21,925 INFO ]: Without dead ends: 22 [2018-06-22 01:25:21,925 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:25:21,925 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:25:21,927 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 01:25:21,927 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:25:21,928 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-22 01:25:21,928 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-22 01:25:21,928 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:21,928 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-22 01:25:21,928 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:25:21,928 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-22 01:25:21,929 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:25:21,929 INFO ]: Found error trace [2018-06-22 01:25:21,929 INFO ]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:21,929 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:21,929 INFO ]: Analyzing trace with hash -1038590206, now seen corresponding path program 13 times [2018-06-22 01:25:21,929 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:21,929 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:21,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:21,929 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:21,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:21,951 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:22,492 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:22,492 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:22,492 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:22,499 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:22,562 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:22,569 INFO ]: Computing forward predicates... [2018-06-22 01:25:22,763 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:22,796 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:22,796 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-22 01:25:22,797 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:25:22,797 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:25:22,797 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:25:22,797 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 17 states. [2018-06-22 01:25:23,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:23,133 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-22 01:25:23,134 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:25:23,134 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 01:25:23,134 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:23,134 INFO ]: With dead ends: 23 [2018-06-22 01:25:23,134 INFO ]: Without dead ends: 23 [2018-06-22 01:25:23,135 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:25:23,135 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:25:23,136 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 01:25:23,136 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:25:23,137 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-22 01:25:23,137 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-22 01:25:23,137 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:23,137 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-22 01:25:23,137 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:25:23,137 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-22 01:25:23,137 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:25:23,137 INFO ]: Found error trace [2018-06-22 01:25:23,137 INFO ]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:23,138 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:23,138 INFO ]: Analyzing trace with hash -2125393991, now seen corresponding path program 14 times [2018-06-22 01:25:23,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:23,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:23,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:23,138 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:23,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:23,160 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:24,027 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:24,027 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:24,027 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-22 01:25:24,033 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:25:24,126 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:25:24,126 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:24,137 INFO ]: Computing forward predicates... [2018-06-22 01:25:24,323 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:24,355 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:24,355 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-22 01:25:24,355 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:25:24,355 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:25:24,355 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:25:24,356 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 18 states. [2018-06-22 01:25:24,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:24,778 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-22 01:25:24,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:25:24,778 INFO ]: Start accepts. Automaton has 18 states. Word has length 22 [2018-06-22 01:25:24,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:24,779 INFO ]: With dead ends: 24 [2018-06-22 01:25:24,779 INFO ]: Without dead ends: 24 [2018-06-22 01:25:24,779 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:25:24,779 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:25:24,781 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 01:25:24,781 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:25:24,781 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-22 01:25:24,781 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-22 01:25:24,781 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:24,781 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-22 01:25:24,781 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:25:24,781 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-22 01:25:24,782 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:25:24,782 INFO ]: Found error trace [2018-06-22 01:25:24,782 INFO ]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:24,782 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:24,782 INFO ]: Analyzing trace with hash -1456572958, now seen corresponding path program 15 times [2018-06-22 01:25:24,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:24,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:24,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:24,782 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:24,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:24,805 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:25,459 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:25,460 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:25,460 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-22 01:25:25,466 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:25:25,536 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 01:25:25,536 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:25,541 INFO ]: Computing forward predicates... [2018-06-22 01:25:25,567 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:25,598 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:25,598 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-22 01:25:25,598 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:25:25,598 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:25:25,599 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:25:25,599 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 19 states. [2018-06-22 01:25:25,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:25,793 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-22 01:25:25,793 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:25:25,793 INFO ]: Start accepts. Automaton has 19 states. Word has length 23 [2018-06-22 01:25:25,793 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:25,793 INFO ]: With dead ends: 25 [2018-06-22 01:25:25,793 INFO ]: Without dead ends: 25 [2018-06-22 01:25:25,794 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:25:25,794 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:25:25,795 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 01:25:25,795 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:25:25,796 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-22 01:25:25,796 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-22 01:25:25,796 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:25,796 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-22 01:25:25,796 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:25:25,796 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-22 01:25:25,796 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:25:25,796 INFO ]: Found error trace [2018-06-22 01:25:25,796 INFO ]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:25,797 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:25,797 INFO ]: Analyzing trace with hash 2097009881, now seen corresponding path program 16 times [2018-06-22 01:25:25,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:25,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:25,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:25,797 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:25,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:25,839 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:26,363 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:26,363 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:26,363 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-22 01:25:26,371 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:25:26,444 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:25:26,444 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:26,451 INFO ]: Computing forward predicates... [2018-06-22 01:25:26,473 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:26,492 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:26,492 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-22 01:25:26,492 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:25:26,492 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:25:26,492 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:25:26,492 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 20 states. [2018-06-22 01:25:26,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:26,744 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-22 01:25:26,744 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:25:26,744 INFO ]: Start accepts. Automaton has 20 states. Word has length 24 [2018-06-22 01:25:26,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:26,744 INFO ]: With dead ends: 26 [2018-06-22 01:25:26,744 INFO ]: Without dead ends: 26 [2018-06-22 01:25:26,745 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:25:26,745 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:25:26,746 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 01:25:26,746 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:25:26,747 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-22 01:25:26,747 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-22 01:25:26,747 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:26,747 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-22 01:25:26,747 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:25:26,747 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-22 01:25:26,747 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:25:26,747 INFO ]: Found error trace [2018-06-22 01:25:26,747 INFO ]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:26,747 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:26,748 INFO ]: Analyzing trace with hash 588928194, now seen corresponding path program 17 times [2018-06-22 01:25:26,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:26,748 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:26,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:26,748 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:26,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:26,773 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:27,638 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:27,638 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:27,638 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:27,657 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:25:27,739 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 01:25:27,739 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:27,752 INFO ]: Computing forward predicates... [2018-06-22 01:25:27,772 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:27,792 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:27,792 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-22 01:25:27,792 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:25:27,793 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:25:27,793 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:25:27,793 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 21 states. [2018-06-22 01:25:28,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:28,047 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-22 01:25:28,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:25:28,047 INFO ]: Start accepts. Automaton has 21 states. Word has length 25 [2018-06-22 01:25:28,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:28,048 INFO ]: With dead ends: 27 [2018-06-22 01:25:28,048 INFO ]: Without dead ends: 27 [2018-06-22 01:25:28,048 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:25:28,048 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:25:28,049 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 01:25:28,049 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:25:28,050 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-22 01:25:28,050 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-22 01:25:28,050 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:28,050 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-22 01:25:28,050 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:25:28,050 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-22 01:25:28,050 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:25:28,050 INFO ]: Found error trace [2018-06-22 01:25:28,050 INFO ]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:28,050 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:28,050 INFO ]: Analyzing trace with hash 1083036153, now seen corresponding path program 18 times [2018-06-22 01:25:28,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:28,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:28,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:28,052 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:28,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:28,082 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:28,956 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:28,956 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:28,956 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:28,962 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:25:29,043 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-22 01:25:29,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:29,050 INFO ]: Computing forward predicates... [2018-06-22 01:25:29,078 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:29,110 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:29,110 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-22 01:25:29,110 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:25:29,110 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:25:29,110 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:25:29,111 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 22 states. [2018-06-22 01:25:29,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:29,534 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-22 01:25:29,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:25:29,534 INFO ]: Start accepts. Automaton has 22 states. Word has length 26 [2018-06-22 01:25:29,534 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:29,534 INFO ]: With dead ends: 28 [2018-06-22 01:25:29,534 INFO ]: Without dead ends: 28 [2018-06-22 01:25:29,535 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:25:29,535 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:25:29,536 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 01:25:29,536 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:25:29,537 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-22 01:25:29,537 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-22 01:25:29,537 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:29,537 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-22 01:25:29,537 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:25:29,537 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-22 01:25:29,537 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:25:29,537 INFO ]: Found error trace [2018-06-22 01:25:29,537 INFO ]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:29,537 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:29,538 INFO ]: Analyzing trace with hash -779486302, now seen corresponding path program 19 times [2018-06-22 01:25:29,539 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:29,539 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:29,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:29,539 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:29,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:29,565 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:30,604 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:30,604 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:30,604 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:30,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:30,717 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:30,729 INFO ]: Computing forward predicates... [2018-06-22 01:25:30,776 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:30,795 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:30,795 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-22 01:25:30,795 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:25:30,795 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:25:30,796 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:25:30,796 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 23 states. [2018-06-22 01:25:31,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:31,221 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-22 01:25:31,222 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:25:31,222 INFO ]: Start accepts. Automaton has 23 states. Word has length 27 [2018-06-22 01:25:31,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:31,223 INFO ]: With dead ends: 29 [2018-06-22 01:25:31,223 INFO ]: Without dead ends: 29 [2018-06-22 01:25:31,223 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:25:31,223 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:25:31,225 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 01:25:31,225 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:25:31,225 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-22 01:25:31,225 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-22 01:25:31,226 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:31,226 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-22 01:25:31,226 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:25:31,226 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-22 01:25:31,226 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:25:31,226 INFO ]: Found error trace [2018-06-22 01:25:31,226 INFO ]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:31,226 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:31,226 INFO ]: Analyzing trace with hash 1611859737, now seen corresponding path program 20 times [2018-06-22 01:25:31,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:31,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:31,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:31,227 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:31,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:31,252 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:31,843 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:31,843 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:31,843 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:31,849 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:25:31,932 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:25:31,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:31,943 INFO ]: Computing forward predicates... [2018-06-22 01:25:31,974 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:32,006 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:32,006 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-22 01:25:32,006 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:25:32,007 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:25:32,007 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:25:32,007 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 24 states. [2018-06-22 01:25:32,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:32,628 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-22 01:25:32,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:25:32,628 INFO ]: Start accepts. Automaton has 24 states. Word has length 28 [2018-06-22 01:25:32,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:32,629 INFO ]: With dead ends: 30 [2018-06-22 01:25:32,629 INFO ]: Without dead ends: 30 [2018-06-22 01:25:32,629 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:25:32,629 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:25:32,631 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 01:25:32,631 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:25:32,632 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-22 01:25:32,632 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-22 01:25:32,632 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:32,632 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-22 01:25:32,632 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:25:32,632 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-22 01:25:32,632 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:25:32,632 INFO ]: Found error trace [2018-06-22 01:25:32,632 INFO ]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:32,632 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:32,633 INFO ]: Analyzing trace with hash -1565824382, now seen corresponding path program 21 times [2018-06-22 01:25:32,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:32,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:32,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:32,633 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:32,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:32,658 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:33,439 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:33,439 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:33,439 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:33,446 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:25:33,539 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-22 01:25:33,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:33,545 INFO ]: Computing forward predicates... [2018-06-22 01:25:33,599 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:33,630 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:33,630 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-22 01:25:33,631 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:25:33,631 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:25:33,631 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:25:33,631 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 25 states. [2018-06-22 01:25:34,020 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:34,021 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-22 01:25:34,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:25:34,021 INFO ]: Start accepts. Automaton has 25 states. Word has length 29 [2018-06-22 01:25:34,021 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:34,021 INFO ]: With dead ends: 31 [2018-06-22 01:25:34,021 INFO ]: Without dead ends: 31 [2018-06-22 01:25:34,021 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:25:34,021 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:25:34,022 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 01:25:34,022 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:25:34,023 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-22 01:25:34,023 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-22 01:25:34,023 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:34,023 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-22 01:25:34,023 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:25:34,023 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-22 01:25:34,023 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:25:34,023 INFO ]: Found error trace [2018-06-22 01:25:34,023 INFO ]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:34,023 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:34,023 INFO ]: Analyzing trace with hash -1289784263, now seen corresponding path program 22 times [2018-06-22 01:25:34,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:34,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:34,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:34,024 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:34,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:34,050 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:34,772 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:34,773 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:34,773 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:34,778 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:25:34,885 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:25:34,885 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:34,900 INFO ]: Computing forward predicates... [2018-06-22 01:25:34,956 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:34,977 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:34,977 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-22 01:25:34,977 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:25:34,977 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:25:34,978 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:25:34,978 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 26 states. [2018-06-22 01:25:35,624 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:35,624 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-22 01:25:35,625 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:25:35,625 INFO ]: Start accepts. Automaton has 26 states. Word has length 30 [2018-06-22 01:25:35,625 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:35,625 INFO ]: With dead ends: 32 [2018-06-22 01:25:35,625 INFO ]: Without dead ends: 32 [2018-06-22 01:25:35,626 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:25:35,626 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:25:35,628 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 01:25:35,628 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:25:35,628 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-22 01:25:35,628 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-22 01:25:35,629 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:35,629 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-22 01:25:35,629 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:25:35,629 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-22 01:25:35,629 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:25:35,629 INFO ]: Found error trace [2018-06-22 01:25:35,629 INFO ]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:35,629 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:35,629 INFO ]: Analyzing trace with hash -1322475166, now seen corresponding path program 23 times [2018-06-22 01:25:35,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:35,630 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:35,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:35,630 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:35,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:35,661 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:36,268 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:36,269 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:36,269 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:36,275 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:25:36,414 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-22 01:25:36,414 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:36,450 INFO ]: Computing forward predicates... [2018-06-22 01:25:36,484 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:36,508 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:36,508 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-22 01:25:36,508 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:25:36,509 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:25:36,509 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:25:36,509 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 27 states. [2018-06-22 01:25:36,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:36,968 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-22 01:25:36,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:25:36,968 INFO ]: Start accepts. Automaton has 27 states. Word has length 31 [2018-06-22 01:25:36,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:36,969 INFO ]: With dead ends: 33 [2018-06-22 01:25:36,969 INFO ]: Without dead ends: 33 [2018-06-22 01:25:36,969 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:25:36,969 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:25:36,970 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 01:25:36,970 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:25:36,970 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-22 01:25:36,970 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-22 01:25:36,971 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:36,971 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-22 01:25:36,971 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:25:36,971 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-22 01:25:36,971 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:25:36,971 INFO ]: Found error trace [2018-06-22 01:25:36,971 INFO ]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:36,971 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:36,971 INFO ]: Analyzing trace with hash 1959074137, now seen corresponding path program 24 times [2018-06-22 01:25:36,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:36,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:36,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:36,972 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:36,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:37,002 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:37,896 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:37,896 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:37,896 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:37,903 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:25:38,038 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-22 01:25:38,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:38,047 INFO ]: Computing forward predicates... [2018-06-22 01:25:38,079 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:38,105 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:38,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-22 01:25:38,107 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:25:38,107 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:25:38,107 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:25:38,108 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 28 states. [2018-06-22 01:25:38,592 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:38,592 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-22 01:25:38,595 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:25:38,595 INFO ]: Start accepts. Automaton has 28 states. Word has length 32 [2018-06-22 01:25:38,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:38,595 INFO ]: With dead ends: 34 [2018-06-22 01:25:38,595 INFO ]: Without dead ends: 34 [2018-06-22 01:25:38,595 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:25:38,595 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:25:38,596 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 01:25:38,596 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:25:38,597 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-22 01:25:38,597 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-22 01:25:38,597 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:38,597 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-22 01:25:38,597 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:25:38,597 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-22 01:25:38,597 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:25:38,598 INFO ]: Found error trace [2018-06-22 01:25:38,598 INFO ]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:38,598 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:38,598 INFO ]: Analyzing trace with hash 607887426, now seen corresponding path program 25 times [2018-06-22 01:25:38,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:38,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:38,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:38,598 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:38,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:38,651 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:39,312 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:39,312 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:39,312 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:39,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:39,461 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:39,483 INFO ]: Computing forward predicates... [2018-06-22 01:25:39,505 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:39,524 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:39,524 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-22 01:25:39,524 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:25:39,524 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:25:39,524 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:25:39,524 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 29 states. [2018-06-22 01:25:40,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:40,038 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-22 01:25:40,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:25:40,039 INFO ]: Start accepts. Automaton has 29 states. Word has length 33 [2018-06-22 01:25:40,039 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:40,039 INFO ]: With dead ends: 35 [2018-06-22 01:25:40,039 INFO ]: Without dead ends: 35 [2018-06-22 01:25:40,039 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:25:40,039 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:25:40,041 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 01:25:40,041 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:25:40,041 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-22 01:25:40,041 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-22 01:25:40,041 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:40,042 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-22 01:25:40,042 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:25:40,042 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-22 01:25:40,042 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:25:40,042 INFO ]: Found error trace [2018-06-22 01:25:40,042 INFO ]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:40,042 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:40,042 INFO ]: Analyzing trace with hash 1670772345, now seen corresponding path program 26 times [2018-06-22 01:25:40,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:40,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:40,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:40,044 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:40,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:40,075 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:41,089 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:41,090 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:41,090 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:41,095 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:25:41,256 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:25:41,256 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:41,286 INFO ]: Computing forward predicates... [2018-06-22 01:25:41,319 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:41,350 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:41,350 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-22 01:25:41,351 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:25:41,351 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:25:41,351 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:25:41,351 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 30 states. [2018-06-22 01:25:41,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:41,967 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-22 01:25:41,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:25:41,969 INFO ]: Start accepts. Automaton has 30 states. Word has length 34 [2018-06-22 01:25:41,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:41,969 INFO ]: With dead ends: 36 [2018-06-22 01:25:41,969 INFO ]: Without dead ends: 36 [2018-06-22 01:25:41,970 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:25:41,970 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:25:41,972 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 01:25:41,972 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:25:41,972 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-22 01:25:41,972 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-22 01:25:41,972 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:41,972 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-22 01:25:41,972 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:25:41,972 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-22 01:25:41,973 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:25:41,973 INFO ]: Found error trace [2018-06-22 01:25:41,973 INFO ]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:41,973 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:41,973 INFO ]: Analyzing trace with hash 260466466, now seen corresponding path program 27 times [2018-06-22 01:25:41,973 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:41,973 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:41,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:41,974 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:41,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:42,005 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:43,323 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:43,323 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:43,341 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:43,346 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:25:43,470 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-22 01:25:43,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:43,479 INFO ]: Computing forward predicates... [2018-06-22 01:25:43,539 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:43,559 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:43,559 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-22 01:25:43,559 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:25:43,559 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:25:43,559 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:25:43,559 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 31 states. [2018-06-22 01:25:44,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:44,192 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-22 01:25:44,192 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:25:44,192 INFO ]: Start accepts. Automaton has 31 states. Word has length 35 [2018-06-22 01:25:44,192 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:44,192 INFO ]: With dead ends: 37 [2018-06-22 01:25:44,192 INFO ]: Without dead ends: 37 [2018-06-22 01:25:44,192 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:25:44,192 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:25:44,194 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-22 01:25:44,194 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:25:44,194 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-22 01:25:44,194 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-22 01:25:44,194 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:44,194 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-22 01:25:44,194 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:25:44,194 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-22 01:25:44,195 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:25:44,195 INFO ]: Found error trace [2018-06-22 01:25:44,195 INFO ]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:44,195 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:44,195 INFO ]: Analyzing trace with hash -509342823, now seen corresponding path program 28 times [2018-06-22 01:25:44,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:44,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:44,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:44,195 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:44,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:44,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:45,237 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:45,237 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:45,237 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:45,243 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:25:45,449 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:25:45,449 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:45,487 INFO ]: Computing forward predicates... [2018-06-22 01:25:45,577 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:45,596 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:45,596 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-22 01:25:45,596 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:25:45,596 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:25:45,596 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:25:45,596 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 32 states. [2018-06-22 01:25:46,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:46,284 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-22 01:25:46,284 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:25:46,285 INFO ]: Start accepts. Automaton has 32 states. Word has length 36 [2018-06-22 01:25:46,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:46,285 INFO ]: With dead ends: 38 [2018-06-22 01:25:46,285 INFO ]: Without dead ends: 38 [2018-06-22 01:25:46,285 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:25:46,285 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:25:46,287 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 01:25:46,287 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:25:46,287 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-22 01:25:46,287 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-22 01:25:46,287 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:46,287 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-22 01:25:46,287 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:25:46,287 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-22 01:25:46,288 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:25:46,288 INFO ]: Found error trace [2018-06-22 01:25:46,288 INFO ]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:46,288 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:46,288 INFO ]: Analyzing trace with hash 1396372994, now seen corresponding path program 29 times [2018-06-22 01:25:46,288 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:46,288 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:46,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:46,288 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:46,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:46,315 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:47,533 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:47,533 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:47,533 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:47,539 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:25:47,737 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-22 01:25:47,737 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:47,799 INFO ]: Computing forward predicates... [2018-06-22 01:25:47,853 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:47,873 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:47,873 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-22 01:25:47,873 INFO ]: Interpolant automaton has 33 states [2018-06-22 01:25:47,873 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 01:25:47,874 INFO ]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:25:47,874 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 33 states. [2018-06-22 01:25:48,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:48,598 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-22 01:25:48,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:25:48,598 INFO ]: Start accepts. Automaton has 33 states. Word has length 37 [2018-06-22 01:25:48,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:48,599 INFO ]: With dead ends: 39 [2018-06-22 01:25:48,599 INFO ]: Without dead ends: 39 [2018-06-22 01:25:48,599 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:25:48,599 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:25:48,600 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 01:25:48,600 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:25:48,601 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-22 01:25:48,601 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-22 01:25:48,601 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:48,601 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-22 01:25:48,601 INFO ]: Interpolant automaton has 33 states. [2018-06-22 01:25:48,601 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-22 01:25:48,602 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:25:48,602 INFO ]: Found error trace [2018-06-22 01:25:48,602 INFO ]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:48,602 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:48,602 INFO ]: Analyzing trace with hash 344021177, now seen corresponding path program 30 times [2018-06-22 01:25:48,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:48,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:48,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:48,602 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:48,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:48,644 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:49,946 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:49,946 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:49,946 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:49,951 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:25:50,179 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-06-22 01:25:50,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:50,194 INFO ]: Computing forward predicates... [2018-06-22 01:25:50,403 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:50,434 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:50,434 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-22 01:25:50,434 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:25:50,434 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:25:50,435 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:25:50,435 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 34 states. [2018-06-22 01:25:51,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:51,482 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-22 01:25:51,482 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:25:51,483 INFO ]: Start accepts. Automaton has 34 states. Word has length 38 [2018-06-22 01:25:51,483 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:51,483 INFO ]: With dead ends: 40 [2018-06-22 01:25:51,483 INFO ]: Without dead ends: 40 [2018-06-22 01:25:51,483 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:25:51,483 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 01:25:51,484 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-22 01:25:51,484 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:25:51,485 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-22 01:25:51,485 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-22 01:25:51,485 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:51,485 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-22 01:25:51,485 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:25:51,485 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-22 01:25:51,485 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:25:51,485 INFO ]: Found error trace [2018-06-22 01:25:51,485 INFO ]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:51,485 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:51,486 INFO ]: Analyzing trace with hash 2080853218, now seen corresponding path program 31 times [2018-06-22 01:25:51,486 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:51,486 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:51,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:51,486 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:51,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:51,521 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:52,681 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:52,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:52,681 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:52,698 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:52,984 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:53,044 INFO ]: Computing forward predicates... [2018-06-22 01:25:53,189 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:53,221 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:53,221 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-22 01:25:53,221 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:25:53,221 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:25:53,221 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:25:53,222 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 35 states. [2018-06-22 01:25:54,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:54,205 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-22 01:25:54,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:25:54,205 INFO ]: Start accepts. Automaton has 35 states. Word has length 39 [2018-06-22 01:25:54,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:54,205 INFO ]: With dead ends: 41 [2018-06-22 01:25:54,205 INFO ]: Without dead ends: 41 [2018-06-22 01:25:54,205 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:25:54,206 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:25:54,206 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 01:25:54,206 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:25:54,207 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-22 01:25:54,207 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-22 01:25:54,207 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:54,207 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-22 01:25:54,207 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:25:54,207 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-22 01:25:54,207 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:25:54,207 INFO ]: Found error trace [2018-06-22 01:25:54,207 INFO ]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:54,208 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:54,208 INFO ]: Analyzing trace with hash 88071641, now seen corresponding path program 32 times [2018-06-22 01:25:54,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:54,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:54,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:54,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:54,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:54,238 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:56,497 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:56,497 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:56,497 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:56,503 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:25:56,840 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:25:56,840 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:56,905 INFO ]: Computing forward predicates... [2018-06-22 01:25:56,941 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:56,974 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:56,974 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-22 01:25:56,975 INFO ]: Interpolant automaton has 36 states [2018-06-22 01:25:56,975 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 01:25:56,975 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:25:56,975 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 36 states. [2018-06-22 01:25:58,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:58,061 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-22 01:25:58,061 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:25:58,061 INFO ]: Start accepts. Automaton has 36 states. Word has length 40 [2018-06-22 01:25:58,061 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:58,061 INFO ]: With dead ends: 42 [2018-06-22 01:25:58,061 INFO ]: Without dead ends: 42 [2018-06-22 01:25:58,062 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:25:58,062 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:25:58,063 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 01:25:58,063 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:25:58,063 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-22 01:25:58,063 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-22 01:25:58,063 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:58,063 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-22 01:25:58,063 INFO ]: Interpolant automaton has 36 states. [2018-06-22 01:25:58,063 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-22 01:25:58,063 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:25:58,063 INFO ]: Found error trace [2018-06-22 01:25:58,063 INFO ]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:58,063 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:58,063 INFO ]: Analyzing trace with hash -1558615102, now seen corresponding path program 33 times [2018-06-22 01:25:58,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:58,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:58,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:58,064 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:58,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:58,105 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:59,999 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:59,999 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:59,999 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:00,004 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:26:00,176 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-22 01:26:00,176 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:00,187 INFO ]: Computing forward predicates... [2018-06-22 01:26:00,224 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:00,247 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:00,247 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-06-22 01:26:00,247 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:26:00,247 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:26:00,247 INFO ]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:26:00,248 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 37 states. [2018-06-22 01:26:01,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:01,402 INFO ]: Finished difference Result 43 states and 43 transitions. [2018-06-22 01:26:01,402 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:26:01,402 INFO ]: Start accepts. Automaton has 37 states. Word has length 41 [2018-06-22 01:26:01,402 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:01,402 INFO ]: With dead ends: 43 [2018-06-22 01:26:01,402 INFO ]: Without dead ends: 43 [2018-06-22 01:26:01,403 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:26:01,403 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:26:01,404 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-22 01:26:01,404 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:26:01,404 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-06-22 01:26:01,404 INFO ]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-06-22 01:26:01,404 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:01,404 INFO ]: Abstraction has 43 states and 43 transitions. [2018-06-22 01:26:01,404 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:26:01,404 INFO ]: Start isEmpty. Operand 43 states and 43 transitions. [2018-06-22 01:26:01,404 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:26:01,404 INFO ]: Found error trace [2018-06-22 01:26:01,404 INFO ]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:01,404 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:01,404 INFO ]: Analyzing trace with hash -1066296583, now seen corresponding path program 34 times [2018-06-22 01:26:01,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:01,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:01,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:01,405 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:01,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:01,442 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:02,818 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:02,818 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:02,818 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:02,824 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:26:03,212 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:26:03,213 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:03,290 INFO ]: Computing forward predicates... [2018-06-22 01:26:03,318 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:03,339 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:03,339 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-06-22 01:26:03,339 INFO ]: Interpolant automaton has 38 states [2018-06-22 01:26:03,339 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 01:26:03,339 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:26:03,339 INFO ]: Start difference. First operand 43 states and 43 transitions. Second operand 38 states. [2018-06-22 01:26:04,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:04,241 INFO ]: Finished difference Result 44 states and 44 transitions. [2018-06-22 01:26:04,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:26:04,257 INFO ]: Start accepts. Automaton has 38 states. Word has length 42 [2018-06-22 01:26:04,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:04,258 INFO ]: With dead ends: 44 [2018-06-22 01:26:04,258 INFO ]: Without dead ends: 44 [2018-06-22 01:26:04,258 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:26:04,258 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 01:26:04,259 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 01:26:04,259 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:26:04,260 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-06-22 01:26:04,260 INFO ]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-06-22 01:26:04,260 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:04,260 INFO ]: Abstraction has 44 states and 44 transitions. [2018-06-22 01:26:04,260 INFO ]: Interpolant automaton has 38 states. [2018-06-22 01:26:04,260 INFO ]: Start isEmpty. Operand 44 states and 44 transitions. [2018-06-22 01:26:04,260 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:26:04,260 INFO ]: Found error trace [2018-06-22 01:26:04,260 INFO ]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:04,260 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:04,260 INFO ]: Analyzing trace with hash 1310675618, now seen corresponding path program 35 times [2018-06-22 01:26:04,260 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:04,260 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:04,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:04,261 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:04,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:04,291 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:06,040 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:06,040 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:06,040 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:06,045 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:26:06,443 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-06-22 01:26:06,443 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:06,624 INFO ]: Computing forward predicates... [2018-06-22 01:26:06,728 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:06,750 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:06,750 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-06-22 01:26:06,750 INFO ]: Interpolant automaton has 39 states [2018-06-22 01:26:06,750 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 01:26:06,750 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:26:06,750 INFO ]: Start difference. First operand 44 states and 44 transitions. Second operand 39 states. [2018-06-22 01:26:07,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:07,710 INFO ]: Finished difference Result 45 states and 45 transitions. [2018-06-22 01:26:07,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:26:07,710 INFO ]: Start accepts. Automaton has 39 states. Word has length 43 [2018-06-22 01:26:07,711 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:07,711 INFO ]: With dead ends: 45 [2018-06-22 01:26:07,711 INFO ]: Without dead ends: 45 [2018-06-22 01:26:07,711 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:26:07,711 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:26:07,712 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-22 01:26:07,712 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:26:07,712 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-06-22 01:26:07,712 INFO ]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-06-22 01:26:07,713 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:07,713 INFO ]: Abstraction has 45 states and 45 transitions. [2018-06-22 01:26:07,713 INFO ]: Interpolant automaton has 39 states. [2018-06-22 01:26:07,713 INFO ]: Start isEmpty. Operand 45 states and 45 transitions. [2018-06-22 01:26:07,713 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:26:07,713 INFO ]: Found error trace [2018-06-22 01:26:07,713 INFO ]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:07,713 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:07,713 INFO ]: Analyzing trace with hash 1982369817, now seen corresponding path program 36 times [2018-06-22 01:26:07,713 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:07,713 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:07,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:07,714 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:07,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:07,754 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:09,069 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:09,069 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:09,069 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:09,079 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:26:09,250 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-06-22 01:26:09,250 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:09,271 INFO ]: Computing forward predicates... [2018-06-22 01:26:09,484 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:09,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:09,514 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-06-22 01:26:09,515 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:26:09,515 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:26:09,515 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:26:09,515 INFO ]: Start difference. First operand 45 states and 45 transitions. Second operand 40 states. Received shutdown request... [2018-06-22 01:26:09,927 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:26:09,928 WARN ]: Verification canceled [2018-06-22 01:26:09,932 WARN ]: Timeout [2018-06-22 01:26:09,932 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:26:09 BoogieIcfgContainer [2018-06-22 01:26:09,932 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:26:09,933 INFO ]: Toolchain (without parser) took 57742.29 ms. Allocated memory was 307.8 MB in the beginning and 656.9 MB in the end (delta: 349.2 MB). Free memory was 264.3 MB in the beginning and 382.1 MB in the end (delta: -117.9 MB). Peak memory consumption was 231.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:26:09,934 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:26:09,934 INFO ]: ChcToBoogie took 58.02 ms. Allocated memory is still 307.8 MB. Free memory was 263.3 MB in the beginning and 261.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:26:09,935 INFO ]: Boogie Preprocessor took 34.73 ms. Allocated memory is still 307.8 MB. Free memory was 261.3 MB in the beginning and 260.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:26:09,935 INFO ]: RCFGBuilder took 248.50 ms. Allocated memory is still 307.8 MB. Free memory was 260.2 MB in the beginning and 251.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:26:09,935 INFO ]: TraceAbstraction took 57381.14 ms. Allocated memory was 307.8 MB in the beginning and 656.9 MB in the end (delta: 349.2 MB). Free memory was 251.2 MB in the beginning and 382.1 MB in the end (delta: -131.0 MB). Peak memory consumption was 218.2 MB. Max. memory is 3.6 GB. [2018-06-22 01:26:09,938 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.02 ms. Allocated memory is still 307.8 MB. Free memory was 263.3 MB in the beginning and 261.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.73 ms. Allocated memory is still 307.8 MB. Free memory was 261.3 MB in the beginning and 260.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 248.50 ms. Allocated memory is still 307.8 MB. Free memory was 260.2 MB in the beginning and 251.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57381.14 ms. Allocated memory was 307.8 MB in the beginning and 656.9 MB in the end (delta: 349.2 MB). Free memory was 251.2 MB in the beginning and 382.1 MB in the end (delta: -131.0 MB). Peak memory consumption was 218.2 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 constructing difference of abstraction (45states) and interpolant automaton (currently 10 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (10 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 57.2s OverallTime, 40 OverallIterations, 36 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 278 SDtfs, 2 SDslu, 3621 SDs, 0 SdLazy, 19349 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1767 GetRequests, 945 SyntacticMatches, 71 SemanticMatches, 751 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 28.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=39, 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, 39 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 32.8s InterpolantComputationTime, 1965 NumberOfCodeBlocks, 1965 NumberOfCodeBlocksAsserted, 275 NumberOfCheckSat, 1886 ConstructedInterpolants, 0 QuantifiedInterpolants, 1376229 SizeOfPredicates, 151 NumberOfNonLiveVariables, 24776 ConjunctsInSsa, 8823 ConjunctsInUnsatCore, 79 InterpolantComputations, 2 PerfectInterpolantSequences, 5/18286 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/010-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-26-09-950.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/010-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-26-09-950.csv Completed graceful shutdown