java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:01:01,144 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:01:01,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:01:01,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:01:01,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:01:01,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:01:01,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:01:01,167 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:01:01,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:01:01,170 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:01:01,171 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:01:01,171 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:01:01,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:01:01,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:01:01,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:01:01,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:01:01,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:01:01,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:01:01,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:01:01,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:01:01,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:01:01,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:01:01,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:01:01,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:01:01,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:01:01,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:01:01,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:01:01,202 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:01:01,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:01:01,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:01:01,207 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:01:01,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:01:01,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:01:01,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:01:01,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:01:01,211 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:01:01,235 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:01:01,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:01:01,236 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:01:01,236 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:01:01,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:01:01,237 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:01:01,237 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:01:01,238 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:01:01,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:01:01,238 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:01:01,238 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:01:01,238 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:01:01,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:01:01,241 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:01:01,241 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:01:01,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:01:01,242 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:01:01,242 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:01:01,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:01:01,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:01:01,242 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:01:01,244 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:01:01,244 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:01:01,292 INFO ]: Repository-Root is: /tmp [2018-06-25 09:01:01,308 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:01:01,313 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:01:01,315 INFO ]: Initializing SmtParser... [2018-06-25 09:01:01,315 INFO ]: SmtParser initialized [2018-06-25 09:01:01,316 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_merged_safe.c-1.smt2 [2018-06-25 09:01:01,317 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:01:01,404 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_merged_safe.c-1.smt2 unknown [2018-06-25 09:01:01,586 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_merged_safe.c-1.smt2 [2018-06-25 09:01:01,591 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:01:01,599 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:01:01,600 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:01:01,600 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:01:01,600 INFO ]: ChcToBoogie initialized [2018-06-25 09:01:01,603 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:01:01" (1/1) ... [2018-06-25 09:01:01,657 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:01:01 Unit [2018-06-25 09:01:01,657 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:01:01,658 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:01:01,658 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:01:01,658 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:01:01,677 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:01:01" (1/1) ... [2018-06-25 09:01:01,677 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:01:01" (1/1) ... [2018-06-25 09:01:01,682 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:01:01" (1/1) ... [2018-06-25 09:01:01,682 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:01:01" (1/1) ... [2018-06-25 09:01:01,686 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:01:01" (1/1) ... [2018-06-25 09:01:01,687 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:01:01" (1/1) ... [2018-06-25 09:01:01,688 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:01:01" (1/1) ... [2018-06-25 09:01:01,690 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:01:01,690 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:01:01,690 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:01:01,690 INFO ]: RCFGBuilder initialized [2018-06-25 09:01:01,691 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:01:01" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:01:01,704 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:01:01,704 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:01:01,704 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:01:01,704 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:01:01,704 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:01:01,704 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 09:01:01,997 INFO ]: Using library mode [2018-06-25 09:01:01,998 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:01:01 BoogieIcfgContainer [2018-06-25 09:01:01,998 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:01:02,008 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:01:02,008 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:01:02,011 INFO ]: TraceAbstraction initialized [2018-06-25 09:01:02,011 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:01:01" (1/3) ... [2018-06-25 09:01:02,012 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0a269c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:01:02, skipping insertion in model container [2018-06-25 09:01:02,012 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:01:01" (2/3) ... [2018-06-25 09:01:02,012 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0a269c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:01:02, skipping insertion in model container [2018-06-25 09:01:02,012 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:01:01" (3/3) ... [2018-06-25 09:01:02,020 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:01:02,038 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:01:02,046 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:01:02,109 INFO ]: Using default assertion order modulation [2018-06-25 09:01:02,110 INFO ]: Interprodecural is true [2018-06-25 09:01:02,110 INFO ]: Hoare is false [2018-06-25 09:01:02,110 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:01:02,110 INFO ]: Backedges is TWOTRACK [2018-06-25 09:01:02,110 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:01:02,110 INFO ]: Difference is false [2018-06-25 09:01:02,110 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:01:02,110 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:01:02,124 INFO ]: Start isEmpty. Operand 13 states. [2018-06-25 09:01:02,134 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:01:02,134 INFO ]: Found error trace [2018-06-25 09:01:02,135 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:02,135 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:02,140 INFO ]: Analyzing trace with hash 764877710, now seen corresponding path program 1 times [2018-06-25 09:01:02,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:02,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:02,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:02,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:02,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:02,242 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:02,359 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:02,361 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:01:02,361 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:01:02,362 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:01:02,373 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:01:02,373 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:01:02,375 INFO ]: Start difference. First operand 13 states. Second operand 5 states. [2018-06-25 09:01:02,529 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:02,529 INFO ]: Finished difference Result 12 states and 13 transitions. [2018-06-25 09:01:02,530 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:01:02,531 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-25 09:01:02,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:02,540 INFO ]: With dead ends: 12 [2018-06-25 09:01:02,540 INFO ]: Without dead ends: 12 [2018-06-25 09:01:02,542 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:01:02,556 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:01:02,572 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:01:02,573 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:01:02,574 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-25 09:01:02,575 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-25 09:01:02,575 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:02,575 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-25 09:01:02,575 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:01:02,575 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-25 09:01:02,576 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:01:02,576 INFO ]: Found error trace [2018-06-25 09:01:02,576 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:02,576 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:02,576 INFO ]: Analyzing trace with hash -2005065960, now seen corresponding path program 1 times [2018-06-25 09:01:02,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:02,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:02,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:02,577 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:02,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:02,595 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:02,761 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:02,761 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:02,761 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:02,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:02,803 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:02,811 INFO ]: Computing forward predicates... [2018-06-25 09:01:02,871 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:02,906 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:02,906 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 09:01:02,906 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:01:02,906 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:01:02,907 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:01:02,907 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 6 states. [2018-06-25 09:01:03,115 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:03,115 INFO ]: Finished difference Result 19 states and 22 transitions. [2018-06-25 09:01:03,115 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:01:03,115 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-25 09:01:03,115 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:03,118 INFO ]: With dead ends: 19 [2018-06-25 09:01:03,118 INFO ]: Without dead ends: 19 [2018-06-25 09:01:03,119 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:01:03,119 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:01:03,122 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-25 09:01:03,122 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:01:03,122 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-25 09:01:03,122 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-06-25 09:01:03,123 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:03,123 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-25 09:01:03,123 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:01:03,123 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-25 09:01:03,123 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:01:03,123 INFO ]: Found error trace [2018-06-25 09:01:03,123 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:03,123 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:03,123 INFO ]: Analyzing trace with hash -1973973810, now seen corresponding path program 2 times [2018-06-25 09:01:03,123 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:03,123 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:03,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:03,124 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:03,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:03,138 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:03,274 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:03,274 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:03,274 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:03,280 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:01:03,329 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:01:03,329 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:03,331 INFO ]: Computing forward predicates... [2018-06-25 09:01:03,545 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:03,563 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:01:03,564 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-06-25 09:01:03,564 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:01:03,564 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:01:03,564 INFO ]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:01:03,565 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 10 states. [2018-06-25 09:01:03,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:03,689 INFO ]: Finished difference Result 16 states and 18 transitions. [2018-06-25 09:01:03,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:01:03,690 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-25 09:01:03,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:03,690 INFO ]: With dead ends: 16 [2018-06-25 09:01:03,690 INFO ]: Without dead ends: 13 [2018-06-25 09:01:03,691 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:01:03,691 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:01:03,692 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:01:03,692 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:01:03,693 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-25 09:01:03,693 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2018-06-25 09:01:03,693 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:03,693 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-25 09:01:03,693 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:01:03,693 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-25 09:01:03,693 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:01:03,693 INFO ]: Found error trace [2018-06-25 09:01:03,693 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:03,694 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:03,694 INFO ]: Analyzing trace with hash -1293415292, now seen corresponding path program 1 times [2018-06-25 09:01:03,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:03,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:03,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:03,695 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:03,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:03,712 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:03,780 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:03,781 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:03,781 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:03,788 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:03,818 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:03,820 INFO ]: Computing forward predicates... [2018-06-25 09:01:04,143 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:04,174 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:04,174 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 09:01:04,174 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:01:04,174 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:01:04,175 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:01:04,175 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-06-25 09:01:04,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:04,355 INFO ]: Finished difference Result 14 states and 15 transitions. [2018-06-25 09:01:04,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:01:04,355 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-25 09:01:04,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:04,356 INFO ]: With dead ends: 14 [2018-06-25 09:01:04,356 INFO ]: Without dead ends: 14 [2018-06-25 09:01:04,356 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:01:04,356 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:01:04,358 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:01:04,358 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:01:04,358 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-25 09:01:04,358 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-06-25 09:01:04,358 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:04,358 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-25 09:01:04,358 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:01:04,358 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-25 09:01:04,359 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:01:04,359 INFO ]: Found error trace [2018-06-25 09:01:04,359 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:04,359 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:04,359 INFO ]: Analyzing trace with hash -1387639582, now seen corresponding path program 2 times [2018-06-25 09:01:04,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:04,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:04,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:04,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:04,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:04,376 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:04,470 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:04,470 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:04,470 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:04,476 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:01:04,524 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:01:04,524 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:04,528 INFO ]: Computing forward predicates... [2018-06-25 09:01:04,581 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:04,603 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:04,603 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-25 09:01:04,603 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:01:04,603 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:01:04,603 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:01:04,603 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 8 states. [2018-06-25 09:01:04,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:04,741 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-25 09:01:04,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:01:04,741 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-25 09:01:04,741 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:04,742 INFO ]: With dead ends: 22 [2018-06-25 09:01:04,742 INFO ]: Without dead ends: 22 [2018-06-25 09:01:04,742 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:01:04,742 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:01:04,744 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-25 09:01:04,744 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:01:04,745 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-25 09:01:04,745 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-06-25 09:01:04,745 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:04,745 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-25 09:01:04,745 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:01:04,745 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-25 09:01:04,745 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:01:04,745 INFO ]: Found error trace [2018-06-25 09:01:04,745 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:04,745 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:04,746 INFO ]: Analyzing trace with hash -13625276, now seen corresponding path program 3 times [2018-06-25 09:01:04,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:04,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:04,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:04,746 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:04,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:04,761 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:04,836 INFO ]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:04,836 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:04,836 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:04,842 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:01:04,861 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:01:04,861 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:04,863 INFO ]: Computing forward predicates... [2018-06-25 09:01:04,960 INFO ]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:04,979 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:04,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-25 09:01:04,979 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:01:04,979 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:01:04,979 INFO ]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:01:04,980 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 11 states. [2018-06-25 09:01:05,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:05,095 INFO ]: Finished difference Result 19 states and 21 transitions. [2018-06-25 09:01:05,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:01:05,095 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-25 09:01:05,095 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:05,096 INFO ]: With dead ends: 19 [2018-06-25 09:01:05,096 INFO ]: Without dead ends: 15 [2018-06-25 09:01:05,096 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:01:05,096 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:01:05,098 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:01:05,098 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:01:05,099 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-25 09:01:05,099 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2018-06-25 09:01:05,099 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:05,099 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-25 09:01:05,099 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:01:05,099 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-25 09:01:05,100 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:01:05,100 INFO ]: Found error trace [2018-06-25 09:01:05,100 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:05,100 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:05,100 INFO ]: Analyzing trace with hash -391147698, now seen corresponding path program 4 times [2018-06-25 09:01:05,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:05,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:05,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:05,101 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:05,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:05,112 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:05,166 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:05,167 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:05,167 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:05,173 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:01:05,188 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:01:05,188 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:05,190 INFO ]: Computing forward predicates... [2018-06-25 09:01:05,236 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:05,255 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:05,255 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-25 09:01:05,256 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:01:05,256 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:01:05,256 INFO ]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:01:05,256 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2018-06-25 09:01:05,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:05,296 INFO ]: Finished difference Result 16 states and 17 transitions. [2018-06-25 09:01:05,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:01:05,297 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-25 09:01:05,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:05,297 INFO ]: With dead ends: 16 [2018-06-25 09:01:05,297 INFO ]: Without dead ends: 16 [2018-06-25 09:01:05,297 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:01:05,297 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:01:05,299 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 09:01:05,299 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:01:05,299 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-25 09:01:05,299 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-25 09:01:05,299 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:05,299 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-25 09:01:05,299 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:01:05,299 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-25 09:01:05,300 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:01:05,300 INFO ]: Found error trace [2018-06-25 09:01:05,300 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:05,300 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:05,300 INFO ]: Analyzing trace with hash 812852056, now seen corresponding path program 5 times [2018-06-25 09:01:05,300 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:05,300 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:05,301 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:05,301 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:05,301 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:05,317 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:05,532 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:05,532 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:05,532 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:05,547 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:01:05,570 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 09:01:05,570 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:05,572 INFO ]: Computing forward predicates... [2018-06-25 09:01:05,612 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:05,633 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:05,633 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-25 09:01:05,633 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:01:05,633 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:01:05,633 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:01:05,634 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 10 states. [2018-06-25 09:01:05,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:05,822 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-25 09:01:05,822 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:01:05,822 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-25 09:01:05,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:05,823 INFO ]: With dead ends: 25 [2018-06-25 09:01:05,823 INFO ]: Without dead ends: 25 [2018-06-25 09:01:05,823 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:01:05,823 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:01:05,825 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-25 09:01:05,825 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:01:05,826 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-25 09:01:05,826 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-06-25 09:01:05,826 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:05,826 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-25 09:01:05,826 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:01:05,826 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-25 09:01:05,826 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:01:05,826 INFO ]: Found error trace [2018-06-25 09:01:05,826 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:05,826 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:05,827 INFO ]: Analyzing trace with hash -517861234, now seen corresponding path program 6 times [2018-06-25 09:01:05,827 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:05,827 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:05,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:05,827 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:05,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:05,840 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:06,191 INFO ]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:06,191 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:06,191 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:06,198 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:01:06,215 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-25 09:01:06,216 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:06,217 INFO ]: Computing forward predicates... [2018-06-25 09:01:06,384 INFO ]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:06,403 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:06,403 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-25 09:01:06,403 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:01:06,403 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:01:06,404 INFO ]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:01:06,404 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 14 states. [2018-06-25 09:01:06,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:06,518 INFO ]: Finished difference Result 22 states and 24 transitions. [2018-06-25 09:01:06,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:01:06,518 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-25 09:01:06,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:06,519 INFO ]: With dead ends: 22 [2018-06-25 09:01:06,519 INFO ]: Without dead ends: 17 [2018-06-25 09:01:06,519 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:01:06,519 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:01:06,520 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 09:01:06,520 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:01:06,521 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-25 09:01:06,521 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2018-06-25 09:01:06,521 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:06,521 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-25 09:01:06,521 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:01:06,521 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-25 09:01:06,521 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:01:06,521 INFO ]: Found error trace [2018-06-25 09:01:06,521 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:06,522 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:06,522 INFO ]: Analyzing trace with hash 663845572, now seen corresponding path program 7 times [2018-06-25 09:01:06,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:06,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:06,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:06,523 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:06,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:06,533 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:06,617 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:06,618 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:06,618 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:06,627 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:06,647 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:06,649 INFO ]: Computing forward predicates... [2018-06-25 09:01:06,708 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:06,727 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:06,727 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-25 09:01:06,727 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:01:06,727 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:01:06,727 INFO ]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:01:06,728 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 13 states. [2018-06-25 09:01:07,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:07,103 INFO ]: Finished difference Result 18 states and 19 transitions. [2018-06-25 09:01:07,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:01:07,103 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-25 09:01:07,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:07,103 INFO ]: With dead ends: 18 [2018-06-25 09:01:07,103 INFO ]: Without dead ends: 18 [2018-06-25 09:01:07,103 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:01:07,103 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:01:07,105 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 09:01:07,105 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:01:07,105 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-25 09:01:07,105 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-25 09:01:07,105 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:07,105 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-25 09:01:07,105 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:01:07,106 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-25 09:01:07,106 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:01:07,106 INFO ]: Found error trace [2018-06-25 09:01:07,106 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:07,106 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:07,106 INFO ]: Analyzing trace with hash -842094942, now seen corresponding path program 8 times [2018-06-25 09:01:07,106 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:07,106 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:07,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:07,107 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:07,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:07,123 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:07,247 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:07,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:07,247 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:07,265 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:01:07,316 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:01:07,316 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:07,319 INFO ]: Computing forward predicates... [2018-06-25 09:01:07,391 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:07,410 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:07,410 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-25 09:01:07,410 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:01:07,410 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:01:07,410 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:01:07,410 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2018-06-25 09:01:07,745 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:07,745 INFO ]: Finished difference Result 28 states and 31 transitions. [2018-06-25 09:01:07,745 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:01:07,745 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-25 09:01:07,746 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:07,746 INFO ]: With dead ends: 28 [2018-06-25 09:01:07,746 INFO ]: Without dead ends: 28 [2018-06-25 09:01:07,746 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:01:07,747 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 09:01:07,748 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-06-25 09:01:07,748 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:01:07,749 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-25 09:01:07,749 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-06-25 09:01:07,749 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:07,749 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-25 09:01:07,749 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:01:07,749 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-25 09:01:07,749 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:01:07,750 INFO ]: Found error trace [2018-06-25 09:01:07,750 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:07,750 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:07,750 INFO ]: Analyzing trace with hash -281610620, now seen corresponding path program 9 times [2018-06-25 09:01:07,750 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:07,750 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:07,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:07,750 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:07,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:07,760 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:07,834 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:07,834 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:07,834 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:07,840 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:01:07,895 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:01:07,895 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:07,897 INFO ]: Computing forward predicates... [2018-06-25 09:01:07,969 INFO ]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:07,989 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:07,989 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-25 09:01:07,989 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:01:07,989 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:01:07,989 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:01:07,989 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 17 states. [2018-06-25 09:01:08,076 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:08,076 INFO ]: Finished difference Result 25 states and 27 transitions. [2018-06-25 09:01:08,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:01:08,077 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-25 09:01:08,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:08,077 INFO ]: With dead ends: 25 [2018-06-25 09:01:08,077 INFO ]: Without dead ends: 19 [2018-06-25 09:01:08,078 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:01:08,078 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:01:08,079 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 09:01:08,079 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:01:08,079 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-25 09:01:08,079 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-06-25 09:01:08,080 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:08,080 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-25 09:01:08,080 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:01:08,080 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-25 09:01:08,080 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:01:08,080 INFO ]: Found error trace [2018-06-25 09:01:08,080 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:08,080 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:08,080 INFO ]: Analyzing trace with hash 1991561998, now seen corresponding path program 10 times [2018-06-25 09:01:08,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:08,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:08,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:08,081 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:08,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:08,091 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:08,243 INFO ]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:08,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:08,243 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:08,249 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:01:08,279 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:01:08,280 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:08,282 INFO ]: Computing forward predicates... [2018-06-25 09:01:08,390 INFO ]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:08,409 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:08,409 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-25 09:01:08,409 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:01:08,409 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:01:08,409 INFO ]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:01:08,409 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2018-06-25 09:01:08,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:08,525 INFO ]: Finished difference Result 20 states and 21 transitions. [2018-06-25 09:01:08,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:01:08,526 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-25 09:01:08,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:08,526 INFO ]: With dead ends: 20 [2018-06-25 09:01:08,526 INFO ]: Without dead ends: 20 [2018-06-25 09:01:08,527 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:01:08,527 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:01:08,528 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:01:08,528 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:01:08,528 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-25 09:01:08,528 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-25 09:01:08,528 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:08,528 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-25 09:01:08,528 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:01:08,528 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-25 09:01:08,528 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:01:08,528 INFO ]: Found error trace [2018-06-25 09:01:08,528 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:08,529 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:08,529 INFO ]: Analyzing trace with hash 1662408600, now seen corresponding path program 11 times [2018-06-25 09:01:08,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:08,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:08,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:08,529 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:08,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:08,544 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:08,708 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:08,708 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:08,708 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:08,715 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:01:08,737 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:01:08,737 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:08,740 INFO ]: Computing forward predicates... [2018-06-25 09:01:08,789 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:08,809 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:08,809 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-25 09:01:08,809 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:01:08,809 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:01:08,809 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:01:08,809 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 14 states. [2018-06-25 09:01:09,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:09,123 INFO ]: Finished difference Result 31 states and 34 transitions. [2018-06-25 09:01:09,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:01:09,123 INFO ]: Start accepts. Automaton has 14 states. Word has length 19 [2018-06-25 09:01:09,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:09,124 INFO ]: With dead ends: 31 [2018-06-25 09:01:09,124 INFO ]: Without dead ends: 31 [2018-06-25 09:01:09,124 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:01:09,124 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:01:09,128 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-06-25 09:01:09,128 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:01:09,129 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-06-25 09:01:09,129 INFO ]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-06-25 09:01:09,129 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:09,129 INFO ]: Abstraction has 22 states and 24 transitions. [2018-06-25 09:01:09,129 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:01:09,129 INFO ]: Start isEmpty. Operand 22 states and 24 transitions. [2018-06-25 09:01:09,129 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:01:09,129 INFO ]: Found error trace [2018-06-25 09:01:09,129 INFO ]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:09,130 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:09,130 INFO ]: Analyzing trace with hash 48587854, now seen corresponding path program 12 times [2018-06-25 09:01:09,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:09,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:09,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:09,130 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:09,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:09,154 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:09,272 INFO ]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:09,272 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:09,272 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:09,286 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:01:09,359 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:01:09,359 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:09,361 INFO ]: Computing forward predicates... [2018-06-25 09:01:09,484 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:09,503 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:09,503 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-25 09:01:09,504 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:01:09,504 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:01:09,504 INFO ]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:01:09,504 INFO ]: Start difference. First operand 22 states and 24 transitions. Second operand 20 states. [2018-06-25 09:01:09,748 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:09,748 INFO ]: Finished difference Result 28 states and 30 transitions. [2018-06-25 09:01:09,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:01:09,748 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-25 09:01:09,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:09,748 INFO ]: With dead ends: 28 [2018-06-25 09:01:09,748 INFO ]: Without dead ends: 21 [2018-06-25 09:01:09,749 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:01:09,749 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:01:09,750 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 09:01:09,750 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:01:09,752 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-25 09:01:09,752 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-06-25 09:01:09,752 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:09,752 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-25 09:01:09,752 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:01:09,752 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-25 09:01:09,752 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:01:09,752 INFO ]: Found error trace [2018-06-25 09:01:09,752 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:09,752 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:09,752 INFO ]: Analyzing trace with hash 1797462276, now seen corresponding path program 13 times [2018-06-25 09:01:09,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:09,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:09,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:09,753 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:09,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:09,761 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:09,860 INFO ]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:09,860 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:09,860 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:09,865 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:09,886 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:09,888 INFO ]: Computing forward predicates... [2018-06-25 09:01:10,196 INFO ]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:10,218 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:10,218 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-25 09:01:10,218 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:01:10,218 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:01:10,219 INFO ]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:01:10,219 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 19 states. [2018-06-25 09:01:10,292 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:10,292 INFO ]: Finished difference Result 22 states and 23 transitions. [2018-06-25 09:01:10,293 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:01:10,293 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-25 09:01:10,293 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:10,293 INFO ]: With dead ends: 22 [2018-06-25 09:01:10,293 INFO ]: Without dead ends: 22 [2018-06-25 09:01:10,294 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:01:10,294 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:01:10,295 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-25 09:01:10,295 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:01:10,296 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-25 09:01:10,296 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-06-25 09:01:10,296 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:10,296 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-25 09:01:10,296 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:01:10,296 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-25 09:01:10,296 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:01:10,296 INFO ]: Found error trace [2018-06-25 09:01:10,296 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:10,296 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:10,296 INFO ]: Analyzing trace with hash -59715486, now seen corresponding path program 14 times [2018-06-25 09:01:10,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:10,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:10,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:10,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:10,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:10,311 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:11,198 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:11,199 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:11,199 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:11,205 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:01:11,228 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:01:11,228 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:11,231 INFO ]: Computing forward predicates... [2018-06-25 09:01:11,296 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:11,316 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:11,316 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-25 09:01:11,316 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:01:11,316 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:01:11,316 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:01:11,316 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 16 states. [2018-06-25 09:01:11,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:11,609 INFO ]: Finished difference Result 34 states and 37 transitions. [2018-06-25 09:01:11,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:01:11,609 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-25 09:01:11,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:11,609 INFO ]: With dead ends: 34 [2018-06-25 09:01:11,609 INFO ]: Without dead ends: 34 [2018-06-25 09:01:11,610 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:01:11,610 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:01:11,611 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 24. [2018-06-25 09:01:11,611 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:01:11,612 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-25 09:01:11,612 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-06-25 09:01:11,612 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:11,612 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-25 09:01:11,612 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:01:11,612 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-25 09:01:11,613 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:01:11,613 INFO ]: Found error trace [2018-06-25 09:01:11,613 INFO ]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:11,613 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:11,613 INFO ]: Analyzing trace with hash -1797651260, now seen corresponding path program 15 times [2018-06-25 09:01:11,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:11,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:11,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:11,613 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:11,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:11,623 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:12,487 INFO ]: Checked inductivity of 43 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:12,487 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:12,487 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:12,501 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:01:12,528 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:01:12,528 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:12,530 INFO ]: Computing forward predicates... [2018-06-25 09:01:12,640 INFO ]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:12,660 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:12,660 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-06-25 09:01:12,660 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:01:12,660 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:01:12,660 INFO ]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:01:12,660 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 23 states. [2018-06-25 09:01:12,800 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:12,800 INFO ]: Finished difference Result 31 states and 33 transitions. [2018-06-25 09:01:12,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:01:12,801 INFO ]: Start accepts. Automaton has 23 states. Word has length 22 [2018-06-25 09:01:12,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:12,801 INFO ]: With dead ends: 31 [2018-06-25 09:01:12,801 INFO ]: Without dead ends: 23 [2018-06-25 09:01:12,802 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:01:12,802 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:01:12,803 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-25 09:01:12,803 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:01:12,803 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-25 09:01:12,803 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-06-25 09:01:12,803 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:12,803 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-25 09:01:12,803 INFO ]: Interpolant automaton has 23 states. [2018-06-25 09:01:12,803 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-25 09:01:12,803 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:01:12,803 INFO ]: Found error trace [2018-06-25 09:01:12,804 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:12,804 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:12,804 INFO ]: Analyzing trace with hash 877848270, now seen corresponding path program 16 times [2018-06-25 09:01:12,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:12,804 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:12,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:12,804 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:12,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:12,812 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:13,024 INFO ]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:13,024 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:13,024 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:13,030 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:01:13,054 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:01:13,054 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:13,055 INFO ]: Computing forward predicates... [2018-06-25 09:01:13,187 INFO ]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:13,210 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:13,210 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-06-25 09:01:13,210 INFO ]: Interpolant automaton has 22 states [2018-06-25 09:01:13,210 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 09:01:13,211 INFO ]: CoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:01:13,211 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 22 states. [2018-06-25 09:01:13,310 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:13,310 INFO ]: Finished difference Result 24 states and 25 transitions. [2018-06-25 09:01:13,310 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:01:13,310 INFO ]: Start accepts. Automaton has 22 states. Word has length 22 [2018-06-25 09:01:13,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:13,310 INFO ]: With dead ends: 24 [2018-06-25 09:01:13,310 INFO ]: Without dead ends: 24 [2018-06-25 09:01:13,311 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:01:13,311 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:01:13,312 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 09:01:13,312 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:01:13,312 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-25 09:01:13,312 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-25 09:01:13,313 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:13,313 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-25 09:01:13,313 INFO ]: Interpolant automaton has 22 states. [2018-06-25 09:01:13,313 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-25 09:01:13,313 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:01:13,313 INFO ]: Found error trace [2018-06-25 09:01:13,313 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:13,313 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:13,313 INFO ]: Analyzing trace with hash 1497021400, now seen corresponding path program 17 times [2018-06-25 09:01:13,313 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:13,313 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:13,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:13,314 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:13,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:13,341 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:13,665 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:13,665 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:13,665 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:13,671 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:01:13,738 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-25 09:01:13,738 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:13,741 INFO ]: Computing forward predicates... [2018-06-25 09:01:13,846 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:13,865 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:13,865 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-25 09:01:13,865 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:01:13,865 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:01:13,866 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:01:13,866 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 18 states. [2018-06-25 09:01:14,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:14,262 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-25 09:01:14,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:01:14,262 INFO ]: Start accepts. Automaton has 18 states. Word has length 23 [2018-06-25 09:01:14,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:14,263 INFO ]: With dead ends: 37 [2018-06-25 09:01:14,263 INFO ]: Without dead ends: 37 [2018-06-25 09:01:14,263 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:01:14,263 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:01:14,265 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-06-25 09:01:14,265 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:01:14,266 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-25 09:01:14,266 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-06-25 09:01:14,266 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:14,266 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-25 09:01:14,266 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:01:14,266 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-25 09:01:14,266 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:01:14,266 INFO ]: Found error trace [2018-06-25 09:01:14,266 INFO ]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:14,266 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:14,266 INFO ]: Analyzing trace with hash -783448050, now seen corresponding path program 18 times [2018-06-25 09:01:14,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:14,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:14,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:14,267 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:14,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:14,277 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:14,493 INFO ]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:14,493 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:14,493 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:14,499 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:01:14,532 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-25 09:01:14,532 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:14,535 INFO ]: Computing forward predicates... [2018-06-25 09:01:14,713 INFO ]: Checked inductivity of 57 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:14,732 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:14,732 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-06-25 09:01:14,732 INFO ]: Interpolant automaton has 26 states [2018-06-25 09:01:14,732 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 09:01:14,733 INFO ]: CoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:01:14,733 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 26 states. [2018-06-25 09:01:14,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:14,890 INFO ]: Finished difference Result 34 states and 36 transitions. [2018-06-25 09:01:14,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:01:14,890 INFO ]: Start accepts. Automaton has 26 states. Word has length 24 [2018-06-25 09:01:14,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:14,890 INFO ]: With dead ends: 34 [2018-06-25 09:01:14,890 INFO ]: Without dead ends: 25 [2018-06-25 09:01:14,891 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:01:14,891 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:01:14,892 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-25 09:01:14,892 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 09:01:14,893 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-25 09:01:14,893 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2018-06-25 09:01:14,893 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:14,893 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-25 09:01:14,893 INFO ]: Interpolant automaton has 26 states. [2018-06-25 09:01:14,893 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-25 09:01:14,893 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:01:14,893 INFO ]: Found error trace [2018-06-25 09:01:14,893 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:14,893 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:14,893 INFO ]: Analyzing trace with hash 552658756, now seen corresponding path program 19 times [2018-06-25 09:01:14,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:14,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:14,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:14,894 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:14,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:14,907 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:15,196 INFO ]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:15,196 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:15,196 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:15,214 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:15,241 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:15,243 INFO ]: Computing forward predicates... [2018-06-25 09:01:15,326 INFO ]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:15,346 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:15,346 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-25 09:01:15,346 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:01:15,346 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:01:15,346 INFO ]: CoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:01:15,346 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 25 states. [2018-06-25 09:01:15,925 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:15,925 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-25 09:01:15,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:01:15,926 INFO ]: Start accepts. Automaton has 25 states. Word has length 24 [2018-06-25 09:01:15,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:15,926 INFO ]: With dead ends: 26 [2018-06-25 09:01:15,926 INFO ]: Without dead ends: 26 [2018-06-25 09:01:15,927 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=332, Invalid=724, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:01:15,927 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 09:01:15,929 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-25 09:01:15,929 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:01:15,929 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-25 09:01:15,929 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-06-25 09:01:15,929 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:15,929 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-25 09:01:15,929 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:01:15,929 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-25 09:01:15,930 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:01:15,930 INFO ]: Found error trace [2018-06-25 09:01:15,930 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:15,930 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:15,930 INFO ]: Analyzing trace with hash 6081058, now seen corresponding path program 20 times [2018-06-25 09:01:15,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:15,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:15,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:15,930 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:15,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:15,944 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:16,393 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:16,393 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:16,393 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-25 09:01:16,398 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:01:16,426 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:01:16,426 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:16,429 INFO ]: Computing forward predicates... [2018-06-25 09:01:16,640 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:16,658 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:16,658 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-25 09:01:16,658 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:01:16,659 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:01:16,659 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:01:16,659 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 20 states. [2018-06-25 09:01:17,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:17,159 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-25 09:01:17,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:01:17,159 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-25 09:01:17,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:17,159 INFO ]: With dead ends: 40 [2018-06-25 09:01:17,159 INFO ]: Without dead ends: 40 [2018-06-25 09:01:17,160 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=1326, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:01:17,160 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 09:01:17,162 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 28. [2018-06-25 09:01:17,162 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 09:01:17,163 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-25 09:01:17,163 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-06-25 09:01:17,163 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:17,163 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-25 09:01:17,163 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:01:17,163 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-25 09:01:17,163 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:01:17,163 INFO ]: Found error trace [2018-06-25 09:01:17,163 INFO ]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:17,163 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:17,164 INFO ]: Analyzing trace with hash 242041604, now seen corresponding path program 21 times [2018-06-25 09:01:17,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:17,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:17,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:17,164 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:17,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:17,177 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:17,342 INFO ]: Checked inductivity of 73 backedges. 28 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:17,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:17,342 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-25 09:01:17,348 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:01:17,381 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-25 09:01:17,381 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:17,384 INFO ]: Computing forward predicates... [2018-06-25 09:01:17,543 INFO ]: Checked inductivity of 73 backedges. 45 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:17,561 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:17,561 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-06-25 09:01:17,561 INFO ]: Interpolant automaton has 29 states [2018-06-25 09:01:17,561 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-25 09:01:17,562 INFO ]: CoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:01:17,562 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 29 states. [2018-06-25 09:01:17,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:17,700 INFO ]: Finished difference Result 37 states and 39 transitions. [2018-06-25 09:01:17,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 09:01:17,700 INFO ]: Start accepts. Automaton has 29 states. Word has length 26 [2018-06-25 09:01:17,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:17,701 INFO ]: With dead ends: 37 [2018-06-25 09:01:17,701 INFO ]: Without dead ends: 27 [2018-06-25 09:01:17,701 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=376, Invalid=1106, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:01:17,701 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:01:17,702 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-25 09:01:17,702 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 09:01:17,703 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-25 09:01:17,703 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2018-06-25 09:01:17,703 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:17,703 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-25 09:01:17,703 INFO ]: Interpolant automaton has 29 states. [2018-06-25 09:01:17,703 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-25 09:01:17,703 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:01:17,703 INFO ]: Found error trace [2018-06-25 09:01:17,703 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:17,703 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:17,704 INFO ]: Analyzing trace with hash -1288320370, now seen corresponding path program 22 times [2018-06-25 09:01:17,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:17,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:17,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:17,704 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:17,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:17,714 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:18,017 INFO ]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:18,017 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:18,017 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-25 09:01:18,024 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:01:18,053 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:01:18,054 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:18,056 INFO ]: Computing forward predicates... [2018-06-25 09:01:18,179 INFO ]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:18,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:18,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-25 09:01:18,198 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:01:18,198 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:01:18,198 INFO ]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:01:18,198 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 28 states. [2018-06-25 09:01:18,370 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:18,370 INFO ]: Finished difference Result 28 states and 29 transitions. [2018-06-25 09:01:18,371 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:01:18,371 INFO ]: Start accepts. Automaton has 28 states. Word has length 26 [2018-06-25 09:01:18,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:18,371 INFO ]: With dead ends: 28 [2018-06-25 09:01:18,371 INFO ]: Without dead ends: 28 [2018-06-25 09:01:18,372 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=414, Invalid=918, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:01:18,372 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 09:01:18,373 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-25 09:01:18,373 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 09:01:18,374 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-25 09:01:18,374 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-25 09:01:18,374 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:18,374 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-25 09:01:18,374 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:01:18,374 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-25 09:01:18,374 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:01:18,374 INFO ]: Found error trace [2018-06-25 09:01:18,374 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:18,374 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:18,375 INFO ]: Analyzing trace with hash -1229697000, now seen corresponding path program 23 times [2018-06-25 09:01:18,375 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:18,375 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:18,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:18,379 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:18,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:18,395 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:18,655 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:18,655 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:18,655 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-25 09:01:18,665 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:01:18,700 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-25 09:01:18,700 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:18,703 INFO ]: Computing forward predicates... [2018-06-25 09:01:18,889 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:18,907 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:18,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-25 09:01:18,908 INFO ]: Interpolant automaton has 22 states [2018-06-25 09:01:18,908 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 09:01:18,908 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:01:18,908 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 22 states. [2018-06-25 09:01:19,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:19,635 INFO ]: Finished difference Result 43 states and 46 transitions. [2018-06-25 09:01:19,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 09:01:19,635 INFO ]: Start accepts. Automaton has 22 states. Word has length 27 [2018-06-25 09:01:19,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:19,636 INFO ]: With dead ends: 43 [2018-06-25 09:01:19,636 INFO ]: Without dead ends: 43 [2018-06-25 09:01:19,636 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=1633, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 09:01:19,636 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 09:01:19,638 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-06-25 09:01:19,638 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:01:19,638 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-25 09:01:19,638 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-06-25 09:01:19,639 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:19,639 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-25 09:01:19,639 INFO ]: Interpolant automaton has 22 states. [2018-06-25 09:01:19,639 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-25 09:01:19,639 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:01:19,639 INFO ]: Found error trace [2018-06-25 09:01:19,639 INFO ]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:19,639 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:19,639 INFO ]: Analyzing trace with hash 587627470, now seen corresponding path program 24 times [2018-06-25 09:01:19,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:19,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:19,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:19,640 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:19,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:19,650 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:20,286 INFO ]: Checked inductivity of 91 backedges. 36 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:20,286 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:20,286 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-25 09:01:20,297 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:01:20,331 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-25 09:01:20,332 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:20,334 INFO ]: Computing forward predicates... [2018-06-25 09:01:20,543 INFO ]: Checked inductivity of 91 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:20,562 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:20,562 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-06-25 09:01:20,562 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:01:20,562 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:01:20,563 INFO ]: CoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:01:20,563 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 32 states. [2018-06-25 09:01:20,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:20,736 INFO ]: Finished difference Result 40 states and 42 transitions. [2018-06-25 09:01:20,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:01:20,738 INFO ]: Start accepts. Automaton has 32 states. Word has length 28 [2018-06-25 09:01:20,739 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:20,739 INFO ]: With dead ends: 40 [2018-06-25 09:01:20,739 INFO ]: Without dead ends: 29 [2018-06-25 09:01:20,739 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=452, Invalid=1354, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 09:01:20,739 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:01:20,741 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-25 09:01:20,741 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 09:01:20,741 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-25 09:01:20,741 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2018-06-25 09:01:20,741 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:20,741 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-25 09:01:20,742 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:01:20,742 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-25 09:01:20,742 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:01:20,742 INFO ]: Found error trace [2018-06-25 09:01:20,742 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:20,742 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:20,742 INFO ]: Analyzing trace with hash 391046532, now seen corresponding path program 25 times [2018-06-25 09:01:20,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:20,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:20,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:20,743 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:20,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:20,754 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:21,103 INFO ]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:21,103 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:21,103 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-25 09:01:21,110 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:21,165 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:21,168 INFO ]: Computing forward predicates... [2018-06-25 09:01:21,518 INFO ]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:21,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:21,540 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-25 09:01:21,540 INFO ]: Interpolant automaton has 31 states [2018-06-25 09:01:21,540 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 09:01:21,540 INFO ]: CoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:01:21,540 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 31 states. [2018-06-25 09:01:21,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:21,663 INFO ]: Finished difference Result 30 states and 31 transitions. [2018-06-25 09:01:21,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 09:01:21,663 INFO ]: Start accepts. Automaton has 31 states. Word has length 28 [2018-06-25 09:01:21,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:21,663 INFO ]: With dead ends: 30 [2018-06-25 09:01:21,663 INFO ]: Without dead ends: 30 [2018-06-25 09:01:21,664 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=505, Invalid=1135, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:01:21,664 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 09:01:21,665 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-25 09:01:21,665 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:01:21,666 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-25 09:01:21,666 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-25 09:01:21,666 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:21,666 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-25 09:01:21,666 INFO ]: Interpolant automaton has 31 states. [2018-06-25 09:01:21,666 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-25 09:01:21,667 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:01:21,667 INFO ]: Found error trace [2018-06-25 09:01:21,667 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:21,667 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:21,667 INFO ]: Analyzing trace with hash -708930590, now seen corresponding path program 26 times [2018-06-25 09:01:21,667 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:21,667 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:21,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:21,668 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:21,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:21,686 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:22,400 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:22,400 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:22,400 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-25 09:01:22,406 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:01:22,451 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:01:22,451 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:22,456 INFO ]: Computing forward predicates... [2018-06-25 09:01:22,776 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:22,794 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:22,795 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-25 09:01:22,795 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:01:22,795 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:01:22,795 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:01:22,795 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 24 states. [2018-06-25 09:01:23,524 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-25 09:01:23,851 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:23,851 INFO ]: Finished difference Result 46 states and 49 transitions. [2018-06-25 09:01:23,851 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 09:01:23,851 INFO ]: Start accepts. Automaton has 24 states. Word has length 29 [2018-06-25 09:01:23,851 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:23,852 INFO ]: With dead ends: 46 [2018-06-25 09:01:23,852 INFO ]: Without dead ends: 46 [2018-06-25 09:01:23,852 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=190, Invalid=1972, Unknown=0, NotChecked=0, Total=2162 [2018-06-25 09:01:23,852 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-25 09:01:23,855 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-06-25 09:01:23,855 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:01:23,855 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-25 09:01:23,855 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-06-25 09:01:23,855 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:23,855 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-25 09:01:23,855 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:01:23,855 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-25 09:01:23,856 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:01:23,856 INFO ]: Found error trace [2018-06-25 09:01:23,856 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:23,856 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:23,856 INFO ]: Analyzing trace with hash -448483004, now seen corresponding path program 27 times [2018-06-25 09:01:23,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:23,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:23,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:23,857 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:23,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:23,868 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:24,266 INFO ]: Checked inductivity of 111 backedges. 45 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:24,266 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:24,266 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-25 09:01:24,272 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:01:24,312 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-25 09:01:24,312 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:24,315 INFO ]: Computing forward predicates... [2018-06-25 09:01:24,803 INFO ]: Checked inductivity of 111 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:24,823 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:24,823 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2018-06-25 09:01:24,824 INFO ]: Interpolant automaton has 35 states [2018-06-25 09:01:24,824 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-25 09:01:24,824 INFO ]: CoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:01:24,824 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 35 states. [2018-06-25 09:01:25,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:25,208 INFO ]: Finished difference Result 43 states and 45 transitions. [2018-06-25 09:01:25,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:01:25,208 INFO ]: Start accepts. Automaton has 35 states. Word has length 30 [2018-06-25 09:01:25,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:25,208 INFO ]: With dead ends: 43 [2018-06-25 09:01:25,208 INFO ]: Without dead ends: 31 [2018-06-25 09:01:25,209 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=535, Invalid=1627, Unknown=0, NotChecked=0, Total=2162 [2018-06-25 09:01:25,209 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:01:25,210 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-25 09:01:25,210 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-25 09:01:25,210 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-25 09:01:25,210 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2018-06-25 09:01:25,210 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:25,210 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-25 09:01:25,210 INFO ]: Interpolant automaton has 35 states. [2018-06-25 09:01:25,210 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-25 09:01:25,211 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:01:25,211 INFO ]: Found error trace [2018-06-25 09:01:25,211 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:25,211 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:25,211 INFO ]: Analyzing trace with hash 2047442510, now seen corresponding path program 28 times [2018-06-25 09:01:25,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:25,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:25,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:25,211 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:25,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:25,220 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:26,367 INFO ]: Checked inductivity of 110 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:26,367 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:26,367 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-25 09:01:26,383 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:01:26,440 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:01:26,440 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:26,443 INFO ]: Computing forward predicates... [2018-06-25 09:01:28,041 INFO ]: Checked inductivity of 110 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:28,060 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:28,060 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2018-06-25 09:01:28,060 INFO ]: Interpolant automaton has 34 states [2018-06-25 09:01:28,060 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 09:01:28,061 INFO ]: CoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:01:28,061 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 34 states. [2018-06-25 09:01:28,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:28,224 INFO ]: Finished difference Result 32 states and 33 transitions. [2018-06-25 09:01:28,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:01:28,224 INFO ]: Start accepts. Automaton has 34 states. Word has length 30 [2018-06-25 09:01:28,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:28,225 INFO ]: With dead ends: 32 [2018-06-25 09:01:28,225 INFO ]: Without dead ends: 32 [2018-06-25 09:01:28,225 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=605, Invalid=1375, Unknown=0, NotChecked=0, Total=1980 [2018-06-25 09:01:28,225 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-25 09:01:28,226 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-25 09:01:28,226 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:01:28,226 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-25 09:01:28,226 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-25 09:01:28,226 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:28,226 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-25 09:01:28,226 INFO ]: Interpolant automaton has 34 states. [2018-06-25 09:01:28,226 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-25 09:01:28,227 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 09:01:28,227 INFO ]: Found error trace [2018-06-25 09:01:28,227 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:28,227 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:28,227 INFO ]: Analyzing trace with hash -900262824, now seen corresponding path program 29 times [2018-06-25 09:01:28,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:28,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:28,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:28,228 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:28,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:28,243 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:28,710 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:28,710 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:28,710 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-25 09:01:28,716 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:01:28,758 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-25 09:01:28,758 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:28,761 INFO ]: Computing forward predicates... [2018-06-25 09:01:28,840 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:28,859 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:28,859 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-25 09:01:28,859 INFO ]: Interpolant automaton has 26 states [2018-06-25 09:01:28,859 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 09:01:28,859 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:01:28,859 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 26 states. [2018-06-25 09:01:29,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:29,609 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-25 09:01:29,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:01:29,609 INFO ]: Start accepts. Automaton has 26 states. Word has length 31 [2018-06-25 09:01:29,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:29,610 INFO ]: With dead ends: 49 [2018-06-25 09:01:29,610 INFO ]: Without dead ends: 49 [2018-06-25 09:01:29,611 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=2343, Unknown=0, NotChecked=0, Total=2550 [2018-06-25 09:01:29,611 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-25 09:01:29,612 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-06-25 09:01:29,612 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 09:01:29,612 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-25 09:01:29,612 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-06-25 09:01:29,613 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:29,613 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-25 09:01:29,613 INFO ]: Interpolant automaton has 26 states. [2018-06-25 09:01:29,613 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-25 09:01:29,615 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 09:01:29,615 INFO ]: Found error trace [2018-06-25 09:01:29,615 INFO ]: trace histogram [12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:29,615 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:29,615 INFO ]: Analyzing trace with hash -2084814962, now seen corresponding path program 30 times [2018-06-25 09:01:29,615 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:29,615 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:29,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:29,615 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:29,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:29,625 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:29,922 INFO ]: Checked inductivity of 133 backedges. 55 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:29,922 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:29,922 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-25 09:01:29,927 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:01:29,967 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-25 09:01:29,967 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:29,970 INFO ]: Computing forward predicates... [2018-06-25 09:01:30,212 INFO ]: Checked inductivity of 133 backedges. 78 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:30,232 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:30,232 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 38 [2018-06-25 09:01:30,232 INFO ]: Interpolant automaton has 38 states [2018-06-25 09:01:30,232 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-25 09:01:30,232 INFO ]: CoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 09:01:30,232 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 38 states. [2018-06-25 09:01:30,413 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:30,413 INFO ]: Finished difference Result 46 states and 48 transitions. [2018-06-25 09:01:30,414 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:01:30,414 INFO ]: Start accepts. Automaton has 38 states. Word has length 32 [2018-06-25 09:01:30,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:30,414 INFO ]: With dead ends: 46 [2018-06-25 09:01:30,414 INFO ]: Without dead ends: 33 [2018-06-25 09:01:30,415 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=625, Invalid=1925, Unknown=0, NotChecked=0, Total=2550 [2018-06-25 09:01:30,415 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-25 09:01:30,416 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-25 09:01:30,416 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 09:01:30,417 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-25 09:01:30,417 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2018-06-25 09:01:30,417 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:30,417 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-25 09:01:30,417 INFO ]: Interpolant automaton has 38 states. [2018-06-25 09:01:30,417 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-25 09:01:30,417 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 09:01:30,417 INFO ]: Found error trace [2018-06-25 09:01:30,417 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:30,417 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:30,417 INFO ]: Analyzing trace with hash -2020535356, now seen corresponding path program 31 times [2018-06-25 09:01:30,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:30,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:30,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:30,418 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:30,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:30,427 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:30,651 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:30,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:30,651 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-25 09:01:30,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:30,692 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:30,695 INFO ]: Computing forward predicates... [2018-06-25 09:01:30,879 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:30,898 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:30,898 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2018-06-25 09:01:30,898 INFO ]: Interpolant automaton has 37 states [2018-06-25 09:01:30,898 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-25 09:01:30,898 INFO ]: CoverageRelationStatistics Valid=336, Invalid=996, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:01:30,898 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 37 states. [2018-06-25 09:01:31,172 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:31,172 INFO ]: Finished difference Result 34 states and 35 transitions. [2018-06-25 09:01:31,174 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:01:31,174 INFO ]: Start accepts. Automaton has 37 states. Word has length 32 [2018-06-25 09:01:31,174 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:31,174 INFO ]: With dead ends: 34 [2018-06-25 09:01:31,174 INFO ]: Without dead ends: 34 [2018-06-25 09:01:31,175 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=714, Invalid=1638, Unknown=0, NotChecked=0, Total=2352 [2018-06-25 09:01:31,175 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:01:31,176 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-25 09:01:31,176 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 09:01:31,176 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-25 09:01:31,177 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-06-25 09:01:31,177 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:31,177 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-25 09:01:31,177 INFO ]: Interpolant automaton has 37 states. [2018-06-25 09:01:31,177 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-25 09:01:31,177 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 09:01:31,177 INFO ]: Found error trace [2018-06-25 09:01:31,177 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:31,177 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:31,177 INFO ]: Analyzing trace with hash 1841442210, now seen corresponding path program 32 times [2018-06-25 09:01:31,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:31,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:31,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:31,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:31,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:31,190 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:31,663 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:31,663 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:31,663 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-25 09:01:31,668 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:01:31,708 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:01:31,708 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:31,712 INFO ]: Computing forward predicates... [2018-06-25 09:01:31,824 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:31,859 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:31,859 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-25 09:01:31,859 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:01:31,859 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:01:31,860 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:01:31,860 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 28 states. [2018-06-25 09:01:32,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:32,656 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-25 09:01:32,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 09:01:32,656 INFO ]: Start accepts. Automaton has 28 states. Word has length 33 [2018-06-25 09:01:32,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:32,656 INFO ]: With dead ends: 52 [2018-06-25 09:01:32,656 INFO ]: Without dead ends: 52 [2018-06-25 09:01:32,657 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=2746, Unknown=0, NotChecked=0, Total=2970 [2018-06-25 09:01:32,657 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-25 09:01:32,660 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 36. [2018-06-25 09:01:32,660 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 09:01:32,660 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-25 09:01:32,660 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-06-25 09:01:32,660 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:32,660 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-25 09:01:32,660 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:01:32,660 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-25 09:01:32,660 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 09:01:32,660 INFO ]: Found error trace [2018-06-25 09:01:32,661 INFO ]: trace histogram [13, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:32,661 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:32,661 INFO ]: Analyzing trace with hash 1303662468, now seen corresponding path program 33 times [2018-06-25 09:01:32,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:32,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:32,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:32,661 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:32,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:32,671 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:33,021 INFO ]: Checked inductivity of 157 backedges. 66 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:33,021 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:33,021 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-25 09:01:33,027 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:01:33,072 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-25 09:01:33,072 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:33,075 INFO ]: Computing forward predicates... [2018-06-25 09:01:33,469 INFO ]: Checked inductivity of 157 backedges. 91 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:33,488 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:33,488 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 41 [2018-06-25 09:01:33,488 INFO ]: Interpolant automaton has 41 states [2018-06-25 09:01:33,489 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-25 09:01:33,489 INFO ]: CoverageRelationStatistics Valid=393, Invalid=1247, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:01:33,489 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 41 states. [2018-06-25 09:01:33,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:33,724 INFO ]: Finished difference Result 49 states and 51 transitions. [2018-06-25 09:01:33,725 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 09:01:33,725 INFO ]: Start accepts. Automaton has 41 states. Word has length 34 [2018-06-25 09:01:33,725 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:33,725 INFO ]: With dead ends: 49 [2018-06-25 09:01:33,725 INFO ]: Without dead ends: 35 [2018-06-25 09:01:33,726 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=722, Invalid=2248, Unknown=0, NotChecked=0, Total=2970 [2018-06-25 09:01:33,726 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-25 09:01:33,726 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-25 09:01:33,726 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:01:33,727 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-25 09:01:33,727 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2018-06-25 09:01:33,727 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:33,727 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-25 09:01:33,727 INFO ]: Interpolant automaton has 41 states. [2018-06-25 09:01:33,727 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-25 09:01:33,727 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 09:01:33,727 INFO ]: Found error trace [2018-06-25 09:01:33,727 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:33,727 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:33,727 INFO ]: Analyzing trace with hash -998637042, now seen corresponding path program 34 times [2018-06-25 09:01:33,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:33,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:33,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:33,727 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:33,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:33,736 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:34,168 INFO ]: Checked inductivity of 156 backedges. 78 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:34,168 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:34,168 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-25 09:01:34,182 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:01:34,225 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:01:34,226 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:34,228 INFO ]: Computing forward predicates... [2018-06-25 09:01:34,394 INFO ]: Checked inductivity of 156 backedges. 78 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:34,413 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:34,414 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2018-06-25 09:01:34,414 INFO ]: Interpolant automaton has 40 states [2018-06-25 09:01:34,414 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 09:01:34,414 INFO ]: CoverageRelationStatistics Valid=390, Invalid=1170, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:01:34,414 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 40 states. [2018-06-25 09:01:34,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:34,653 INFO ]: Finished difference Result 36 states and 37 transitions. [2018-06-25 09:01:34,653 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:01:34,653 INFO ]: Start accepts. Automaton has 40 states. Word has length 34 [2018-06-25 09:01:34,653 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:34,653 INFO ]: With dead ends: 36 [2018-06-25 09:01:34,653 INFO ]: Without dead ends: 36 [2018-06-25 09:01:34,654 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=832, Invalid=1924, Unknown=0, NotChecked=0, Total=2756 [2018-06-25 09:01:34,654 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-25 09:01:34,655 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-25 09:01:34,655 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 09:01:34,655 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-25 09:01:34,655 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-25 09:01:34,655 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:34,655 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-25 09:01:34,655 INFO ]: Interpolant automaton has 40 states. [2018-06-25 09:01:34,655 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-25 09:01:34,656 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 09:01:34,656 INFO ]: Found error trace [2018-06-25 09:01:34,656 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:34,656 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:34,656 INFO ]: Analyzing trace with hash -839448424, now seen corresponding path program 35 times [2018-06-25 09:01:34,656 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:34,656 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:34,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:34,656 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:34,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:34,669 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:35,276 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:35,277 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:35,277 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-25 09:01:35,283 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:01:35,352 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-25 09:01:35,352 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:35,356 INFO ]: Computing forward predicates... [2018-06-25 09:01:35,457 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:35,484 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:35,484 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-25 09:01:35,484 INFO ]: Interpolant automaton has 30 states [2018-06-25 09:01:35,485 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 09:01:35,485 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:01:35,485 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 30 states. [2018-06-25 09:01:36,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:36,480 INFO ]: Finished difference Result 55 states and 58 transitions. [2018-06-25 09:01:36,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 09:01:36,480 INFO ]: Start accepts. Automaton has 30 states. Word has length 35 [2018-06-25 09:01:36,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:36,481 INFO ]: With dead ends: 55 [2018-06-25 09:01:36,481 INFO ]: Without dead ends: 55 [2018-06-25 09:01:36,481 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=3181, Unknown=0, NotChecked=0, Total=3422 [2018-06-25 09:01:36,481 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-25 09:01:36,482 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-06-25 09:01:36,482 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 09:01:36,482 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-25 09:01:36,482 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-06-25 09:01:36,483 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:36,483 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-25 09:01:36,483 INFO ]: Interpolant automaton has 30 states. [2018-06-25 09:01:36,483 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-25 09:01:36,483 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:01:36,483 INFO ]: Found error trace [2018-06-25 09:01:36,483 INFO ]: trace histogram [14, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:36,483 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:36,483 INFO ]: Analyzing trace with hash -199568562, now seen corresponding path program 36 times [2018-06-25 09:01:36,483 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:36,483 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:36,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:36,483 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:36,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:36,492 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:36,799 INFO ]: Checked inductivity of 183 backedges. 78 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:36,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:36,799 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-25 09:01:36,805 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:01:36,852 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-25 09:01:36,890 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:36,894 INFO ]: Computing forward predicates... [2018-06-25 09:01:37,184 INFO ]: Checked inductivity of 183 backedges. 105 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:37,203 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:37,203 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 44 [2018-06-25 09:01:37,203 INFO ]: Interpolant automaton has 44 states [2018-06-25 09:01:37,203 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-25 09:01:37,203 INFO ]: CoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892 [2018-06-25 09:01:37,203 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 44 states. [2018-06-25 09:01:37,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:37,483 INFO ]: Finished difference Result 52 states and 54 transitions. [2018-06-25 09:01:37,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 09:01:37,486 INFO ]: Start accepts. Automaton has 44 states. Word has length 36 [2018-06-25 09:01:37,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:37,486 INFO ]: With dead ends: 52 [2018-06-25 09:01:37,486 INFO ]: Without dead ends: 37 [2018-06-25 09:01:37,486 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=826, Invalid=2596, Unknown=0, NotChecked=0, Total=3422 [2018-06-25 09:01:37,486 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:01:37,487 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-25 09:01:37,487 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-25 09:01:37,488 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-25 09:01:37,488 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2018-06-25 09:01:37,488 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:37,488 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-25 09:01:37,488 INFO ]: Interpolant automaton has 44 states. [2018-06-25 09:01:37,488 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-25 09:01:37,488 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:01:37,488 INFO ]: Found error trace [2018-06-25 09:01:37,488 INFO ]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:37,488 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:37,488 INFO ]: Analyzing trace with hash 1443590660, now seen corresponding path program 37 times [2018-06-25 09:01:37,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:37,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:37,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:37,489 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:37,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:37,496 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:37,815 INFO ]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:37,815 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:37,815 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-25 09:01:37,820 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:37,861 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:37,864 INFO ]: Computing forward predicates... [2018-06-25 09:01:38,101 INFO ]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:38,119 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:38,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 43 [2018-06-25 09:01:38,120 INFO ]: Interpolant automaton has 43 states [2018-06-25 09:01:38,120 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-25 09:01:38,120 INFO ]: CoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 09:01:38,120 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 43 states. [2018-06-25 09:01:38,457 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:38,457 INFO ]: Finished difference Result 38 states and 39 transitions. [2018-06-25 09:01:38,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 09:01:38,457 INFO ]: Start accepts. Automaton has 43 states. Word has length 36 [2018-06-25 09:01:38,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:38,457 INFO ]: With dead ends: 38 [2018-06-25 09:01:38,457 INFO ]: Without dead ends: 38 [2018-06-25 09:01:38,458 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=959, Invalid=2233, Unknown=0, NotChecked=0, Total=3192 [2018-06-25 09:01:38,458 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-25 09:01:38,458 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-25 09:01:38,459 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 09:01:38,459 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-25 09:01:38,459 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-06-25 09:01:38,459 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:38,459 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-25 09:01:38,459 INFO ]: Interpolant automaton has 43 states. [2018-06-25 09:01:38,459 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-25 09:01:38,459 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 09:01:38,459 INFO ]: Found error trace [2018-06-25 09:01:38,459 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:38,459 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:38,460 INFO ]: Analyzing trace with hash 1855166306, now seen corresponding path program 38 times [2018-06-25 09:01:38,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:38,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:38,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:38,460 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:38,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:38,473 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:38,975 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:38,975 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:38,975 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-25 09:01:38,980 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:01:39,024 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:01:39,024 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:39,029 INFO ]: Computing forward predicates... [2018-06-25 09:01:39,172 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:39,191 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:39,191 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-25 09:01:39,191 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:01:39,191 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:01:39,191 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:01:39,191 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 32 states. [2018-06-25 09:01:40,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:40,224 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-25 09:01:40,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-25 09:01:40,224 INFO ]: Start accepts. Automaton has 32 states. Word has length 37 [2018-06-25 09:01:40,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:40,224 INFO ]: With dead ends: 58 [2018-06-25 09:01:40,224 INFO ]: Without dead ends: 58 [2018-06-25 09:01:40,225 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 26 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=258, Invalid=3648, Unknown=0, NotChecked=0, Total=3906 [2018-06-25 09:01:40,225 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-25 09:01:40,226 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 40. [2018-06-25 09:01:40,226 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 09:01:40,226 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-06-25 09:01:40,226 INFO ]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-06-25 09:01:40,227 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:40,227 INFO ]: Abstraction has 40 states and 42 transitions. [2018-06-25 09:01:40,227 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:01:40,227 INFO ]: Start isEmpty. Operand 40 states and 42 transitions. [2018-06-25 09:01:40,227 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 09:01:40,227 INFO ]: Found error trace [2018-06-25 09:01:40,227 INFO ]: trace histogram [15, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:40,227 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:40,227 INFO ]: Analyzing trace with hash 1729109444, now seen corresponding path program 39 times [2018-06-25 09:01:40,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:40,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:40,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:40,228 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:40,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:40,236 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:40,589 INFO ]: Checked inductivity of 211 backedges. 91 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:40,589 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:40,589 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-25 09:01:40,595 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:01:40,647 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-25 09:01:40,647 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:40,650 INFO ]: Computing forward predicates... [2018-06-25 09:01:40,983 INFO ]: Checked inductivity of 211 backedges. 120 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:41,002 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:41,002 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 47 [2018-06-25 09:01:41,002 INFO ]: Interpolant automaton has 47 states [2018-06-25 09:01:41,003 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-25 09:01:41,003 INFO ]: CoverageRelationStatistics Valid=513, Invalid=1649, Unknown=0, NotChecked=0, Total=2162 [2018-06-25 09:01:41,003 INFO ]: Start difference. First operand 40 states and 42 transitions. Second operand 47 states. [2018-06-25 09:01:41,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:41,306 INFO ]: Finished difference Result 55 states and 57 transitions. [2018-06-25 09:01:41,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-25 09:01:41,306 INFO ]: Start accepts. Automaton has 47 states. Word has length 38 [2018-06-25 09:01:41,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:41,306 INFO ]: With dead ends: 55 [2018-06-25 09:01:41,306 INFO ]: Without dead ends: 39 [2018-06-25 09:01:41,307 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=937, Invalid=2969, Unknown=0, NotChecked=0, Total=3906 [2018-06-25 09:01:41,307 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:01:41,308 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-25 09:01:41,308 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 09:01:41,308 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-25 09:01:41,308 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2018-06-25 09:01:41,308 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:41,308 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-25 09:01:41,308 INFO ]: Interpolant automaton has 47 states. [2018-06-25 09:01:41,308 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-25 09:01:41,309 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 09:01:41,309 INFO ]: Found error trace [2018-06-25 09:01:41,309 INFO ]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:41,309 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:41,309 INFO ]: Analyzing trace with hash 1127437774, now seen corresponding path program 40 times [2018-06-25 09:01:41,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:41,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:41,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:41,310 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:41,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:41,320 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:42,079 INFO ]: Checked inductivity of 210 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:42,079 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:42,107 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-25 09:01:42,113 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:01:42,159 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:01:42,159 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:42,162 INFO ]: Computing forward predicates... [2018-06-25 09:01:42,389 INFO ]: Checked inductivity of 210 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:42,408 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:42,408 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2018-06-25 09:01:42,408 INFO ]: Interpolant automaton has 46 states [2018-06-25 09:01:42,409 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-25 09:01:42,409 INFO ]: CoverageRelationStatistics Valid=510, Invalid=1560, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 09:01:42,409 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 46 states. [2018-06-25 09:01:42,815 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:42,815 INFO ]: Finished difference Result 40 states and 41 transitions. [2018-06-25 09:01:42,815 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 09:01:42,815 INFO ]: Start accepts. Automaton has 46 states. Word has length 38 [2018-06-25 09:01:42,815 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:42,815 INFO ]: With dead ends: 40 [2018-06-25 09:01:42,815 INFO ]: Without dead ends: 40 [2018-06-25 09:01:42,816 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1095, Invalid=2565, Unknown=0, NotChecked=0, Total=3660 [2018-06-25 09:01:42,816 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 09:01:42,817 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-25 09:01:42,817 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 09:01:42,817 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-25 09:01:42,817 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-06-25 09:01:42,817 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:42,817 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-25 09:01:42,817 INFO ]: Interpolant automaton has 46 states. [2018-06-25 09:01:42,817 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-25 09:01:42,818 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 09:01:42,818 INFO ]: Found error trace [2018-06-25 09:01:42,818 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:42,818 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:42,818 INFO ]: Analyzing trace with hash 644361432, now seen corresponding path program 41 times [2018-06-25 09:01:42,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:42,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:42,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:42,818 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:42,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:42,837 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:43,567 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:43,567 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:43,567 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-25 09:01:43,573 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:01:43,626 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-25 09:01:43,626 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:43,630 INFO ]: Computing forward predicates... [2018-06-25 09:01:43,744 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:43,763 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:43,763 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-25 09:01:43,763 INFO ]: Interpolant automaton has 34 states [2018-06-25 09:01:43,763 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 09:01:43,763 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:01:43,763 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 34 states. [2018-06-25 09:01:45,053 WARN ]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-06-25 09:01:45,054 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:45,054 INFO ]: Finished difference Result 61 states and 64 transitions. [2018-06-25 09:01:45,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 09:01:45,054 INFO ]: Start accepts. Automaton has 34 states. Word has length 39 [2018-06-25 09:01:45,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:45,054 INFO ]: With dead ends: 61 [2018-06-25 09:01:45,054 INFO ]: Without dead ends: 61 [2018-06-25 09:01:45,055 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 28 SyntacticMatches, 12 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=275, Invalid=4147, Unknown=0, NotChecked=0, Total=4422 [2018-06-25 09:01:45,055 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-25 09:01:45,056 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 42. [2018-06-25 09:01:45,056 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 09:01:45,056 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-06-25 09:01:45,056 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-06-25 09:01:45,056 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:45,056 INFO ]: Abstraction has 42 states and 44 transitions. [2018-06-25 09:01:45,056 INFO ]: Interpolant automaton has 34 states. [2018-06-25 09:01:45,056 INFO ]: Start isEmpty. Operand 42 states and 44 transitions. [2018-06-25 09:01:45,057 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 09:01:45,057 INFO ]: Found error trace [2018-06-25 09:01:45,057 INFO ]: trace histogram [16, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:45,058 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:45,058 INFO ]: Analyzing trace with hash -1446103282, now seen corresponding path program 42 times [2018-06-25 09:01:45,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:45,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:45,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:45,058 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:45,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:45,066 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:45,959 INFO ]: Checked inductivity of 241 backedges. 105 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:45,959 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:45,959 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-25 09:01:45,965 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:01:46,018 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-25 09:01:46,018 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:46,021 INFO ]: Computing forward predicates... [2018-06-25 09:01:46,398 INFO ]: Checked inductivity of 241 backedges. 136 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:46,417 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:46,417 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 50 [2018-06-25 09:01:46,417 INFO ]: Interpolant automaton has 50 states [2018-06-25 09:01:46,417 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-25 09:01:46,417 INFO ]: CoverageRelationStatistics Valid=579, Invalid=1871, Unknown=0, NotChecked=0, Total=2450 [2018-06-25 09:01:46,417 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 50 states. [2018-06-25 09:01:46,860 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:46,860 INFO ]: Finished difference Result 58 states and 60 transitions. [2018-06-25 09:01:46,860 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 09:01:46,860 INFO ]: Start accepts. Automaton has 50 states. Word has length 40 [2018-06-25 09:01:46,860 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:46,860 INFO ]: With dead ends: 58 [2018-06-25 09:01:46,860 INFO ]: Without dead ends: 41 [2018-06-25 09:01:46,860 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1055, Invalid=3367, Unknown=0, NotChecked=0, Total=4422 [2018-06-25 09:01:46,860 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-25 09:01:46,862 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-25 09:01:46,862 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-25 09:01:46,862 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-25 09:01:46,862 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2018-06-25 09:01:46,862 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:46,862 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-25 09:01:46,862 INFO ]: Interpolant automaton has 50 states. [2018-06-25 09:01:46,862 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-25 09:01:46,862 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 09:01:46,862 INFO ]: Found error trace [2018-06-25 09:01:46,862 INFO ]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:46,862 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:46,863 INFO ]: Analyzing trace with hash 1376911428, now seen corresponding path program 43 times [2018-06-25 09:01:46,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:46,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:46,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:46,863 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:46,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:46,872 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:47,207 INFO ]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:47,207 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:47,207 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:47,213 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:47,259 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:47,263 INFO ]: Computing forward predicates... [2018-06-25 09:01:47,570 INFO ]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:47,589 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:47,589 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 49 [2018-06-25 09:01:47,589 INFO ]: Interpolant automaton has 49 states [2018-06-25 09:01:47,590 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-25 09:01:47,590 INFO ]: CoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2018-06-25 09:01:47,590 INFO ]: Start difference. First operand 41 states and 42 transitions. Second operand 49 states. [2018-06-25 09:01:47,996 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:47,996 INFO ]: Finished difference Result 42 states and 43 transitions. [2018-06-25 09:01:47,996 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-25 09:01:47,996 INFO ]: Start accepts. Automaton has 49 states. Word has length 40 [2018-06-25 09:01:47,996 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:47,996 INFO ]: With dead ends: 42 [2018-06-25 09:01:47,996 INFO ]: Without dead ends: 42 [2018-06-25 09:01:47,997 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1240, Invalid=2920, Unknown=0, NotChecked=0, Total=4160 [2018-06-25 09:01:47,997 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 09:01:47,998 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-25 09:01:47,998 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 09:01:47,998 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-06-25 09:01:47,999 INFO ]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-06-25 09:01:47,999 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:47,999 INFO ]: Abstraction has 42 states and 43 transitions. [2018-06-25 09:01:47,999 INFO ]: Interpolant automaton has 49 states. [2018-06-25 09:01:47,999 INFO ]: Start isEmpty. Operand 42 states and 43 transitions. [2018-06-25 09:01:47,999 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-25 09:01:47,999 INFO ]: Found error trace [2018-06-25 09:01:47,999 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:47,999 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:47,999 INFO ]: Analyzing trace with hash -211889886, now seen corresponding path program 44 times [2018-06-25 09:01:47,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:47,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:48,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:48,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:01:48,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:48,013 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:48,578 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:48,578 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:48,578 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:48,583 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:01:48,632 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:01:48,632 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:48,637 INFO ]: Computing forward predicates... [2018-06-25 09:01:48,866 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:48,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:48,885 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-25 09:01:48,885 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:01:48,885 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:01:48,885 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:01:48,886 INFO ]: Start difference. First operand 42 states and 43 transitions. Second operand 36 states. [2018-06-25 09:01:50,220 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:50,220 INFO ]: Finished difference Result 64 states and 67 transitions. [2018-06-25 09:01:50,220 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-25 09:01:50,220 INFO ]: Start accepts. Automaton has 36 states. Word has length 41 [2018-06-25 09:01:50,220 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:50,221 INFO ]: With dead ends: 64 [2018-06-25 09:01:50,221 INFO ]: Without dead ends: 64 [2018-06-25 09:01:50,221 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 29 SyntacticMatches, 13 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=292, Invalid=4678, Unknown=0, NotChecked=0, Total=4970 [2018-06-25 09:01:50,221 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-25 09:01:50,222 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 44. [2018-06-25 09:01:50,222 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-25 09:01:50,223 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-06-25 09:01:50,223 INFO ]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-06-25 09:01:50,223 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:50,223 INFO ]: Abstraction has 44 states and 46 transitions. [2018-06-25 09:01:50,223 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:01:50,223 INFO ]: Start isEmpty. Operand 44 states and 46 transitions. [2018-06-25 09:01:50,223 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 09:01:50,223 INFO ]: Found error trace [2018-06-25 09:01:50,223 INFO ]: trace histogram [17, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:50,223 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:50,223 INFO ]: Analyzing trace with hash 2074876932, now seen corresponding path program 45 times [2018-06-25 09:01:50,223 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:50,223 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:50,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:50,224 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:50,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:50,233 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:50,945 INFO ]: Checked inductivity of 273 backedges. 120 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:50,945 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:50,945 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:50,950 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:01:51,009 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-25 09:01:51,009 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:51,013 INFO ]: Computing forward predicates... [2018-06-25 09:01:52,782 INFO ]: Checked inductivity of 273 backedges. 153 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:52,801 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:52,801 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 53 [2018-06-25 09:01:52,801 INFO ]: Interpolant automaton has 53 states [2018-06-25 09:01:52,802 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-25 09:01:52,802 INFO ]: CoverageRelationStatistics Valid=649, Invalid=2107, Unknown=0, NotChecked=0, Total=2756 [2018-06-25 09:01:52,802 INFO ]: Start difference. First operand 44 states and 46 transitions. Second operand 53 states. [2018-06-25 09:01:53,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:53,236 INFO ]: Finished difference Result 61 states and 63 transitions. [2018-06-25 09:01:53,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-25 09:01:53,236 INFO ]: Start accepts. Automaton has 53 states. Word has length 42 [2018-06-25 09:01:53,236 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:53,236 INFO ]: With dead ends: 61 [2018-06-25 09:01:53,236 INFO ]: Without dead ends: 43 [2018-06-25 09:01:53,237 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1180, Invalid=3790, Unknown=0, NotChecked=0, Total=4970 [2018-06-25 09:01:53,237 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 09:01:53,238 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-25 09:01:53,238 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-25 09:01:53,239 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-06-25 09:01:53,239 INFO ]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 42 [2018-06-25 09:01:53,239 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:53,239 INFO ]: Abstraction has 43 states and 44 transitions. [2018-06-25 09:01:53,239 INFO ]: Interpolant automaton has 53 states. [2018-06-25 09:01:53,239 INFO ]: Start isEmpty. Operand 43 states and 44 transitions. [2018-06-25 09:01:53,239 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 09:01:53,239 INFO ]: Found error trace [2018-06-25 09:01:53,239 INFO ]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:53,239 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:53,239 INFO ]: Analyzing trace with hash -605980274, now seen corresponding path program 46 times [2018-06-25 09:01:53,239 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:53,239 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:53,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:53,240 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:53,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:53,249 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:53,596 INFO ]: Checked inductivity of 272 backedges. 136 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:53,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:53,596 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:53,601 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:01:53,653 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:01:53,653 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:53,657 INFO ]: Computing forward predicates... [2018-06-25 09:01:53,968 INFO ]: Checked inductivity of 272 backedges. 136 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:53,988 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:53,988 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 52 [2018-06-25 09:01:53,988 INFO ]: Interpolant automaton has 52 states [2018-06-25 09:01:53,988 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-25 09:01:53,988 INFO ]: CoverageRelationStatistics Valid=646, Invalid=2006, Unknown=0, NotChecked=0, Total=2652 [2018-06-25 09:01:53,988 INFO ]: Start difference. First operand 43 states and 44 transitions. Second operand 52 states. [2018-06-25 09:01:54,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:54,480 INFO ]: Finished difference Result 44 states and 45 transitions. [2018-06-25 09:01:54,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 09:01:54,480 INFO ]: Start accepts. Automaton has 52 states. Word has length 42 [2018-06-25 09:01:54,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:54,481 INFO ]: With dead ends: 44 [2018-06-25 09:01:54,481 INFO ]: Without dead ends: 44 [2018-06-25 09:01:54,481 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1394, Invalid=3298, Unknown=0, NotChecked=0, Total=4692 [2018-06-25 09:01:54,481 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-25 09:01:54,482 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-25 09:01:54,482 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-25 09:01:54,482 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-06-25 09:01:54,482 INFO ]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-06-25 09:01:54,482 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:54,482 INFO ]: Abstraction has 44 states and 45 transitions. [2018-06-25 09:01:54,482 INFO ]: Interpolant automaton has 52 states. [2018-06-25 09:01:54,482 INFO ]: Start isEmpty. Operand 44 states and 45 transitions. [2018-06-25 09:01:54,483 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-25 09:01:54,483 INFO ]: Found error trace [2018-06-25 09:01:54,483 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:54,483 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:54,483 INFO ]: Analyzing trace with hash -1551990504, now seen corresponding path program 47 times [2018-06-25 09:01:54,483 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:54,483 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:54,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:54,483 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:54,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:54,498 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:55,117 INFO ]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:55,117 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:55,117 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:55,123 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:01:55,186 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-25 09:01:55,186 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:55,190 INFO ]: Computing forward predicates... [2018-06-25 09:01:55,317 INFO ]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:55,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:55,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-06-25 09:01:55,336 INFO ]: Interpolant automaton has 38 states [2018-06-25 09:01:55,336 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-25 09:01:55,336 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 09:01:55,336 INFO ]: Start difference. First operand 44 states and 45 transitions. Second operand 38 states. [2018-06-25 09:01:56,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:56,746 INFO ]: Finished difference Result 67 states and 70 transitions. [2018-06-25 09:01:56,746 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-25 09:01:56,746 INFO ]: Start accepts. Automaton has 38 states. Word has length 43 [2018-06-25 09:01:56,746 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:56,747 INFO ]: With dead ends: 67 [2018-06-25 09:01:56,747 INFO ]: Without dead ends: 67 [2018-06-25 09:01:56,747 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 32 SyntacticMatches, 12 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=309, Invalid=5241, Unknown=0, NotChecked=0, Total=5550 [2018-06-25 09:01:56,747 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-25 09:01:56,748 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 46. [2018-06-25 09:01:56,748 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-25 09:01:56,748 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-06-25 09:01:56,748 INFO ]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2018-06-25 09:01:56,748 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:56,748 INFO ]: Abstraction has 46 states and 48 transitions. [2018-06-25 09:01:56,748 INFO ]: Interpolant automaton has 38 states. [2018-06-25 09:01:56,748 INFO ]: Start isEmpty. Operand 46 states and 48 transitions. [2018-06-25 09:01:56,749 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 09:01:56,749 INFO ]: Found error trace [2018-06-25 09:01:56,749 INFO ]: trace histogram [18, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:56,749 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:56,749 INFO ]: Analyzing trace with hash -813536562, now seen corresponding path program 48 times [2018-06-25 09:01:56,749 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:56,749 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:56,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:56,749 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:56,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:56,761 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:57,193 INFO ]: Checked inductivity of 307 backedges. 136 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:57,193 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:01:57,193 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:01:57,198 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:01:57,278 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-25 09:01:57,278 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:01:57,281 INFO ]: Computing forward predicates... [2018-06-25 09:01:57,802 INFO ]: Checked inductivity of 307 backedges. 171 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:01:57,822 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:01:57,822 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 56 [2018-06-25 09:01:57,822 INFO ]: Interpolant automaton has 56 states [2018-06-25 09:01:57,822 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-25 09:01:57,822 INFO ]: CoverageRelationStatistics Valid=723, Invalid=2357, Unknown=0, NotChecked=0, Total=3080 [2018-06-25 09:01:57,823 INFO ]: Start difference. First operand 46 states and 48 transitions. Second operand 56 states. [2018-06-25 09:01:58,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:01:58,230 INFO ]: Finished difference Result 64 states and 66 transitions. [2018-06-25 09:01:58,230 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-25 09:01:58,230 INFO ]: Start accepts. Automaton has 56 states. Word has length 44 [2018-06-25 09:01:58,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:01:58,230 INFO ]: With dead ends: 64 [2018-06-25 09:01:58,230 INFO ]: Without dead ends: 45 [2018-06-25 09:01:58,230 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1312, Invalid=4238, Unknown=0, NotChecked=0, Total=5550 [2018-06-25 09:01:58,230 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 09:01:58,231 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-25 09:01:58,231 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 09:01:58,232 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-06-25 09:01:58,232 INFO ]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 44 [2018-06-25 09:01:58,232 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:01:58,232 INFO ]: Abstraction has 45 states and 46 transitions. [2018-06-25 09:01:58,232 INFO ]: Interpolant automaton has 56 states. [2018-06-25 09:01:58,232 INFO ]: Start isEmpty. Operand 45 states and 46 transitions. [2018-06-25 09:01:58,232 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 09:01:58,232 INFO ]: Found error trace [2018-06-25 09:01:58,232 INFO ]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:01:58,232 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:01:58,232 INFO ]: Analyzing trace with hash 1979235972, now seen corresponding path program 49 times [2018-06-25 09:01:58,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:01:58,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:01:58,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:58,233 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:01:58,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:01:58,242 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 09:01:59,594 WARN ]: Verification canceled [2018-06-25 09:01:59,602 WARN ]: Timeout [2018-06-25 09:01:59,602 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:01:59 BoogieIcfgContainer [2018-06-25 09:01:59,602 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:01:59,603 INFO ]: Toolchain (without parser) took 58011.10 ms. Allocated memory was 307.8 MB in the beginning and 647.5 MB in the end (delta: 339.7 MB). Free memory was 264.1 MB in the beginning and 588.3 MB in the end (delta: -324.1 MB). Peak memory consumption was 15.6 MB. Max. memory is 3.6 GB. [2018-06-25 09:01:59,604 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:01:59,605 INFO ]: ChcToBoogie took 57.29 ms. Allocated memory is still 307.8 MB. Free memory was 264.1 MB in the beginning and 262.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:01:59,605 INFO ]: Boogie Preprocessor took 31.94 ms. Allocated memory is still 307.8 MB. Free memory was 262.1 MB in the beginning and 260.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:01:59,605 INFO ]: RCFGBuilder took 307.77 ms. Allocated memory is still 307.8 MB. Free memory was 260.0 MB in the beginning and 252.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:01:59,606 INFO ]: TraceAbstraction took 57594.23 ms. Allocated memory was 307.8 MB in the beginning and 647.5 MB in the end (delta: 339.7 MB). Free memory was 252.1 MB in the beginning and 588.3 MB in the end (delta: -336.2 MB). Peak memory consumption was 3.5 MB. Max. memory is 3.6 GB. [2018-06-25 09:01:59,613 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 57.29 ms. Allocated memory is still 307.8 MB. Free memory was 264.1 MB in the beginning and 262.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 31.94 ms. Allocated memory is still 307.8 MB. Free memory was 262.1 MB in the beginning and 260.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 307.77 ms. Allocated memory is still 307.8 MB. Free memory was 260.0 MB in the beginning and 252.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57594.23 ms. Allocated memory was 307.8 MB in the beginning and 647.5 MB in the end (delta: 339.7 MB). Free memory was 252.1 MB in the beginning and 588.3 MB in the end (delta: -336.2 MB). Peak memory consumption was 3.5 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 45 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 57.4s OverallTime, 52 OverallIterations, 18 TraceHistogramMax, 20.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 457 SDtfs, 1872 SDslu, 5877 SDs, 0 SdLazy, 14460 SolverSat, 2522 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3136 GetRequests, 1002 SyntacticMatches, 142 SemanticMatches, 1992 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18346 ImplicationChecksByTransitivity, 40.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=50, 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, 51 MinimizatonAttempts, 221 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 31.5s InterpolantComputationTime, 2744 NumberOfCodeBlocks, 2744 NumberOfCodeBlocksAsserted, 242 NumberOfCheckSat, 2643 ConstructedInterpolants, 0 QuantifiedInterpolants, 365958 SizeOfPredicates, 267 NumberOfNonLiveVariables, 16205 ConjunctsInSsa, 3650 ConjunctsInUnsatCore, 101 InterpolantComputations, 2 PerfectInterpolantSequences, 3587/10744 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/upcount_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-01-59-623.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/upcount_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-01-59-623.csv Completed graceful shutdown