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/012b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:27:14,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:27:14,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:27:14,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:27:14,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:27:14,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:27:14,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:27:14,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:27:14,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:27:14,131 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:27:14,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:27:14,134 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:27:14,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:27:14,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:27:14,136 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:27:14,137 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:27:14,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:27:14,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:27:14,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:27:14,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:27:14,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:27:14,154 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:27:14,154 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:27:14,155 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:27:14,159 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:27:14,160 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:27:14,160 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:27:14,161 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:27:14,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:27:14,162 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:27:14,162 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:27:14,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:27:14,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:27:14,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:27:14,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:27:14,167 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:27:14,181 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:27:14,181 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:27:14,181 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:27:14,181 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:27:14,182 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:27:14,183 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:27:14,183 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:27:14,183 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:27:14,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:27:14,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:27:14,184 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:27:14,184 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:27:14,184 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:27:14,184 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:27:14,184 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:27:14,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:27:14,185 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:27:14,186 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:27:14,186 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:27:14,232 INFO ]: Repository-Root is: /tmp [2018-06-22 01:27:14,247 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:27:14,253 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:27:14,254 INFO ]: Initializing SmtParser... [2018-06-22 01:27:14,254 INFO ]: SmtParser initialized [2018-06-22 01:27:14,256 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/012b-horn.smt2 [2018-06-22 01:27:14,257 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:27:14,345 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/012b-horn.smt2 unknown [2018-06-22 01:27:14,554 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/012b-horn.smt2 [2018-06-22 01:27:14,559 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:27:14,566 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:27:14,566 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:27:14,567 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:27:14,567 INFO ]: ChcToBoogie initialized [2018-06-22 01:27:14,570 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:27:14" (1/1) ... [2018-06-22 01:27:14,622 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:27:14 Unit [2018-06-22 01:27:14,622 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:27:14,623 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:27:14,623 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:27:14,623 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:27:14,643 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:27:14" (1/1) ... [2018-06-22 01:27:14,643 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:27:14" (1/1) ... [2018-06-22 01:27:14,648 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:27:14" (1/1) ... [2018-06-22 01:27:14,649 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:27:14" (1/1) ... [2018-06-22 01:27:14,652 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:27:14" (1/1) ... [2018-06-22 01:27:14,654 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:27:14" (1/1) ... [2018-06-22 01:27:14,655 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:27:14" (1/1) ... [2018-06-22 01:27:14,656 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:27:14,657 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:27:14,657 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:27:14,657 INFO ]: RCFGBuilder initialized [2018-06-22 01:27:14,658 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:27:14" (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:27:14,675 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:27:14,675 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:27:14,675 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:27:14,676 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:27:14,676 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:27:14,676 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:27:14,899 INFO ]: Using library mode [2018-06-22 01:27:14,899 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:27:14 BoogieIcfgContainer [2018-06-22 01:27:14,899 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:27:14,910 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:27:14,910 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:27:14,913 INFO ]: TraceAbstraction initialized [2018-06-22 01:27:14,913 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:27:14" (1/3) ... [2018-06-22 01:27:14,914 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3996a95a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:27:14, skipping insertion in model container [2018-06-22 01:27:14,914 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:27:14" (2/3) ... [2018-06-22 01:27:14,915 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3996a95a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:27:14, skipping insertion in model container [2018-06-22 01:27:14,915 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:27:14" (3/3) ... [2018-06-22 01:27:14,917 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:27:14,936 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:27:14,944 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:27:15,011 INFO ]: Using default assertion order modulation [2018-06-22 01:27:15,011 INFO ]: Interprodecural is true [2018-06-22 01:27:15,011 INFO ]: Hoare is false [2018-06-22 01:27:15,011 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:27:15,011 INFO ]: Backedges is TWOTRACK [2018-06-22 01:27:15,011 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:27:15,011 INFO ]: Difference is false [2018-06-22 01:27:15,011 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:27:15,011 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:27:15,033 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:27:15,043 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:27:15,043 INFO ]: Found error trace [2018-06-22 01:27:15,044 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:27:15,044 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:15,049 INFO ]: Analyzing trace with hash 2118833424, now seen corresponding path program 1 times [2018-06-22 01:27:15,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:15,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:15,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:15,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:15,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:15,111 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:15,143 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:27:15,147 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:27:15,147 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:27:15,149 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:27:15,159 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:27:15,160 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:27:15,161 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-22 01:27:15,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:15,181 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-22 01:27:15,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:27:15,182 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:27:15,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:15,189 INFO ]: With dead ends: 10 [2018-06-22 01:27:15,189 INFO ]: Without dead ends: 10 [2018-06-22 01:27:15,191 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:27:15,204 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:27:15,218 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:27:15,219 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:27:15,219 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-22 01:27:15,221 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 6 [2018-06-22 01:27:15,221 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:15,221 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-22 01:27:15,221 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:27:15,221 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-22 01:27:15,221 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:27:15,221 INFO ]: Found error trace [2018-06-22 01:27:15,221 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:15,221 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:15,222 INFO ]: Analyzing trace with hash 1261734173, now seen corresponding path program 1 times [2018-06-22 01:27:15,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:15,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:15,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:15,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:15,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:15,244 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:15,422 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 01:27:15,423 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:27:15,423 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:27:15,423 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:27:15,425 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:27:15,425 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:27:15,425 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:27:15,426 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 3 states. [2018-06-22 01:27:15,472 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:15,472 INFO ]: Finished difference Result 14 states and 21 transitions. [2018-06-22 01:27:15,476 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:27:15,476 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:27:15,476 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:15,479 INFO ]: With dead ends: 14 [2018-06-22 01:27:15,479 INFO ]: Without dead ends: 14 [2018-06-22 01:27:15,480 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:27:15,480 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:27:15,482 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:27:15,482 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:27:15,483 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-22 01:27:15,483 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 7 [2018-06-22 01:27:15,483 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:15,483 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-22 01:27:15,483 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:27:15,483 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-22 01:27:15,483 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:27:15,483 INFO ]: Found error trace [2018-06-22 01:27:15,483 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:15,483 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:15,484 INFO ]: Analyzing trace with hash 454996521, now seen corresponding path program 1 times [2018-06-22 01:27:15,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:15,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:15,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:15,484 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:15,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:15,499 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:15,567 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:27:15,568 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:15,568 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:27:15,575 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:15,598 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:15,606 INFO ]: Computing forward predicates... [2018-06-22 01:27:15,627 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:27:15,651 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:15,651 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:27:15,651 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:27:15,651 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:27:15,651 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:27:15,651 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 4 states. [2018-06-22 01:27:15,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:15,732 INFO ]: Finished difference Result 10 states and 12 transitions. [2018-06-22 01:27:15,733 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:27:15,733 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:27:15,733 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:15,733 INFO ]: With dead ends: 10 [2018-06-22 01:27:15,733 INFO ]: Without dead ends: 10 [2018-06-22 01:27:15,733 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:27:15,734 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:27:15,735 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-22 01:27:15,735 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:27:15,736 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-06-22 01:27:15,736 INFO ]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2018-06-22 01:27:15,736 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:15,736 INFO ]: Abstraction has 9 states and 10 transitions. [2018-06-22 01:27:15,736 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:27:15,736 INFO ]: Start isEmpty. Operand 9 states and 10 transitions. [2018-06-22 01:27:15,736 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:27:15,736 INFO ]: Found error trace [2018-06-22 01:27:15,736 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:15,737 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:15,737 INFO ]: Analyzing trace with hash 463099673, now seen corresponding path program 1 times [2018-06-22 01:27:15,737 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:15,737 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:15,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:15,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:15,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:15,754 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:15,848 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:27:15,849 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:27:15,849 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:27:15,849 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:27:15,849 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:27:15,849 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:27:15,849 INFO ]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2018-06-22 01:27:15,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:15,970 INFO ]: Finished difference Result 14 states and 17 transitions. [2018-06-22 01:27:15,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:27:15,971 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:27:15,971 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:15,971 INFO ]: With dead ends: 14 [2018-06-22 01:27:15,971 INFO ]: Without dead ends: 14 [2018-06-22 01:27:15,972 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:27:15,972 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:27:15,974 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:27:15,974 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:27:15,974 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-22 01:27:15,974 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-06-22 01:27:15,974 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:15,974 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-22 01:27:15,974 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:27:15,974 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-22 01:27:15,977 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:27:15,977 INFO ]: Found error trace [2018-06-22 01:27:15,977 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:15,977 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:15,978 INFO ]: Analyzing trace with hash 1224036237, now seen corresponding path program 1 times [2018-06-22 01:27:15,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:15,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:15,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:15,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:15,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:16,006 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:16,262 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:27:16,262 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:16,262 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:27:16,281 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:16,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:16,321 INFO ]: Computing forward predicates... [2018-06-22 01:27:16,560 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-22 01:27:16,664 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:27:16,684 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:16,684 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:27:16,684 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:27:16,684 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:27:16,684 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:27:16,686 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 8 states. [2018-06-22 01:27:16,818 WARN ]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:27:17,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:17,238 INFO ]: Finished difference Result 21 states and 26 transitions. [2018-06-22 01:27:17,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:27:17,239 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 01:27:17,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:17,240 INFO ]: With dead ends: 21 [2018-06-22 01:27:17,240 INFO ]: Without dead ends: 21 [2018-06-22 01:27:17,240 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:27:17,240 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:27:17,242 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-06-22 01:27:17,242 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:27:17,243 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-06-22 01:27:17,243 INFO ]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 9 [2018-06-22 01:27:17,243 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:17,243 INFO ]: Abstraction has 13 states and 16 transitions. [2018-06-22 01:27:17,243 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:27:17,243 INFO ]: Start isEmpty. Operand 13 states and 16 transitions. [2018-06-22 01:27:17,243 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:27:17,243 INFO ]: Found error trace [2018-06-22 01:27:17,243 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:17,243 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:17,244 INFO ]: Analyzing trace with hash -956734055, now seen corresponding path program 2 times [2018-06-22 01:27:17,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:17,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:17,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:17,245 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:17,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:17,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:17,327 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:17,327 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:17,327 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:27:17,337 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:27:17,385 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:27:17,385 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:17,387 INFO ]: Computing forward predicates... [2018-06-22 01:27:17,409 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:17,443 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:17,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:27:17,443 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:27:17,443 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:27:17,444 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:27:17,444 INFO ]: Start difference. First operand 13 states and 16 transitions. Second operand 6 states. [2018-06-22 01:27:17,748 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:17,748 INFO ]: Finished difference Result 22 states and 27 transitions. [2018-06-22 01:27:17,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:27:17,748 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-22 01:27:17,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:17,749 INFO ]: With dead ends: 22 [2018-06-22 01:27:17,749 INFO ]: Without dead ends: 22 [2018-06-22 01:27:17,749 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:27:17,749 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:27:17,751 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 13. [2018-06-22 01:27:17,751 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:27:17,752 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-06-22 01:27:17,752 INFO ]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2018-06-22 01:27:17,752 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:17,752 INFO ]: Abstraction has 13 states and 16 transitions. [2018-06-22 01:27:17,752 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:27:17,752 INFO ]: Start isEmpty. Operand 13 states and 16 transitions. [2018-06-22 01:27:17,752 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:27:17,752 INFO ]: Found error trace [2018-06-22 01:27:17,752 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:17,752 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:17,752 INFO ]: Analyzing trace with hash -1715210567, now seen corresponding path program 1 times [2018-06-22 01:27:17,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:17,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:17,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:17,753 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:17,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:17,763 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:17,990 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:27:17,990 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:27:17,990 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:27:17,990 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:27:17,990 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:27:17,990 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:27:17,991 INFO ]: Start difference. First operand 13 states and 16 transitions. Second operand 5 states. [2018-06-22 01:27:18,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:18,112 INFO ]: Finished difference Result 14 states and 16 transitions. [2018-06-22 01:27:18,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:27:18,114 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:27:18,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:18,114 INFO ]: With dead ends: 14 [2018-06-22 01:27:18,114 INFO ]: Without dead ends: 13 [2018-06-22 01:27:18,115 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:27:18,115 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:27:18,116 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:27:18,116 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:27:18,116 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-22 01:27:18,116 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2018-06-22 01:27:18,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:18,116 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-22 01:27:18,116 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:27:18,116 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-22 01:27:18,117 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:27:18,117 INFO ]: Found error trace [2018-06-22 01:27:18,117 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:18,117 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:18,117 INFO ]: Analyzing trace with hash 403596694, now seen corresponding path program 1 times [2018-06-22 01:27:18,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:18,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:18,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:18,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:18,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:18,135 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:18,305 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:18,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:18,305 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:27:18,312 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:18,335 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:18,338 INFO ]: Computing forward predicates... [2018-06-22 01:27:18,624 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:18,646 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:18,646 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 01:27:18,646 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:27:18,646 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:27:18,646 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:27:18,647 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 12 states. [2018-06-22 01:27:18,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:18,892 INFO ]: Finished difference Result 24 states and 29 transitions. [2018-06-22 01:27:18,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:27:18,892 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-22 01:27:18,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:18,893 INFO ]: With dead ends: 24 [2018-06-22 01:27:18,893 INFO ]: Without dead ends: 24 [2018-06-22 01:27:18,893 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:27:18,893 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:27:18,895 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 15. [2018-06-22 01:27:18,895 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:27:18,896 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-06-22 01:27:18,896 INFO ]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2018-06-22 01:27:18,896 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:18,896 INFO ]: Abstraction has 15 states and 18 transitions. [2018-06-22 01:27:18,896 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:27:18,896 INFO ]: Start isEmpty. Operand 15 states and 18 transitions. [2018-06-22 01:27:18,896 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:27:18,896 INFO ]: Found error trace [2018-06-22 01:27:18,896 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:18,896 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:18,897 INFO ]: Analyzing trace with hash -599612883, now seen corresponding path program 2 times [2018-06-22 01:27:18,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:18,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:18,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:18,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:18,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:18,913 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:19,009 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:19,009 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:19,009 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:27:19,016 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:27:19,035 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:27:19,035 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:19,038 INFO ]: Computing forward predicates... [2018-06-22 01:27:19,047 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:19,077 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:19,077 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:27:19,077 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:27:19,077 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:27:19,077 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:27:19,077 INFO ]: Start difference. First operand 15 states and 18 transitions. Second operand 6 states. [2018-06-22 01:27:19,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:19,117 INFO ]: Finished difference Result 17 states and 19 transitions. [2018-06-22 01:27:19,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:27:19,118 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-22 01:27:19,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:19,118 INFO ]: With dead ends: 17 [2018-06-22 01:27:19,118 INFO ]: Without dead ends: 15 [2018-06-22 01:27:19,119 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:27:19,119 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:27:19,120 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:27:19,120 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:27:19,120 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-22 01:27:19,120 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2018-06-22 01:27:19,120 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:19,120 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-22 01:27:19,120 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:27:19,120 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-22 01:27:19,120 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:27:19,120 INFO ]: Found error trace [2018-06-22 01:27:19,120 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:19,121 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:19,121 INFO ]: Analyzing trace with hash 627386530, now seen corresponding path program 3 times [2018-06-22 01:27:19,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:19,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:19,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:19,123 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:19,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:19,133 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:19,210 INFO ]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:19,210 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:19,210 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:27:19,216 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:27:19,231 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:27:19,231 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:19,233 INFO ]: Computing forward predicates... [2018-06-22 01:27:19,244 INFO ]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:19,265 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:19,265 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:27:19,265 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:27:19,265 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:27:19,265 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:27:19,265 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 8 states. [2018-06-22 01:27:19,339 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:19,339 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-22 01:27:19,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:27:19,339 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-22 01:27:19,339 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:19,339 INFO ]: With dead ends: 20 [2018-06-22 01:27:19,339 INFO ]: Without dead ends: 20 [2018-06-22 01:27:19,340 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:27:19,340 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:27:19,341 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-22 01:27:19,341 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:27:19,342 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-22 01:27:19,342 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-06-22 01:27:19,342 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:19,342 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-22 01:27:19,342 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:27:19,342 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-22 01:27:19,342 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:27:19,342 INFO ]: Found error trace [2018-06-22 01:27:19,342 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:19,342 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:19,342 INFO ]: Analyzing trace with hash -2028272723, now seen corresponding path program 4 times [2018-06-22 01:27:19,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:19,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:19,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:19,343 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:19,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:19,361 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:19,668 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:19,669 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:19,669 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:27:19,690 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:27:19,706 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:27:19,706 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:19,709 INFO ]: Computing forward predicates... [2018-06-22 01:27:19,869 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:19,894 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:19,894 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 01:27:19,894 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:27:19,894 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:27:19,894 INFO ]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:27:19,894 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 16 states. [2018-06-22 01:27:20,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:20,302 INFO ]: Finished difference Result 28 states and 33 transitions. [2018-06-22 01:27:20,302 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:27:20,302 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-22 01:27:20,302 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:20,302 INFO ]: With dead ends: 28 [2018-06-22 01:27:20,302 INFO ]: Without dead ends: 28 [2018-06-22 01:27:20,303 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:27:20,303 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:27:20,305 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-06-22 01:27:20,305 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:27:20,305 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-06-22 01:27:20,305 INFO ]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2018-06-22 01:27:20,305 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:20,305 INFO ]: Abstraction has 17 states and 20 transitions. [2018-06-22 01:27:20,305 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:27:20,305 INFO ]: Start isEmpty. Operand 17 states and 20 transitions. [2018-06-22 01:27:20,306 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:27:20,306 INFO ]: Found error trace [2018-06-22 01:27:20,306 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:20,306 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:20,306 INFO ]: Analyzing trace with hash 1231968758, now seen corresponding path program 5 times [2018-06-22 01:27:20,306 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:20,306 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:20,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:20,307 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:20,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:20,316 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:20,494 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:20,494 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:20,494 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:27:20,500 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:27:20,545 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:27:20,545 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:20,547 INFO ]: Computing forward predicates... [2018-06-22 01:27:20,556 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:20,586 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:20,586 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:27:20,587 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:27:20,587 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:27:20,587 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:27:20,587 INFO ]: Start difference. First operand 17 states and 20 transitions. Second operand 8 states. [2018-06-22 01:27:20,910 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:20,910 INFO ]: Finished difference Result 20 states and 22 transitions. [2018-06-22 01:27:20,910 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:27:20,910 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 01:27:20,910 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:20,911 INFO ]: With dead ends: 20 [2018-06-22 01:27:20,911 INFO ]: Without dead ends: 17 [2018-06-22 01:27:20,911 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:27:20,911 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:27:20,912 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 01:27:20,912 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:27:20,913 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-22 01:27:20,913 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2018-06-22 01:27:20,913 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:20,913 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-22 01:27:20,913 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:27:20,913 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-22 01:27:20,913 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:27:20,913 INFO ]: Found error trace [2018-06-22 01:27:20,913 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:20,913 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:20,913 INFO ]: Analyzing trace with hash -1714605127, now seen corresponding path program 6 times [2018-06-22 01:27:20,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:20,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:20,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:20,914 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:20,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:20,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:21,098 INFO ]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:21,099 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:21,116 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:27:21,122 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:27:21,139 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 01:27:21,139 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:21,141 INFO ]: Computing forward predicates... [2018-06-22 01:27:21,154 INFO ]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:21,185 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:21,185 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 01:27:21,185 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:27:21,185 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:27:21,186 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:27:21,186 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 10 states. [2018-06-22 01:27:21,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:21,254 INFO ]: Finished difference Result 23 states and 26 transitions. [2018-06-22 01:27:21,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:27:21,255 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-22 01:27:21,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:21,255 INFO ]: With dead ends: 23 [2018-06-22 01:27:21,255 INFO ]: Without dead ends: 23 [2018-06-22 01:27:21,256 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:27:21,256 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:27:21,258 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-22 01:27:21,258 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:27:21,259 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-22 01:27:21,259 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2018-06-22 01:27:21,259 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:21,259 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-22 01:27:21,259 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:27:21,259 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-22 01:27:21,259 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:27:21,259 INFO ]: Found error trace [2018-06-22 01:27:21,259 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:21,259 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:21,260 INFO ]: Analyzing trace with hash -1615570058, now seen corresponding path program 7 times [2018-06-22 01:27:21,260 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:21,260 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:21,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:21,260 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:21,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:21,278 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:21,452 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:21,452 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:21,452 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:27:21,459 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:21,492 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:21,495 INFO ]: Computing forward predicates... [2018-06-22 01:27:21,747 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:21,766 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:21,766 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-22 01:27:21,766 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:27:21,767 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:27:21,767 INFO ]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:27:21,767 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 20 states. [2018-06-22 01:27:22,184 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:22,184 INFO ]: Finished difference Result 32 states and 37 transitions. [2018-06-22 01:27:22,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:27:22,184 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-22 01:27:22,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:22,185 INFO ]: With dead ends: 32 [2018-06-22 01:27:22,185 INFO ]: Without dead ends: 32 [2018-06-22 01:27:22,186 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:27:22,186 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:27:22,187 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-06-22 01:27:22,187 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:27:22,187 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-06-22 01:27:22,187 INFO ]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 15 [2018-06-22 01:27:22,187 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:22,187 INFO ]: Abstraction has 19 states and 22 transitions. [2018-06-22 01:27:22,187 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:27:22,188 INFO ]: Start isEmpty. Operand 19 states and 22 transitions. [2018-06-22 01:27:22,188 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:27:22,188 INFO ]: Found error trace [2018-06-22 01:27:22,188 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:22,188 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:22,188 INFO ]: Analyzing trace with hash 667668045, now seen corresponding path program 8 times [2018-06-22 01:27:22,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:22,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:22,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:22,189 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:22,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:22,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:22,295 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:22,295 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:22,295 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:27:22,301 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:27:22,317 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:27:22,317 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:22,320 INFO ]: Computing forward predicates... [2018-06-22 01:27:22,329 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:22,354 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:22,354 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 01:27:22,354 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:27:22,354 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:27:22,354 INFO ]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:27:22,354 INFO ]: Start difference. First operand 19 states and 22 transitions. Second operand 10 states. [2018-06-22 01:27:22,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:22,420 INFO ]: Finished difference Result 23 states and 25 transitions. [2018-06-22 01:27:22,420 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:27:22,420 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-22 01:27:22,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:22,420 INFO ]: With dead ends: 23 [2018-06-22 01:27:22,420 INFO ]: Without dead ends: 19 [2018-06-22 01:27:22,420 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:27:22,420 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:27:22,422 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:27:22,422 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:27:22,422 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-06-22 01:27:22,422 INFO ]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-06-22 01:27:22,422 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:22,422 INFO ]: Abstraction has 19 states and 21 transitions. [2018-06-22 01:27:22,422 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:27:22,422 INFO ]: Start isEmpty. Operand 19 states and 21 transitions. [2018-06-22 01:27:22,423 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:27:22,423 INFO ]: Found error trace [2018-06-22 01:27:22,423 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:22,423 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:22,423 INFO ]: Analyzing trace with hash -828721022, now seen corresponding path program 9 times [2018-06-22 01:27:22,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:22,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:22,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:22,423 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:22,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:22,434 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:22,665 INFO ]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:22,665 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:22,665 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:27:22,671 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:27:22,741 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:27:22,741 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:22,744 INFO ]: Computing forward predicates... [2018-06-22 01:27:22,756 INFO ]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:22,779 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:22,779 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 01:27:22,779 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:27:22,780 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:27:22,780 INFO ]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:27:22,780 INFO ]: Start difference. First operand 19 states and 21 transitions. Second operand 12 states. [2018-06-22 01:27:22,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:22,886 INFO ]: Finished difference Result 26 states and 29 transitions. [2018-06-22 01:27:22,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:27:22,887 INFO ]: Start accepts. Automaton has 12 states. Word has length 16 [2018-06-22 01:27:22,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:22,887 INFO ]: With dead ends: 26 [2018-06-22 01:27:22,887 INFO ]: Without dead ends: 26 [2018-06-22 01:27:22,892 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:27:22,892 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:27:22,893 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-06-22 01:27:22,893 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:27:22,893 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-06-22 01:27:22,893 INFO ]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-06-22 01:27:22,893 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:22,894 INFO ]: Abstraction has 19 states and 21 transitions. [2018-06-22 01:27:22,894 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:27:22,894 INFO ]: Start isEmpty. Operand 19 states and 21 transitions. [2018-06-22 01:27:22,894 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:27:22,894 INFO ]: Found error trace [2018-06-22 01:27:22,894 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:22,894 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:22,894 INFO ]: Analyzing trace with hash 77033421, now seen corresponding path program 10 times [2018-06-22 01:27:22,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:22,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:22,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:22,895 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:22,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:22,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:23,206 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:23,206 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:23,206 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:27:23,214 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:27:23,232 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:27:23,232 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:23,236 INFO ]: Computing forward predicates... [2018-06-22 01:27:23,453 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:23,471 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:23,471 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-22 01:27:23,471 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:27:23,472 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:27:23,472 INFO ]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:27:23,472 INFO ]: Start difference. First operand 19 states and 21 transitions. Second operand 24 states. [2018-06-22 01:27:24,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:24,137 INFO ]: Finished difference Result 36 states and 41 transitions. [2018-06-22 01:27:24,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:27:24,137 INFO ]: Start accepts. Automaton has 24 states. Word has length 17 [2018-06-22 01:27:24,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:24,137 INFO ]: With dead ends: 36 [2018-06-22 01:27:24,137 INFO ]: Without dead ends: 36 [2018-06-22 01:27:24,138 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:27:24,138 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:27:24,139 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 21. [2018-06-22 01:27:24,139 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:27:24,139 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-06-22 01:27:24,139 INFO ]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2018-06-22 01:27:24,139 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:24,139 INFO ]: Abstraction has 21 states and 24 transitions. [2018-06-22 01:27:24,139 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:27:24,139 INFO ]: Start isEmpty. Operand 21 states and 24 transitions. [2018-06-22 01:27:24,140 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:27:24,140 INFO ]: Found error trace [2018-06-22 01:27:24,140 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:24,140 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:24,141 INFO ]: Analyzing trace with hash 2137937878, now seen corresponding path program 11 times [2018-06-22 01:27:24,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:24,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:24,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:24,141 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:24,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:24,156 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:24,309 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:24,309 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:24,309 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:27:24,315 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:27:24,334 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:27:24,334 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:24,336 INFO ]: Computing forward predicates... [2018-06-22 01:27:24,345 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:24,365 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:24,366 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 01:27:24,366 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:27:24,366 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:27:24,366 INFO ]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:27:24,366 INFO ]: Start difference. First operand 21 states and 24 transitions. Second operand 12 states. [2018-06-22 01:27:24,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:24,420 INFO ]: Finished difference Result 26 states and 28 transitions. [2018-06-22 01:27:24,420 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:27:24,420 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 01:27:24,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:24,420 INFO ]: With dead ends: 26 [2018-06-22 01:27:24,420 INFO ]: Without dead ends: 21 [2018-06-22 01:27:24,421 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:27:24,421 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:27:24,422 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 01:27:24,422 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:27:24,422 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-22 01:27:24,423 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2018-06-22 01:27:24,423 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:24,423 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-22 01:27:24,423 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:27:24,423 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-22 01:27:24,423 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:27:24,423 INFO ]: Found error trace [2018-06-22 01:27:24,423 INFO ]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:24,423 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:24,423 INFO ]: Analyzing trace with hash 324712921, now seen corresponding path program 12 times [2018-06-22 01:27:24,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:24,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:24,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:24,426 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:24,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:24,437 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:24,697 INFO ]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:24,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:24,697 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:27:24,704 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:27:24,731 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:27:24,731 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:24,733 INFO ]: Computing forward predicates... [2018-06-22 01:27:24,745 INFO ]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:24,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:24,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-22 01:27:24,769 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:27:24,770 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:27:24,770 INFO ]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:27:24,770 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 14 states. [2018-06-22 01:27:24,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:24,879 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-22 01:27:24,880 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:27:24,880 INFO ]: Start accepts. Automaton has 14 states. Word has length 18 [2018-06-22 01:27:24,880 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:24,880 INFO ]: With dead ends: 29 [2018-06-22 01:27:24,880 INFO ]: Without dead ends: 29 [2018-06-22 01:27:24,881 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:27:24,881 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:27:24,882 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-22 01:27:24,882 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:27:24,883 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-22 01:27:24,883 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-06-22 01:27:24,883 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:24,883 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-22 01:27:24,883 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:27:24,883 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-22 01:27:24,883 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:27:24,883 INFO ]: Found error trace [2018-06-22 01:27:24,883 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:24,883 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:24,883 INFO ]: Analyzing trace with hash 1473747286, now seen corresponding path program 13 times [2018-06-22 01:27:24,883 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:24,883 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:24,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:24,884 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:24,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:24,901 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:25,140 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:27:25,140 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:25,140 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:27:25,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:25,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:25,191 INFO ]: Computing forward predicates... [2018-06-22 01:27:25,926 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:27:25,958 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:25,958 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-06-22 01:27:25,958 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:27:25,958 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:27:25,958 INFO ]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:27:25,958 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 28 states. [2018-06-22 01:27:26,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:26,517 INFO ]: Finished difference Result 40 states and 45 transitions. [2018-06-22 01:27:26,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:27:26,517 INFO ]: Start accepts. Automaton has 28 states. Word has length 19 [2018-06-22 01:27:26,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:26,517 INFO ]: With dead ends: 40 [2018-06-22 01:27:26,518 INFO ]: Without dead ends: 40 [2018-06-22 01:27:26,518 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=186, Invalid=1706, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:27:26,518 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 01:27:26,520 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 23. [2018-06-22 01:27:26,520 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:27:26,520 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-06-22 01:27:26,521 INFO ]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2018-06-22 01:27:26,521 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:26,521 INFO ]: Abstraction has 23 states and 26 transitions. [2018-06-22 01:27:26,521 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:27:26,521 INFO ]: Start isEmpty. Operand 23 states and 26 transitions. [2018-06-22 01:27:26,521 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:27:26,521 INFO ]: Found error trace [2018-06-22 01:27:26,521 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:26,521 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:26,521 INFO ]: Analyzing trace with hash 937276013, now seen corresponding path program 14 times [2018-06-22 01:27:26,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:26,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:26,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:26,522 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:26,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:26,531 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:26,725 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:26,725 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:26,725 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:27:26,731 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:27:26,751 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:27:26,751 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:26,753 INFO ]: Computing forward predicates... [2018-06-22 01:27:26,764 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:26,793 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:26,793 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-22 01:27:26,793 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:27:26,793 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:27:26,794 INFO ]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:27:26,794 INFO ]: Start difference. First operand 23 states and 26 transitions. Second operand 14 states. [2018-06-22 01:27:26,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:26,886 INFO ]: Finished difference Result 29 states and 31 transitions. [2018-06-22 01:27:26,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:27:26,887 INFO ]: Start accepts. Automaton has 14 states. Word has length 19 [2018-06-22 01:27:26,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:26,887 INFO ]: With dead ends: 29 [2018-06-22 01:27:26,887 INFO ]: Without dead ends: 23 [2018-06-22 01:27:26,887 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:27:26,887 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:27:26,889 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 01:27:26,889 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:27:26,889 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-22 01:27:26,889 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2018-06-22 01:27:26,889 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:26,889 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-22 01:27:26,889 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:27:26,889 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-22 01:27:26,889 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:27:26,889 INFO ]: Found error trace [2018-06-22 01:27:26,890 INFO ]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:26,890 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:26,890 INFO ]: Analyzing trace with hash -1024421790, now seen corresponding path program 15 times [2018-06-22 01:27:26,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:26,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:26,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:26,890 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:26,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:26,903 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:27,308 INFO ]: Checked inductivity of 43 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:27,308 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:27,308 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:27:27,316 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:27:27,340 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:27:27,340 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:27,343 INFO ]: Computing forward predicates... [2018-06-22 01:27:27,357 INFO ]: Checked inductivity of 43 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:27,375 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:27,375 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-22 01:27:27,376 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:27:27,376 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:27:27,376 INFO ]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:27:27,376 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 16 states. [2018-06-22 01:27:27,535 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:27,535 INFO ]: Finished difference Result 32 states and 35 transitions. [2018-06-22 01:27:27,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:27:27,536 INFO ]: Start accepts. Automaton has 16 states. Word has length 20 [2018-06-22 01:27:27,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:27,536 INFO ]: With dead ends: 32 [2018-06-22 01:27:27,536 INFO ]: Without dead ends: 32 [2018-06-22 01:27:27,537 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:27:27,537 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:27:27,538 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 23. [2018-06-22 01:27:27,538 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:27:27,539 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-22 01:27:27,539 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-06-22 01:27:27,539 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:27,539 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-22 01:27:27,539 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:27:27,539 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-22 01:27:27,539 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:27:27,539 INFO ]: Found error trace [2018-06-22 01:27:27,539 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:27,539 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:27,540 INFO ]: Analyzing trace with hash -1694723091, now seen corresponding path program 16 times [2018-06-22 01:27:27,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:27,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:27,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:27,540 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:27,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:27,571 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:28,056 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:28,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:28,056 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:27:28,061 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:27:28,100 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:27:28,100 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:28,107 INFO ]: Computing forward predicates... [2018-06-22 01:27:28,629 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:28,649 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:28,649 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-06-22 01:27:28,650 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:27:28,650 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:27:28,650 INFO ]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:27:28,650 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 32 states. [2018-06-22 01:27:29,493 WARN ]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-06-22 01:27:30,107 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:30,107 INFO ]: Finished difference Result 44 states and 49 transitions. [2018-06-22 01:27:30,107 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:27:30,107 INFO ]: Start accepts. Automaton has 32 states. Word has length 21 [2018-06-22 01:27:30,107 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:30,107 INFO ]: With dead ends: 44 [2018-06-22 01:27:30,107 INFO ]: Without dead ends: 44 [2018-06-22 01:27:30,108 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=214, Invalid=2236, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:27:30,108 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 01:27:30,110 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 25. [2018-06-22 01:27:30,110 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:27:30,110 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-06-22 01:27:30,110 INFO ]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2018-06-22 01:27:30,111 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:30,111 INFO ]: Abstraction has 25 states and 28 transitions. [2018-06-22 01:27:30,111 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:27:30,111 INFO ]: Start isEmpty. Operand 25 states and 28 transitions. [2018-06-22 01:27:30,111 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:27:30,111 INFO ]: Found error trace [2018-06-22 01:27:30,111 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:30,111 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:30,111 INFO ]: Analyzing trace with hash -1145463370, now seen corresponding path program 17 times [2018-06-22 01:27:30,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:30,111 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:30,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:30,112 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:30,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:30,121 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:30,292 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:30,292 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:30,292 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:27:30,297 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:27:30,327 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:27:30,327 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:30,329 INFO ]: Computing forward predicates... [2018-06-22 01:27:30,338 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:30,358 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:30,358 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-22 01:27:30,358 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:27:30,358 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:27:30,358 INFO ]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:27:30,358 INFO ]: Start difference. First operand 25 states and 28 transitions. Second operand 16 states. [2018-06-22 01:27:30,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:30,462 INFO ]: Finished difference Result 32 states and 34 transitions. [2018-06-22 01:27:30,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:27:30,462 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 01:27:30,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:30,462 INFO ]: With dead ends: 32 [2018-06-22 01:27:30,462 INFO ]: Without dead ends: 25 [2018-06-22 01:27:30,462 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:27:30,462 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:27:30,464 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 01:27:30,464 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:27:30,464 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-06-22 01:27:30,464 INFO ]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2018-06-22 01:27:30,464 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:30,464 INFO ]: Abstraction has 25 states and 27 transitions. [2018-06-22 01:27:30,464 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:27:30,464 INFO ]: Start isEmpty. Operand 25 states and 27 transitions. [2018-06-22 01:27:30,465 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:27:30,465 INFO ]: Found error trace [2018-06-22 01:27:30,465 INFO ]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:30,465 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:30,465 INFO ]: Analyzing trace with hash -1548486663, now seen corresponding path program 18 times [2018-06-22 01:27:30,465 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:30,465 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:30,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:30,466 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:30,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:30,477 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:31,464 INFO ]: Checked inductivity of 57 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:31,464 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:31,464 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:27:31,471 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:27:31,504 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:27:31,504 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:31,506 INFO ]: Computing forward predicates... [2018-06-22 01:27:31,519 INFO ]: Checked inductivity of 57 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:31,540 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:31,540 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-22 01:27:31,540 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:27:31,540 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:27:31,540 INFO ]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:27:31,540 INFO ]: Start difference. First operand 25 states and 27 transitions. Second operand 18 states. [2018-06-22 01:27:31,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:31,658 INFO ]: Finished difference Result 35 states and 38 transitions. [2018-06-22 01:27:31,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:27:31,658 INFO ]: Start accepts. Automaton has 18 states. Word has length 22 [2018-06-22 01:27:31,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:31,658 INFO ]: With dead ends: 35 [2018-06-22 01:27:31,658 INFO ]: Without dead ends: 35 [2018-06-22 01:27:31,659 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:27:31,659 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:27:31,660 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 25. [2018-06-22 01:27:31,660 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:27:31,661 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-06-22 01:27:31,661 INFO ]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2018-06-22 01:27:31,661 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:31,661 INFO ]: Abstraction has 25 states and 27 transitions. [2018-06-22 01:27:31,661 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:27:31,661 INFO ]: Start isEmpty. Operand 25 states and 27 transitions. [2018-06-22 01:27:31,661 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:27:31,661 INFO ]: Found error trace [2018-06-22 01:27:31,662 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:31,662 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:31,662 INFO ]: Analyzing trace with hash -760864970, now seen corresponding path program 19 times [2018-06-22 01:27:31,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:31,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:31,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:31,662 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:31,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:31,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:32,380 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:32,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:32,380 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:27:32,399 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:32,427 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:32,432 INFO ]: Computing forward predicates... [2018-06-22 01:27:33,022 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:33,041 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:33,041 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-06-22 01:27:33,041 INFO ]: Interpolant automaton has 36 states [2018-06-22 01:27:33,041 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 01:27:33,042 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:27:33,042 INFO ]: Start difference. First operand 25 states and 27 transitions. Second operand 36 states. [2018-06-22 01:27:34,100 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:34,100 INFO ]: Finished difference Result 48 states and 53 transitions. [2018-06-22 01:27:34,100 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:27:34,100 INFO ]: Start accepts. Automaton has 36 states. Word has length 23 [2018-06-22 01:27:34,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:34,101 INFO ]: With dead ends: 48 [2018-06-22 01:27:34,101 INFO ]: Without dead ends: 48 [2018-06-22 01:27:34,102 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=242, Invalid=2838, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:27:34,102 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:27:34,109 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 27. [2018-06-22 01:27:34,109 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:27:34,109 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-06-22 01:27:34,109 INFO ]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2018-06-22 01:27:34,109 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:34,109 INFO ]: Abstraction has 27 states and 30 transitions. [2018-06-22 01:27:34,109 INFO ]: Interpolant automaton has 36 states. [2018-06-22 01:27:34,110 INFO ]: Start isEmpty. Operand 27 states and 30 transitions. [2018-06-22 01:27:34,110 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:27:34,110 INFO ]: Found error trace [2018-06-22 01:27:34,110 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:34,110 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:34,110 INFO ]: Analyzing trace with hash -913682803, now seen corresponding path program 20 times [2018-06-22 01:27:34,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:34,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:34,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:34,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:34,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:34,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:34,274 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:34,274 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:34,274 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:27:34,283 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:27:34,310 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:27:34,310 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:34,313 INFO ]: Computing forward predicates... [2018-06-22 01:27:34,326 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:34,358 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:34,358 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-22 01:27:34,358 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:27:34,358 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:27:34,358 INFO ]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:27:34,358 INFO ]: Start difference. First operand 27 states and 30 transitions. Second operand 18 states. [2018-06-22 01:27:34,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:34,736 INFO ]: Finished difference Result 35 states and 37 transitions. [2018-06-22 01:27:34,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:27:34,737 INFO ]: Start accepts. Automaton has 18 states. Word has length 23 [2018-06-22 01:27:34,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:34,737 INFO ]: With dead ends: 35 [2018-06-22 01:27:34,737 INFO ]: Without dead ends: 27 [2018-06-22 01:27:34,738 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:27:34,738 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:27:34,739 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 01:27:34,739 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:27:34,740 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-22 01:27:34,740 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2018-06-22 01:27:34,740 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:34,740 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-22 01:27:34,740 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:27:34,740 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-22 01:27:34,740 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:27:34,740 INFO ]: Found error trace [2018-06-22 01:27:34,740 INFO ]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:34,740 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:34,740 INFO ]: Analyzing trace with hash -1961578430, now seen corresponding path program 21 times [2018-06-22 01:27:34,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:34,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:34,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:34,746 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:34,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:34,761 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:34,972 INFO ]: Checked inductivity of 73 backedges. 36 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:34,972 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:34,972 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:27:34,977 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:27:35,008 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:27:35,008 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:35,011 INFO ]: Computing forward predicates... [2018-06-22 01:27:35,021 INFO ]: Checked inductivity of 73 backedges. 36 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:35,041 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:35,041 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-22 01:27:35,041 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:27:35,041 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:27:35,041 INFO ]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:27:35,041 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 20 states. [2018-06-22 01:27:35,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:35,135 INFO ]: Finished difference Result 38 states and 41 transitions. [2018-06-22 01:27:35,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:27:35,135 INFO ]: Start accepts. Automaton has 20 states. Word has length 24 [2018-06-22 01:27:35,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:35,135 INFO ]: With dead ends: 38 [2018-06-22 01:27:35,135 INFO ]: Without dead ends: 38 [2018-06-22 01:27:35,136 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=281, Invalid=531, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:27:35,136 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:27:35,138 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-06-22 01:27:35,138 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:27:35,139 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-22 01:27:35,139 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-06-22 01:27:35,139 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:35,139 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-22 01:27:35,139 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:27:35,139 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-22 01:27:35,140 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:27:35,140 INFO ]: Found error trace [2018-06-22 01:27:35,140 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:35,140 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:35,140 INFO ]: Analyzing trace with hash -681807859, now seen corresponding path program 22 times [2018-06-22 01:27:35,140 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:35,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:35,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:35,140 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:35,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:35,166 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:35,542 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:35,542 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:35,542 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:27:35,547 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:27:35,579 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:27:35,579 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:35,584 INFO ]: Computing forward predicates... [2018-06-22 01:27:36,223 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:36,242 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:36,242 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-06-22 01:27:36,242 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:27:36,242 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:27:36,243 INFO ]: CoverageRelationStatistics Valid=104, Invalid=1456, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:27:36,243 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 40 states. [2018-06-22 01:27:37,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:37,114 INFO ]: Finished difference Result 52 states and 57 transitions. [2018-06-22 01:27:37,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:27:37,114 INFO ]: Start accepts. Automaton has 40 states. Word has length 25 [2018-06-22 01:27:37,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:37,115 INFO ]: With dead ends: 52 [2018-06-22 01:27:37,115 INFO ]: Without dead ends: 52 [2018-06-22 01:27:37,116 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=270, Invalid=3512, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 01:27:37,116 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 01:27:37,118 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 29. [2018-06-22 01:27:37,118 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:27:37,118 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-06-22 01:27:37,118 INFO ]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2018-06-22 01:27:37,118 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:37,118 INFO ]: Abstraction has 29 states and 32 transitions. [2018-06-22 01:27:37,118 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:27:37,118 INFO ]: Start isEmpty. Operand 29 states and 32 transitions. [2018-06-22 01:27:37,119 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:27:37,119 INFO ]: Found error trace [2018-06-22 01:27:37,119 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:37,119 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:37,119 INFO ]: Analyzing trace with hash -1124193386, now seen corresponding path program 23 times [2018-06-22 01:27:37,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:37,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:37,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:37,119 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:37,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:37,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:37,291 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:37,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:37,291 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:27:37,297 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:27:37,328 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:27:37,328 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:37,331 INFO ]: Computing forward predicates... [2018-06-22 01:27:37,341 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:37,360 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:37,360 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-22 01:27:37,360 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:27:37,360 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:27:37,360 INFO ]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:27:37,360 INFO ]: Start difference. First operand 29 states and 32 transitions. Second operand 20 states. [2018-06-22 01:27:37,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:37,822 INFO ]: Finished difference Result 38 states and 40 transitions. [2018-06-22 01:27:37,822 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:27:37,822 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 01:27:37,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:37,823 INFO ]: With dead ends: 38 [2018-06-22 01:27:37,823 INFO ]: Without dead ends: 29 [2018-06-22 01:27:37,823 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:27:37,823 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:27:37,824 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 01:27:37,824 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:27:37,825 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-22 01:27:37,825 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2018-06-22 01:27:37,825 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:37,825 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-22 01:27:37,825 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:27:37,825 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-22 01:27:37,825 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:27:37,825 INFO ]: Found error trace [2018-06-22 01:27:37,825 INFO ]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:37,825 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:37,825 INFO ]: Analyzing trace with hash 778759705, now seen corresponding path program 24 times [2018-06-22 01:27:37,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:37,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:37,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:37,826 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:37,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:37,841 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:38,044 INFO ]: Checked inductivity of 91 backedges. 45 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:38,044 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:38,044 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:27:38,051 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:27:38,087 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:27:38,087 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:38,090 INFO ]: Computing forward predicates... [2018-06-22 01:27:38,099 INFO ]: Checked inductivity of 91 backedges. 45 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:38,119 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:38,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-22 01:27:38,119 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:27:38,119 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:27:38,119 INFO ]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:27:38,119 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 22 states. [2018-06-22 01:27:38,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:38,272 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-22 01:27:38,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:27:38,273 INFO ]: Start accepts. Automaton has 22 states. Word has length 26 [2018-06-22 01:27:38,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:38,274 INFO ]: With dead ends: 41 [2018-06-22 01:27:38,274 INFO ]: Without dead ends: 41 [2018-06-22 01:27:38,274 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=342, Invalid=650, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:27:38,274 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:27:38,275 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-06-22 01:27:38,275 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:27:38,276 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-22 01:27:38,276 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2018-06-22 01:27:38,276 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:38,276 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-22 01:27:38,276 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:27:38,276 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-22 01:27:38,276 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:27:38,276 INFO ]: Found error trace [2018-06-22 01:27:38,276 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:38,276 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:38,276 INFO ]: Analyzing trace with hash -1630671594, now seen corresponding path program 25 times [2018-06-22 01:27:38,276 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:38,277 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:38,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:38,277 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:38,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:38,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:38,741 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:38,741 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:38,741 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:27:38,755 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:38,789 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:38,797 INFO ]: Computing forward predicates... [2018-06-22 01:27:39,814 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:39,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:39,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-06-22 01:27:39,833 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:27:39,833 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:27:39,833 INFO ]: CoverageRelationStatistics Valid=115, Invalid=1777, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:27:39,834 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 44 states. [2018-06-22 01:27:41,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:41,096 INFO ]: Finished difference Result 56 states and 61 transitions. [2018-06-22 01:27:41,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:27:41,096 INFO ]: Start accepts. Automaton has 44 states. Word has length 27 [2018-06-22 01:27:41,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:41,097 INFO ]: With dead ends: 56 [2018-06-22 01:27:41,097 INFO ]: Without dead ends: 56 [2018-06-22 01:27:41,098 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=298, Invalid=4258, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 01:27:41,098 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 01:27:41,099 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 31. [2018-06-22 01:27:41,099 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:27:41,100 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-06-22 01:27:41,100 INFO ]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 27 [2018-06-22 01:27:41,100 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:41,100 INFO ]: Abstraction has 31 states and 34 transitions. [2018-06-22 01:27:41,100 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:27:41,100 INFO ]: Start isEmpty. Operand 31 states and 34 transitions. [2018-06-22 01:27:41,100 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:27:41,100 INFO ]: Found error trace [2018-06-22 01:27:41,100 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:41,100 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:41,100 INFO ]: Analyzing trace with hash 1835246253, now seen corresponding path program 26 times [2018-06-22 01:27:41,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:41,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:41,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:41,101 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:41,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:41,119 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:41,656 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:41,656 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:41,766 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:27:41,772 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:27:41,805 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:27:41,805 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:41,808 INFO ]: Computing forward predicates... [2018-06-22 01:27:41,821 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:41,841 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:41,841 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-22 01:27:41,841 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:27:41,841 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:27:41,841 INFO ]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:27:41,841 INFO ]: Start difference. First operand 31 states and 34 transitions. Second operand 22 states. [2018-06-22 01:27:42,415 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:42,415 INFO ]: Finished difference Result 41 states and 43 transitions. [2018-06-22 01:27:42,415 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:27:42,415 INFO ]: Start accepts. Automaton has 22 states. Word has length 27 [2018-06-22 01:27:42,415 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:42,416 INFO ]: With dead ends: 41 [2018-06-22 01:27:42,416 INFO ]: Without dead ends: 31 [2018-06-22 01:27:42,416 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:27:42,416 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:27:42,418 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 01:27:42,418 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:27:42,418 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-22 01:27:42,418 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2018-06-22 01:27:42,418 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:42,418 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-22 01:27:42,418 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:27:42,418 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-22 01:27:42,418 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:27:42,418 INFO ]: Found error trace [2018-06-22 01:27:42,418 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:42,418 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:42,419 INFO ]: Analyzing trace with hash 1815418914, now seen corresponding path program 27 times [2018-06-22 01:27:42,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:42,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:42,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:42,419 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:42,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:42,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:42,973 INFO ]: Checked inductivity of 111 backedges. 55 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:42,973 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:42,973 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:27:42,979 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:27:43,028 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:27:43,028 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:43,031 INFO ]: Computing forward predicates... [2018-06-22 01:27:43,046 INFO ]: Checked inductivity of 111 backedges. 55 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:43,077 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:43,077 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-22 01:27:43,077 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:27:43,077 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:27:43,077 INFO ]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:27:43,078 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 24 states. [2018-06-22 01:27:43,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:43,689 INFO ]: Finished difference Result 44 states and 47 transitions. [2018-06-22 01:27:43,691 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:27:43,691 INFO ]: Start accepts. Automaton has 24 states. Word has length 28 [2018-06-22 01:27:43,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:43,691 INFO ]: With dead ends: 44 [2018-06-22 01:27:43,691 INFO ]: Without dead ends: 44 [2018-06-22 01:27:43,692 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=409, Invalid=781, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:27:43,692 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 01:27:43,693 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-06-22 01:27:43,693 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:27:43,694 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-22 01:27:43,694 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2018-06-22 01:27:43,694 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:43,694 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-22 01:27:43,694 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:27:43,694 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-22 01:27:43,694 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:27:43,694 INFO ]: Found error trace [2018-06-22 01:27:43,694 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:43,694 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:43,694 INFO ]: Analyzing trace with hash 440992813, now seen corresponding path program 28 times [2018-06-22 01:27:43,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:43,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:43,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:43,695 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:43,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:43,731 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:44,365 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:44,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:44,365 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:27:44,371 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:27:44,414 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:27:44,414 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:44,421 INFO ]: Computing forward predicates... [2018-06-22 01:27:45,168 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:45,187 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:45,187 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-06-22 01:27:45,187 INFO ]: Interpolant automaton has 48 states [2018-06-22 01:27:45,187 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 01:27:45,188 INFO ]: CoverageRelationStatistics Valid=126, Invalid=2130, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:27:45,188 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 48 states. [2018-06-22 01:27:46,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:46,491 INFO ]: Finished difference Result 60 states and 65 transitions. [2018-06-22 01:27:46,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:27:46,491 INFO ]: Start accepts. Automaton has 48 states. Word has length 29 [2018-06-22 01:27:46,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:46,491 INFO ]: With dead ends: 60 [2018-06-22 01:27:46,491 INFO ]: Without dead ends: 60 [2018-06-22 01:27:46,493 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=326, Invalid=5076, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 01:27:46,493 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 01:27:46,494 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 33. [2018-06-22 01:27:46,494 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:27:46,494 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-06-22 01:27:46,494 INFO ]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2018-06-22 01:27:46,494 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:46,494 INFO ]: Abstraction has 33 states and 36 transitions. [2018-06-22 01:27:46,494 INFO ]: Interpolant automaton has 48 states. [2018-06-22 01:27:46,494 INFO ]: Start isEmpty. Operand 33 states and 36 transitions. [2018-06-22 01:27:46,495 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:27:46,495 INFO ]: Found error trace [2018-06-22 01:27:46,495 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:46,495 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:46,495 INFO ]: Analyzing trace with hash 510263670, now seen corresponding path program 29 times [2018-06-22 01:27:46,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:46,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:46,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:46,495 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:46,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:46,509 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:46,758 INFO ]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:46,759 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:46,759 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:27:46,764 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:27:46,814 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:27:46,814 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:46,818 INFO ]: Computing forward predicates... [2018-06-22 01:27:46,827 INFO ]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:46,845 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:46,845 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-22 01:27:46,846 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:27:46,846 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:27:46,846 INFO ]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:27:46,846 INFO ]: Start difference. First operand 33 states and 36 transitions. Second operand 24 states. [2018-06-22 01:27:47,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:47,008 INFO ]: Finished difference Result 44 states and 46 transitions. [2018-06-22 01:27:47,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:27:47,008 INFO ]: Start accepts. Automaton has 24 states. Word has length 29 [2018-06-22 01:27:47,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:47,008 INFO ]: With dead ends: 44 [2018-06-22 01:27:47,008 INFO ]: Without dead ends: 33 [2018-06-22 01:27:47,009 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:27:47,009 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:27:47,009 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 01:27:47,009 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:27:47,009 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-22 01:27:47,009 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2018-06-22 01:27:47,009 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:47,009 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-22 01:27:47,009 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:27:47,010 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-22 01:27:47,010 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:27:47,010 INFO ]: Found error trace [2018-06-22 01:27:47,010 INFO ]: trace histogram [12, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:47,010 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:47,010 INFO ]: Analyzing trace with hash 714185785, now seen corresponding path program 30 times [2018-06-22 01:27:47,010 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:47,010 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:47,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:47,010 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:47,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:47,027 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:47,331 INFO ]: Checked inductivity of 133 backedges. 66 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:47,331 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:47,331 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:27:47,337 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:27:47,377 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:27:47,377 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:47,380 INFO ]: Computing forward predicates... [2018-06-22 01:27:47,390 INFO ]: Checked inductivity of 133 backedges. 66 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:47,424 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:47,424 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-22 01:27:47,424 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:27:47,424 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:27:47,425 INFO ]: CoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:27:47,425 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 26 states. [2018-06-22 01:27:47,647 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:47,647 INFO ]: Finished difference Result 47 states and 50 transitions. [2018-06-22 01:27:47,647 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:27:47,647 INFO ]: Start accepts. Automaton has 26 states. Word has length 30 [2018-06-22 01:27:47,648 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:47,648 INFO ]: With dead ends: 47 [2018-06-22 01:27:47,648 INFO ]: Without dead ends: 47 [2018-06-22 01:27:47,648 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=482, Invalid=924, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:27:47,648 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 01:27:47,649 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 33. [2018-06-22 01:27:47,649 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:27:47,649 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-22 01:27:47,649 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2018-06-22 01:27:47,649 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:47,649 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-22 01:27:47,649 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:27:47,649 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-22 01:27:47,649 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:27:47,649 INFO ]: Found error trace [2018-06-22 01:27:47,649 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:47,649 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:47,650 INFO ]: Analyzing trace with hash 662504182, now seen corresponding path program 31 times [2018-06-22 01:27:47,650 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:47,650 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:47,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:47,650 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:47,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:47,690 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:48,247 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:48,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:48,248 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:27:48,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:48,292 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:48,298 INFO ]: Computing forward predicates... [2018-06-22 01:27:49,203 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:49,222 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:49,222 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2018-06-22 01:27:49,223 INFO ]: Interpolant automaton has 52 states [2018-06-22 01:27:49,223 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 01:27:49,223 INFO ]: CoverageRelationStatistics Valid=137, Invalid=2515, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:27:49,223 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 52 states. [2018-06-22 01:27:50,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:50,828 INFO ]: Finished difference Result 64 states and 69 transitions. [2018-06-22 01:27:50,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 01:27:50,828 INFO ]: Start accepts. Automaton has 52 states. Word has length 31 [2018-06-22 01:27:50,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:50,828 INFO ]: With dead ends: 64 [2018-06-22 01:27:50,828 INFO ]: Without dead ends: 64 [2018-06-22 01:27:50,829 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=354, Invalid=5966, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 01:27:50,829 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 01:27:50,830 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 35. [2018-06-22 01:27:50,830 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:27:50,831 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-06-22 01:27:50,831 INFO ]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 31 [2018-06-22 01:27:50,831 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:50,831 INFO ]: Abstraction has 35 states and 38 transitions. [2018-06-22 01:27:50,831 INFO ]: Interpolant automaton has 52 states. [2018-06-22 01:27:50,831 INFO ]: Start isEmpty. Operand 35 states and 38 transitions. [2018-06-22 01:27:50,831 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:27:50,831 INFO ]: Found error trace [2018-06-22 01:27:50,831 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:50,831 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:50,831 INFO ]: Analyzing trace with hash -1485066547, now seen corresponding path program 32 times [2018-06-22 01:27:50,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:50,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:50,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:50,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:50,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:50,847 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:51,468 INFO ]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:51,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:51,468 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:27:51,475 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:27:51,511 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:27:51,511 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:51,515 INFO ]: Computing forward predicates... [2018-06-22 01:27:51,523 INFO ]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:51,542 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:51,542 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-22 01:27:51,542 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:27:51,542 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:27:51,543 INFO ]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:27:51,543 INFO ]: Start difference. First operand 35 states and 38 transitions. Second operand 26 states. [2018-06-22 01:27:51,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:51,735 INFO ]: Finished difference Result 47 states and 49 transitions. [2018-06-22 01:27:51,755 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:27:51,755 INFO ]: Start accepts. Automaton has 26 states. Word has length 31 [2018-06-22 01:27:51,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:51,756 INFO ]: With dead ends: 47 [2018-06-22 01:27:51,756 INFO ]: Without dead ends: 35 [2018-06-22 01:27:51,756 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:27:51,756 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:27:51,757 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 01:27:51,757 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:27:51,757 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-22 01:27:51,757 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 31 [2018-06-22 01:27:51,757 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:51,757 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-22 01:27:51,757 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:27:51,758 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-22 01:27:51,758 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:27:51,758 INFO ]: Found error trace [2018-06-22 01:27:51,758 INFO ]: trace histogram [13, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:51,758 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:51,758 INFO ]: Analyzing trace with hash 1207945218, now seen corresponding path program 33 times [2018-06-22 01:27:51,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:51,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:51,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:51,759 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:51,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:51,780 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:52,117 INFO ]: Checked inductivity of 157 backedges. 78 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:52,117 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:52,117 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:27:52,123 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:27:52,170 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 01:27:52,170 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:52,174 INFO ]: Computing forward predicates... [2018-06-22 01:27:52,184 INFO ]: Checked inductivity of 157 backedges. 78 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:52,203 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:52,203 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-22 01:27:52,203 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:27:52,203 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:27:52,203 INFO ]: CoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:27:52,203 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 28 states. [2018-06-22 01:27:52,409 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:52,409 INFO ]: Finished difference Result 50 states and 53 transitions. [2018-06-22 01:27:52,409 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:27:52,409 INFO ]: Start accepts. Automaton has 28 states. Word has length 32 [2018-06-22 01:27:52,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:52,409 INFO ]: With dead ends: 50 [2018-06-22 01:27:52,409 INFO ]: Without dead ends: 50 [2018-06-22 01:27:52,409 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=1079, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:27:52,409 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 01:27:52,411 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-06-22 01:27:52,411 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:27:52,411 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-22 01:27:52,411 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2018-06-22 01:27:52,411 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:52,411 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-22 01:27:52,411 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:27:52,411 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-22 01:27:52,411 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:27:52,411 INFO ]: Found error trace [2018-06-22 01:27:52,411 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:52,411 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:52,412 INFO ]: Analyzing trace with hash -1210822579, now seen corresponding path program 34 times [2018-06-22 01:27:52,412 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:52,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:52,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:52,412 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:52,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:52,468 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:53,312 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:53,312 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:53,312 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:27:53,318 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:27:53,363 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:27:53,363 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:53,372 INFO ]: Computing forward predicates... [2018-06-22 01:27:54,379 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:54,398 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:54,398 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2018-06-22 01:27:54,398 INFO ]: Interpolant automaton has 56 states [2018-06-22 01:27:54,398 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-22 01:27:54,398 INFO ]: CoverageRelationStatistics Valid=148, Invalid=2932, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:27:54,398 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 56 states. [2018-06-22 01:27:56,186 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:56,186 INFO ]: Finished difference Result 68 states and 73 transitions. [2018-06-22 01:27:56,186 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-22 01:27:56,186 INFO ]: Start accepts. Automaton has 56 states. Word has length 33 [2018-06-22 01:27:56,186 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:56,186 INFO ]: With dead ends: 68 [2018-06-22 01:27:56,186 INFO ]: Without dead ends: 68 [2018-06-22 01:27:56,187 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=382, Invalid=6928, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 01:27:56,187 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 01:27:56,188 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 37. [2018-06-22 01:27:56,188 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:27:56,189 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-06-22 01:27:56,189 INFO ]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 33 [2018-06-22 01:27:56,189 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:56,189 INFO ]: Abstraction has 37 states and 40 transitions. [2018-06-22 01:27:56,189 INFO ]: Interpolant automaton has 56 states. [2018-06-22 01:27:56,189 INFO ]: Start isEmpty. Operand 37 states and 40 transitions. [2018-06-22 01:27:56,189 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:27:56,189 INFO ]: Found error trace [2018-06-22 01:27:56,189 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:56,189 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:56,189 INFO ]: Analyzing trace with hash 933961558, now seen corresponding path program 35 times [2018-06-22 01:27:56,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:56,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:56,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:56,190 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:56,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:56,207 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:56,709 INFO ]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:56,709 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:56,709 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:27:56,715 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:27:56,756 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 01:27:56,756 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:56,761 INFO ]: Computing forward predicates... [2018-06-22 01:27:56,804 INFO ]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:56,837 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:56,837 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-22 01:27:56,837 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:27:56,837 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:27:56,837 INFO ]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:27:56,838 INFO ]: Start difference. First operand 37 states and 40 transitions. Second operand 28 states. [2018-06-22 01:27:57,168 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:57,168 INFO ]: Finished difference Result 50 states and 52 transitions. [2018-06-22 01:27:57,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:27:57,169 INFO ]: Start accepts. Automaton has 28 states. Word has length 33 [2018-06-22 01:27:57,169 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:57,169 INFO ]: With dead ends: 50 [2018-06-22 01:27:57,169 INFO ]: Without dead ends: 37 [2018-06-22 01:27:57,169 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:27:57,169 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:27:57,170 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-22 01:27:57,170 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:27:57,170 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-06-22 01:27:57,170 INFO ]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 33 [2018-06-22 01:27:57,170 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:57,170 INFO ]: Abstraction has 37 states and 39 transitions. [2018-06-22 01:27:57,170 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:27:57,170 INFO ]: Start isEmpty. Operand 37 states and 39 transitions. [2018-06-22 01:27:57,170 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:27:57,170 INFO ]: Found error trace [2018-06-22 01:27:57,170 INFO ]: trace histogram [14, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:57,170 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:57,170 INFO ]: Analyzing trace with hash -1027997095, now seen corresponding path program 36 times [2018-06-22 01:27:57,171 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:57,171 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:57,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:57,171 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:57,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:57,195 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:58,846 INFO ]: Checked inductivity of 183 backedges. 91 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:58,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:58,846 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:27:58,852 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:27:58,898 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 01:27:58,898 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:58,902 INFO ]: Computing forward predicates... [2018-06-22 01:27:58,920 INFO ]: Checked inductivity of 183 backedges. 91 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:58,944 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:58,945 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-22 01:27:58,945 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:27:58,945 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:27:58,945 INFO ]: CoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:27:58,945 INFO ]: Start difference. First operand 37 states and 39 transitions. Second operand 30 states. [2018-06-22 01:27:59,307 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:59,307 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-22 01:27:59,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:27:59,307 INFO ]: Start accepts. Automaton has 30 states. Word has length 34 [2018-06-22 01:27:59,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:59,307 INFO ]: With dead ends: 53 [2018-06-22 01:27:59,307 INFO ]: Without dead ends: 53 [2018-06-22 01:27:59,308 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=646, Invalid=1246, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:27:59,308 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:27:59,309 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-06-22 01:27:59,309 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:27:59,309 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-06-22 01:27:59,310 INFO ]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2018-06-22 01:27:59,310 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:59,310 INFO ]: Abstraction has 37 states and 39 transitions. [2018-06-22 01:27:59,310 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:27:59,310 INFO ]: Start isEmpty. Operand 37 states and 39 transitions. [2018-06-22 01:27:59,310 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:27:59,310 INFO ]: Found error trace [2018-06-22 01:27:59,310 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:59,310 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:59,310 INFO ]: Analyzing trace with hash -1805557546, now seen corresponding path program 37 times [2018-06-22 01:27:59,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:59,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:59,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:59,311 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:59,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:59,368 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:00,253 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:00,253 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:00,253 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:28:00,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:00,305 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:00,312 INFO ]: Computing forward predicates... [2018-06-22 01:28:01,435 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:01,454 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:01,454 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 60 [2018-06-22 01:28:01,454 INFO ]: Interpolant automaton has 60 states [2018-06-22 01:28:01,455 INFO ]: Constructing interpolant automaton starting with 60 interpolants. [2018-06-22 01:28:01,455 INFO ]: CoverageRelationStatistics Valid=159, Invalid=3381, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 01:28:01,455 INFO ]: Start difference. First operand 37 states and 39 transitions. Second operand 60 states. [2018-06-22 01:28:03,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:03,437 INFO ]: Finished difference Result 72 states and 77 transitions. [2018-06-22 01:28:03,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-22 01:28:03,437 INFO ]: Start accepts. Automaton has 60 states. Word has length 35 [2018-06-22 01:28:03,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:03,437 INFO ]: With dead ends: 72 [2018-06-22 01:28:03,437 INFO ]: Without dead ends: 72 [2018-06-22 01:28:03,438 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1756 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=410, Invalid=7962, Unknown=0, NotChecked=0, Total=8372 [2018-06-22 01:28:03,438 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 01:28:03,439 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 39. [2018-06-22 01:28:03,439 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:28:03,440 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-06-22 01:28:03,440 INFO ]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 35 [2018-06-22 01:28:03,440 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:03,440 INFO ]: Abstraction has 39 states and 42 transitions. [2018-06-22 01:28:03,440 INFO ]: Interpolant automaton has 60 states. [2018-06-22 01:28:03,440 INFO ]: Start isEmpty. Operand 39 states and 42 transitions. [2018-06-22 01:28:03,440 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:28:03,440 INFO ]: Found error trace [2018-06-22 01:28:03,440 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:03,440 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:03,440 INFO ]: Analyzing trace with hash 258241261, now seen corresponding path program 38 times [2018-06-22 01:28:03,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:03,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:03,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:03,441 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:03,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:03,454 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:05,062 INFO ]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:05,062 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:05,062 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:28:05,068 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:28:05,107 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:28:05,107 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:05,111 INFO ]: Computing forward predicates... [2018-06-22 01:28:05,121 INFO ]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:05,140 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:05,141 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-22 01:28:05,141 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:28:05,141 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:28:05,141 INFO ]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:28:05,141 INFO ]: Start difference. First operand 39 states and 42 transitions. Second operand 30 states. [2018-06-22 01:28:05,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:05,374 INFO ]: Finished difference Result 53 states and 55 transitions. [2018-06-22 01:28:05,374 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:28:05,374 INFO ]: Start accepts. Automaton has 30 states. Word has length 35 [2018-06-22 01:28:05,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:05,375 INFO ]: With dead ends: 53 [2018-06-22 01:28:05,375 INFO ]: Without dead ends: 39 [2018-06-22 01:28:05,375 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:28:05,375 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:28:05,376 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 01:28:05,376 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:28:05,376 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-06-22 01:28:05,376 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 35 [2018-06-22 01:28:05,376 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:05,376 INFO ]: Abstraction has 39 states and 41 transitions. [2018-06-22 01:28:05,376 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:28:05,376 INFO ]: Start isEmpty. Operand 39 states and 41 transitions. [2018-06-22 01:28:05,376 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:28:05,376 INFO ]: Found error trace [2018-06-22 01:28:05,376 INFO ]: trace histogram [15, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:05,377 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:05,377 INFO ]: Analyzing trace with hash 2091040738, now seen corresponding path program 39 times [2018-06-22 01:28:05,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:05,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:05,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:05,377 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:28:05,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:05,394 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:06,153 INFO ]: Checked inductivity of 211 backedges. 105 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:06,153 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:06,153 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:28:06,159 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:28:06,209 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 01:28:06,209 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:06,213 INFO ]: Computing forward predicates... [2018-06-22 01:28:06,231 INFO ]: Checked inductivity of 211 backedges. 105 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:06,262 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:06,262 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-22 01:28:06,263 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:28:06,263 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:28:06,263 INFO ]: CoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:28:06,263 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 32 states. [2018-06-22 01:28:06,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:06,600 INFO ]: Finished difference Result 56 states and 59 transitions. [2018-06-22 01:28:06,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:28:06,600 INFO ]: Start accepts. Automaton has 32 states. Word has length 36 [2018-06-22 01:28:06,601 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:06,601 INFO ]: With dead ends: 56 [2018-06-22 01:28:06,601 INFO ]: Without dead ends: 56 [2018-06-22 01:28:06,601 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=737, Invalid=1425, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:28:06,601 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 01:28:06,603 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 39. [2018-06-22 01:28:06,603 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:28:06,603 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-06-22 01:28:06,603 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2018-06-22 01:28:06,603 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:06,603 INFO ]: Abstraction has 39 states and 41 transitions. [2018-06-22 01:28:06,603 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:28:06,603 INFO ]: Start isEmpty. Operand 39 states and 41 transitions. [2018-06-22 01:28:06,603 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:28:06,603 INFO ]: Found error trace [2018-06-22 01:28:06,603 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:06,603 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:06,604 INFO ]: Analyzing trace with hash 395334765, now seen corresponding path program 40 times [2018-06-22 01:28:06,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:06,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:06,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:06,604 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:28:06,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:06,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:07,430 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:07,430 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:07,430 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:28:07,435 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:28:07,489 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:28:07,489 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:07,500 INFO ]: Computing forward predicates... [2018-06-22 01:28:08,803 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:08,822 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:08,822 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-06-22 01:28:08,822 INFO ]: Interpolant automaton has 64 states [2018-06-22 01:28:08,822 INFO ]: Constructing interpolant automaton starting with 64 interpolants. [2018-06-22 01:28:08,823 INFO ]: CoverageRelationStatistics Valid=170, Invalid=3862, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:28:08,823 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 64 states. [2018-06-22 01:28:11,087 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:11,087 INFO ]: Finished difference Result 76 states and 81 transitions. [2018-06-22 01:28:11,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 01:28:11,087 INFO ]: Start accepts. Automaton has 64 states. Word has length 37 [2018-06-22 01:28:11,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:11,087 INFO ]: With dead ends: 76 [2018-06-22 01:28:11,087 INFO ]: Without dead ends: 76 [2018-06-22 01:28:11,088 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2001 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=438, Invalid=9068, Unknown=0, NotChecked=0, Total=9506 [2018-06-22 01:28:11,088 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 01:28:11,090 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 41. [2018-06-22 01:28:11,090 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:28:11,090 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-06-22 01:28:11,090 INFO ]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 37 [2018-06-22 01:28:11,090 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:11,090 INFO ]: Abstraction has 41 states and 44 transitions. [2018-06-22 01:28:11,090 INFO ]: Interpolant automaton has 64 states. [2018-06-22 01:28:11,091 INFO ]: Start isEmpty. Operand 41 states and 44 transitions. [2018-06-22 01:28:11,091 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:28:11,091 INFO ]: Found error trace [2018-06-22 01:28:11,091 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:11,091 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:11,091 INFO ]: Analyzing trace with hash -51411658, now seen corresponding path program 41 times [2018-06-22 01:28:11,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:11,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:11,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:11,092 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:28:11,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:11,114 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:11,406 INFO ]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:11,406 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:11,406 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:28:11,420 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:28:11,468 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 01:28:11,468 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:11,473 INFO ]: Computing forward predicates... [2018-06-22 01:28:11,490 INFO ]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:11,509 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:11,509 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-22 01:28:11,509 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:28:11,509 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:28:11,509 INFO ]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:28:11,509 INFO ]: Start difference. First operand 41 states and 44 transitions. Second operand 32 states. [2018-06-22 01:28:11,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:11,778 INFO ]: Finished difference Result 56 states and 58 transitions. [2018-06-22 01:28:11,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:28:11,778 INFO ]: Start accepts. Automaton has 32 states. Word has length 37 [2018-06-22 01:28:11,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:11,778 INFO ]: With dead ends: 56 [2018-06-22 01:28:11,778 INFO ]: Without dead ends: 41 [2018-06-22 01:28:11,779 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=541, Invalid=1621, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:28:11,779 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:28:11,780 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 01:28:11,780 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:28:11,780 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-06-22 01:28:11,780 INFO ]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 37 [2018-06-22 01:28:11,781 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:11,781 INFO ]: Abstraction has 41 states and 43 transitions. [2018-06-22 01:28:11,781 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:28:11,781 INFO ]: Start isEmpty. Operand 41 states and 43 transitions. [2018-06-22 01:28:11,781 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:28:11,781 INFO ]: Found error trace [2018-06-22 01:28:11,781 INFO ]: trace histogram [16, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:11,781 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:11,781 INFO ]: Analyzing trace with hash -185196423, now seen corresponding path program 42 times [2018-06-22 01:28:11,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:11,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:11,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:11,782 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:28:11,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:11,808 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 01:28:12,834 WARN ]: Verification canceled [2018-06-22 01:28:12,838 WARN ]: Timeout [2018-06-22 01:28:12,838 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:28:12 BoogieIcfgContainer [2018-06-22 01:28:12,838 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:28:12,839 INFO ]: Toolchain (without parser) took 58279.69 ms. Allocated memory was 301.5 MB in the beginning and 643.8 MB in the end (delta: 342.4 MB). Free memory was 257.0 MB in the beginning and 402.4 MB in the end (delta: -145.4 MB). Peak memory consumption was 197.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:12,839 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 301.5 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:28:12,839 INFO ]: ChcToBoogie took 56.03 ms. Allocated memory is still 301.5 MB. Free memory was 257.0 MB in the beginning and 255.0 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:28:12,840 INFO ]: Boogie Preprocessor took 33.19 ms. Allocated memory is still 301.5 MB. Free memory was 255.0 MB in the beginning and 254.0 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 3.6 GB. [2018-06-22 01:28:12,841 INFO ]: RCFGBuilder took 242.52 ms. Allocated memory is still 301.5 MB. Free memory was 254.0 MB in the beginning and 245.0 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:28:12,841 INFO ]: TraceAbstraction took 57928.08 ms. Allocated memory was 301.5 MB in the beginning and 643.8 MB in the end (delta: 342.4 MB). Free memory was 244.0 MB in the beginning and 402.4 MB in the end (delta: -158.4 MB). Peak memory consumption was 184.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:12,843 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 301.5 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.03 ms. Allocated memory is still 301.5 MB. Free memory was 257.0 MB in the beginning and 255.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.19 ms. Allocated memory is still 301.5 MB. Free memory was 255.0 MB in the beginning and 254.0 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 3.6 GB. * RCFGBuilder took 242.52 ms. Allocated memory is still 301.5 MB. Free memory was 254.0 MB in the beginning and 245.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57928.08 ms. Allocated memory was 301.5 MB in the beginning and 643.8 MB in the end (delta: 342.4 MB). Free memory was 244.0 MB in the beginning and 402.4 MB in the end (delta: -158.4 MB). Peak memory consumption was 184.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. TIMEOUT Result, 57.8s OverallTime, 49 OverallIterations, 16 TraceHistogramMax, 23.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 420 SDtfs, 1108 SDslu, 4895 SDs, 0 SdLazy, 17143 SolverSat, 974 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2341 GetRequests, 808 SyntacticMatches, 0 SemanticMatches, 1533 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14698 ImplicationChecksByTransitivity, 38.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=47, 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.1s AutomataMinimizationTime, 48 MinimizatonAttempts, 475 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 2053 NumberOfCodeBlocks, 2053 NumberOfCodeBlocksAsserted, 197 NumberOfCheckSat, 1961 ConstructedInterpolants, 0 QuantifiedInterpolants, 338664 SizeOfPredicates, 147 NumberOfNonLiveVariables, 11280 ConjunctsInSsa, 4716 ConjunctsInUnsatCore, 92 InterpolantComputations, 4 PerfectInterpolantSequences, 2481/7231 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/012b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-28-12-852.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/012b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-28-12-852.csv Completed graceful shutdown