java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/31.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:53:12,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:53:12,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:53:12,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:53:12,519 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:53:12,520 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:53:12,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:53:12,523 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:53:12,524 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:53:12,525 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:53:12,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:53:12,526 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:53:12,527 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:53:12,528 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:53:12,529 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:53:12,529 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:53:12,531 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:53:12,533 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:53:12,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:53:12,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:53:12,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:53:12,539 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:53:12,539 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:53:12,540 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:53:12,540 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:53:12,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:53:12,542 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:53:12,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:53:12,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:53:12,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:53:12,545 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:53:12,546 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:53:12,546 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:53:12,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:53:12,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:53:12,548 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:53:12,561 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:53:12,561 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:53:12,561 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:53:12,562 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:53:12,563 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:53:12,563 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:53:12,563 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:53:12,563 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:53:12,563 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:53:12,564 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:53:12,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:53:12,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:53:12,564 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:53:12,564 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:53:12,565 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:53:12,565 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:53:12,565 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:53:12,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:53:12,565 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:53:12,568 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:53:12,568 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:53:12,613 INFO ]: Repository-Root is: /tmp [2018-06-22 10:53:12,626 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:53:12,630 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:53:12,631 INFO ]: Initializing SmtParser... [2018-06-22 10:53:12,632 INFO ]: SmtParser initialized [2018-06-22 10:53:12,632 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/31.c.smt2 [2018-06-22 10:53:12,633 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 10:53:12,722 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/31.c.smt2 unknown [2018-06-22 10:53:13,349 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/31.c.smt2 [2018-06-22 10:53:13,353 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:53:13,360 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:53:13,360 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:53:13,360 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:53:13,360 INFO ]: ChcToBoogie initialized [2018-06-22 10:53:13,365 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:53:13" (1/1) ... [2018-06-22 10:53:13,433 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:13 Unit [2018-06-22 10:53:13,433 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:53:13,434 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:53:13,434 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:53:13,434 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:53:13,455 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:13" (1/1) ... [2018-06-22 10:53:13,455 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:13" (1/1) ... [2018-06-22 10:53:13,478 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:13" (1/1) ... [2018-06-22 10:53:13,478 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:13" (1/1) ... [2018-06-22 10:53:13,491 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:13" (1/1) ... [2018-06-22 10:53:13,493 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:13" (1/1) ... [2018-06-22 10:53:13,496 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:13" (1/1) ... [2018-06-22 10:53:13,510 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:53:13,510 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:53:13,511 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:53:13,511 INFO ]: RCFGBuilder initialized [2018-06-22 10:53:13,511 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 10:53:13,539 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:53:13,540 INFO ]: Found specification of procedure False [2018-06-22 10:53:13,540 INFO ]: Found implementation of procedure False [2018-06-22 10:53:13,540 INFO ]: Specification and implementation of procedure h34 given in one single declaration [2018-06-22 10:53:13,540 INFO ]: Found specification of procedure h34 [2018-06-22 10:53:13,540 INFO ]: Found implementation of procedure h34 [2018-06-22 10:53:13,540 INFO ]: Specification and implementation of procedure h30 given in one single declaration [2018-06-22 10:53:13,540 INFO ]: Found specification of procedure h30 [2018-06-22 10:53:13,540 INFO ]: Found implementation of procedure h30 [2018-06-22 10:53:13,540 INFO ]: Specification and implementation of procedure h31 given in one single declaration [2018-06-22 10:53:13,540 INFO ]: Found specification of procedure h31 [2018-06-22 10:53:13,540 INFO ]: Found implementation of procedure h31 [2018-06-22 10:53:13,540 INFO ]: Specification and implementation of procedure h28 given in one single declaration [2018-06-22 10:53:13,540 INFO ]: Found specification of procedure h28 [2018-06-22 10:53:13,540 INFO ]: Found implementation of procedure h28 [2018-06-22 10:53:13,540 INFO ]: Specification and implementation of procedure h27 given in one single declaration [2018-06-22 10:53:13,540 INFO ]: Found specification of procedure h27 [2018-06-22 10:53:13,540 INFO ]: Found implementation of procedure h27 [2018-06-22 10:53:13,540 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:53:13,540 INFO ]: Found specification of procedure h23 [2018-06-22 10:53:13,540 INFO ]: Found implementation of procedure h23 [2018-06-22 10:53:13,540 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:53:13,540 INFO ]: Found specification of procedure h22 [2018-06-22 10:53:13,540 INFO ]: Found implementation of procedure h22 [2018-06-22 10:53:13,540 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:53:13,540 INFO ]: Found specification of procedure h21 [2018-06-22 10:53:13,540 INFO ]: Found implementation of procedure h21 [2018-06-22 10:53:13,540 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:53:13,540 INFO ]: Found specification of procedure h20 [2018-06-22 10:53:13,540 INFO ]: Found implementation of procedure h20 [2018-06-22 10:53:13,540 INFO ]: Specification and implementation of procedure h48 given in one single declaration [2018-06-22 10:53:13,541 INFO ]: Found specification of procedure h48 [2018-06-22 10:53:13,541 INFO ]: Found implementation of procedure h48 [2018-06-22 10:53:13,541 INFO ]: Specification and implementation of procedure h47 given in one single declaration [2018-06-22 10:53:13,541 INFO ]: Found specification of procedure h47 [2018-06-22 10:53:13,541 INFO ]: Found implementation of procedure h47 [2018-06-22 10:53:13,541 INFO ]: Specification and implementation of procedure h33 given in one single declaration [2018-06-22 10:53:13,541 INFO ]: Found specification of procedure h33 [2018-06-22 10:53:13,541 INFO ]: Found implementation of procedure h33 [2018-06-22 10:53:13,541 INFO ]: Specification and implementation of procedure h32 given in one single declaration [2018-06-22 10:53:13,541 INFO ]: Found specification of procedure h32 [2018-06-22 10:53:13,541 INFO ]: Found implementation of procedure h32 [2018-06-22 10:53:13,541 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:53:13,541 INFO ]: Found specification of procedure h19 [2018-06-22 10:53:13,541 INFO ]: Found implementation of procedure h19 [2018-06-22 10:53:13,541 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:53:13,541 INFO ]: Found specification of procedure h18 [2018-06-22 10:53:13,541 INFO ]: Found implementation of procedure h18 [2018-06-22 10:53:13,541 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:53:13,541 INFO ]: Found specification of procedure h14 [2018-06-22 10:53:13,541 INFO ]: Found implementation of procedure h14 [2018-06-22 10:53:13,541 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:53:13,541 INFO ]: Found specification of procedure h13 [2018-06-22 10:53:13,541 INFO ]: Found implementation of procedure h13 [2018-06-22 10:53:13,541 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:53:13,541 INFO ]: Found specification of procedure h12 [2018-06-22 10:53:13,541 INFO ]: Found implementation of procedure h12 [2018-06-22 10:53:13,541 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:53:13,541 INFO ]: Found specification of procedure h11 [2018-06-22 10:53:13,541 INFO ]: Found implementation of procedure h11 [2018-06-22 10:53:13,541 INFO ]: Specification and implementation of procedure h49 given in one single declaration [2018-06-22 10:53:13,541 INFO ]: Found specification of procedure h49 [2018-06-22 10:53:13,541 INFO ]: Found implementation of procedure h49 [2018-06-22 10:53:13,542 INFO ]: Specification and implementation of procedure h26 given in one single declaration [2018-06-22 10:53:13,542 INFO ]: Found specification of procedure h26 [2018-06-22 10:53:13,542 INFO ]: Found implementation of procedure h26 [2018-06-22 10:53:13,542 INFO ]: Specification and implementation of procedure h25 given in one single declaration [2018-06-22 10:53:13,542 INFO ]: Found specification of procedure h25 [2018-06-22 10:53:13,542 INFO ]: Found implementation of procedure h25 [2018-06-22 10:53:13,542 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:53:13,542 INFO ]: Found specification of procedure h24 [2018-06-22 10:53:13,542 INFO ]: Found implementation of procedure h24 [2018-06-22 10:53:13,542 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:53:13,542 INFO ]: Found specification of procedure h10 [2018-06-22 10:53:13,542 INFO ]: Found implementation of procedure h10 [2018-06-22 10:53:13,542 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:53:13,542 INFO ]: Found specification of procedure h9 [2018-06-22 10:53:13,542 INFO ]: Found implementation of procedure h9 [2018-06-22 10:53:13,542 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:53:13,542 INFO ]: Found specification of procedure h4 [2018-06-22 10:53:13,542 INFO ]: Found implementation of procedure h4 [2018-06-22 10:53:13,542 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:53:13,542 INFO ]: Found specification of procedure h3 [2018-06-22 10:53:13,542 INFO ]: Found implementation of procedure h3 [2018-06-22 10:53:13,542 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:53:13,542 INFO ]: Found specification of procedure h2 [2018-06-22 10:53:13,542 INFO ]: Found implementation of procedure h2 [2018-06-22 10:53:13,542 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:53:13,542 INFO ]: Found specification of procedure h1 [2018-06-22 10:53:13,542 INFO ]: Found implementation of procedure h1 [2018-06-22 10:53:13,542 INFO ]: Specification and implementation of procedure h45 given in one single declaration [2018-06-22 10:53:13,542 INFO ]: Found specification of procedure h45 [2018-06-22 10:53:13,542 INFO ]: Found implementation of procedure h45 [2018-06-22 10:53:13,542 INFO ]: Specification and implementation of procedure h44 given in one single declaration [2018-06-22 10:53:13,542 INFO ]: Found specification of procedure h44 [2018-06-22 10:53:13,542 INFO ]: Found implementation of procedure h44 [2018-06-22 10:53:13,543 INFO ]: Specification and implementation of procedure h43 given in one single declaration [2018-06-22 10:53:13,543 INFO ]: Found specification of procedure h43 [2018-06-22 10:53:13,543 INFO ]: Found implementation of procedure h43 [2018-06-22 10:53:13,543 INFO ]: Specification and implementation of procedure h40 given in one single declaration [2018-06-22 10:53:13,543 INFO ]: Found specification of procedure h40 [2018-06-22 10:53:13,543 INFO ]: Found implementation of procedure h40 [2018-06-22 10:53:13,543 INFO ]: Specification and implementation of procedure h39 given in one single declaration [2018-06-22 10:53:13,543 INFO ]: Found specification of procedure h39 [2018-06-22 10:53:13,543 INFO ]: Found implementation of procedure h39 [2018-06-22 10:53:13,543 INFO ]: Specification and implementation of procedure h38 given in one single declaration [2018-06-22 10:53:13,543 INFO ]: Found specification of procedure h38 [2018-06-22 10:53:13,543 INFO ]: Found implementation of procedure h38 [2018-06-22 10:53:13,543 INFO ]: Specification and implementation of procedure h37 given in one single declaration [2018-06-22 10:53:13,543 INFO ]: Found specification of procedure h37 [2018-06-22 10:53:13,543 INFO ]: Found implementation of procedure h37 [2018-06-22 10:53:13,543 INFO ]: Specification and implementation of procedure h36 given in one single declaration [2018-06-22 10:53:13,543 INFO ]: Found specification of procedure h36 [2018-06-22 10:53:13,543 INFO ]: Found implementation of procedure h36 [2018-06-22 10:53:13,543 INFO ]: Specification and implementation of procedure h35 given in one single declaration [2018-06-22 10:53:13,543 INFO ]: Found specification of procedure h35 [2018-06-22 10:53:13,543 INFO ]: Found implementation of procedure h35 [2018-06-22 10:53:13,543 INFO ]: Specification and implementation of procedure h42 given in one single declaration [2018-06-22 10:53:13,543 INFO ]: Found specification of procedure h42 [2018-06-22 10:53:13,543 INFO ]: Found implementation of procedure h42 [2018-06-22 10:53:13,543 INFO ]: Specification and implementation of procedure h41 given in one single declaration [2018-06-22 10:53:13,543 INFO ]: Found specification of procedure h41 [2018-06-22 10:53:13,543 INFO ]: Found implementation of procedure h41 [2018-06-22 10:53:13,543 INFO ]: Specification and implementation of procedure h29 given in one single declaration [2018-06-22 10:53:13,543 INFO ]: Found specification of procedure h29 [2018-06-22 10:53:13,543 INFO ]: Found implementation of procedure h29 [2018-06-22 10:53:13,543 INFO ]: Specification and implementation of procedure h46 given in one single declaration [2018-06-22 10:53:13,543 INFO ]: Found specification of procedure h46 [2018-06-22 10:53:13,544 INFO ]: Found implementation of procedure h46 [2018-06-22 10:53:13,544 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:53:13,544 INFO ]: Found specification of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:53:13,544 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:53:14,577 INFO ]: Using library mode [2018-06-22 10:53:14,577 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:53:14 BoogieIcfgContainer [2018-06-22 10:53:14,577 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:53:14,582 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:53:14,582 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:53:14,585 INFO ]: TraceAbstraction initialized [2018-06-22 10:53:14,586 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:53:13" (1/3) ... [2018-06-22 10:53:14,587 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298c46d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:53:14, skipping insertion in model container [2018-06-22 10:53:14,587 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:13" (2/3) ... [2018-06-22 10:53:14,587 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298c46d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:53:14, skipping insertion in model container [2018-06-22 10:53:14,587 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:53:14" (3/3) ... [2018-06-22 10:53:14,589 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:53:14,599 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:53:14,609 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:53:14,657 INFO ]: Using default assertion order modulation [2018-06-22 10:53:14,658 INFO ]: Interprodecural is true [2018-06-22 10:53:14,658 INFO ]: Hoare is false [2018-06-22 10:53:14,658 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:53:14,658 INFO ]: Backedges is TWOTRACK [2018-06-22 10:53:14,658 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:53:14,658 INFO ]: Difference is false [2018-06-22 10:53:14,658 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:53:14,658 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:53:14,686 INFO ]: Start isEmpty. Operand 182 states. [2018-06-22 10:53:14,704 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 10:53:14,704 INFO ]: Found error trace [2018-06-22 10:53:14,705 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:14,705 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:14,709 INFO ]: Analyzing trace with hash -782915682, now seen corresponding path program 1 times [2018-06-22 10:53:14,711 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:14,711 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:14,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:14,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:14,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:14,872 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:15,447 WARN ]: Spent 277.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-22 10:53:16,496 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:53:16,499 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:16,499 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 10:53:16,501 INFO ]: Interpolant automaton has 22 states [2018-06-22 10:53:16,516 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 10:53:16,517 INFO ]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:53:16,520 INFO ]: Start difference. First operand 182 states. Second operand 22 states. [2018-06-22 10:53:18,025 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:18,025 INFO ]: Finished difference Result 208 states and 222 transitions. [2018-06-22 10:53:18,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:53:18,026 INFO ]: Start accepts. Automaton has 22 states. Word has length 89 [2018-06-22 10:53:18,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:18,041 INFO ]: With dead ends: 208 [2018-06-22 10:53:18,041 INFO ]: Without dead ends: 208 [2018-06-22 10:53:18,043 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:53:18,058 INFO ]: Start minimizeSevpa. Operand 208 states. [2018-06-22 10:53:18,113 INFO ]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-06-22 10:53:18,117 INFO ]: Start removeUnreachable. Operand 208 states. [2018-06-22 10:53:18,121 INFO ]: Finished removeUnreachable. Reduced from 208 states to 208 states and 222 transitions. [2018-06-22 10:53:18,122 INFO ]: Start accepts. Automaton has 208 states and 222 transitions. Word has length 89 [2018-06-22 10:53:18,123 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:18,123 INFO ]: Abstraction has 208 states and 222 transitions. [2018-06-22 10:53:18,123 INFO ]: Interpolant automaton has 22 states. [2018-06-22 10:53:18,123 INFO ]: Start isEmpty. Operand 208 states and 222 transitions. [2018-06-22 10:53:18,127 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 10:53:18,127 INFO ]: Found error trace [2018-06-22 10:53:18,128 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:18,128 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:18,128 INFO ]: Analyzing trace with hash -411077214, now seen corresponding path program 1 times [2018-06-22 10:53:18,128 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:18,128 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:18,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:18,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:18,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:18,175 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:18,544 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:53:18,545 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:18,545 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 10:53:18,548 INFO ]: Interpolant automaton has 21 states [2018-06-22 10:53:18,549 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 10:53:18,549 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:53:18,549 INFO ]: Start difference. First operand 208 states and 222 transitions. Second operand 21 states. [2018-06-22 10:53:19,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:19,239 INFO ]: Finished difference Result 212 states and 226 transitions. [2018-06-22 10:53:19,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 10:53:19,239 INFO ]: Start accepts. Automaton has 21 states. Word has length 89 [2018-06-22 10:53:19,240 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:19,243 INFO ]: With dead ends: 212 [2018-06-22 10:53:19,243 INFO ]: Without dead ends: 212 [2018-06-22 10:53:19,244 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:53:19,244 INFO ]: Start minimizeSevpa. Operand 212 states. [2018-06-22 10:53:19,262 INFO ]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-06-22 10:53:19,262 INFO ]: Start removeUnreachable. Operand 212 states. [2018-06-22 10:53:19,265 INFO ]: Finished removeUnreachable. Reduced from 212 states to 212 states and 226 transitions. [2018-06-22 10:53:19,265 INFO ]: Start accepts. Automaton has 212 states and 226 transitions. Word has length 89 [2018-06-22 10:53:19,266 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:19,266 INFO ]: Abstraction has 212 states and 226 transitions. [2018-06-22 10:53:19,266 INFO ]: Interpolant automaton has 21 states. [2018-06-22 10:53:19,266 INFO ]: Start isEmpty. Operand 212 states and 226 transitions. [2018-06-22 10:53:19,269 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 10:53:19,269 INFO ]: Found error trace [2018-06-22 10:53:19,269 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:19,269 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:19,270 INFO ]: Analyzing trace with hash -58751227, now seen corresponding path program 1 times [2018-06-22 10:53:19,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:19,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:19,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:19,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:19,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:19,288 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:19,545 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:53:19,909 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:53:19,909 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:19,909 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 10:53:19,909 INFO ]: Interpolant automaton has 21 states [2018-06-22 10:53:19,909 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 10:53:19,910 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:53:19,910 INFO ]: Start difference. First operand 212 states and 226 transitions. Second operand 21 states. [2018-06-22 10:53:20,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:20,254 INFO ]: Finished difference Result 216 states and 230 transitions. [2018-06-22 10:53:20,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 10:53:20,254 INFO ]: Start accepts. Automaton has 21 states. Word has length 89 [2018-06-22 10:53:20,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:20,257 INFO ]: With dead ends: 216 [2018-06-22 10:53:20,257 INFO ]: Without dead ends: 216 [2018-06-22 10:53:20,258 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:53:20,258 INFO ]: Start minimizeSevpa. Operand 216 states. [2018-06-22 10:53:20,275 INFO ]: Finished minimizeSevpa. Reduced states from 216 to 214. [2018-06-22 10:53:20,275 INFO ]: Start removeUnreachable. Operand 214 states. [2018-06-22 10:53:20,278 INFO ]: Finished removeUnreachable. Reduced from 214 states to 214 states and 228 transitions. [2018-06-22 10:53:20,278 INFO ]: Start accepts. Automaton has 214 states and 228 transitions. Word has length 89 [2018-06-22 10:53:20,278 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:20,278 INFO ]: Abstraction has 214 states and 228 transitions. [2018-06-22 10:53:20,278 INFO ]: Interpolant automaton has 21 states. [2018-06-22 10:53:20,278 INFO ]: Start isEmpty. Operand 214 states and 228 transitions. [2018-06-22 10:53:20,286 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:53:20,286 INFO ]: Found error trace [2018-06-22 10:53:20,287 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:20,287 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:20,287 INFO ]: Analyzing trace with hash -1968369231, now seen corresponding path program 1 times [2018-06-22 10:53:20,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:20,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:20,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:20,288 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:20,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:20,317 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:20,568 INFO ]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:53:20,568 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:20,569 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:53:20,569 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:53:20,569 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:53:20,569 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:53:20,569 INFO ]: Start difference. First operand 214 states and 228 transitions. Second operand 14 states. [2018-06-22 10:53:20,984 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:20,984 INFO ]: Finished difference Result 230 states and 247 transitions. [2018-06-22 10:53:20,984 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:53:20,984 INFO ]: Start accepts. Automaton has 14 states. Word has length 129 [2018-06-22 10:53:20,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:20,987 INFO ]: With dead ends: 230 [2018-06-22 10:53:20,987 INFO ]: Without dead ends: 230 [2018-06-22 10:53:20,988 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:53:20,988 INFO ]: Start minimizeSevpa. Operand 230 states. [2018-06-22 10:53:21,011 INFO ]: Finished minimizeSevpa. Reduced states from 230 to 226. [2018-06-22 10:53:21,011 INFO ]: Start removeUnreachable. Operand 226 states. [2018-06-22 10:53:21,014 INFO ]: Finished removeUnreachable. Reduced from 226 states to 226 states and 243 transitions. [2018-06-22 10:53:21,014 INFO ]: Start accepts. Automaton has 226 states and 243 transitions. Word has length 129 [2018-06-22 10:53:21,015 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:21,015 INFO ]: Abstraction has 226 states and 243 transitions. [2018-06-22 10:53:21,015 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:53:21,015 INFO ]: Start isEmpty. Operand 226 states and 243 transitions. [2018-06-22 10:53:21,017 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:53:21,017 INFO ]: Found error trace [2018-06-22 10:53:21,017 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:21,017 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:21,018 INFO ]: Analyzing trace with hash -253747275, now seen corresponding path program 1 times [2018-06-22 10:53:21,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:21,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:21,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:21,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:21,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:21,042 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:21,259 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:53:21,347 INFO ]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 10:53:21,347 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:21,347 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:53:21,347 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:53:21,348 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:53:21,348 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:53:21,348 INFO ]: Start difference. First operand 226 states and 243 transitions. Second operand 13 states. [2018-06-22 10:53:21,593 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:21,593 INFO ]: Finished difference Result 271 states and 301 transitions. [2018-06-22 10:53:21,593 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:53:21,593 INFO ]: Start accepts. Automaton has 13 states. Word has length 129 [2018-06-22 10:53:21,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:21,597 INFO ]: With dead ends: 271 [2018-06-22 10:53:21,597 INFO ]: Without dead ends: 271 [2018-06-22 10:53:21,598 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:53:21,598 INFO ]: Start minimizeSevpa. Operand 271 states. [2018-06-22 10:53:21,616 INFO ]: Finished minimizeSevpa. Reduced states from 271 to 263. [2018-06-22 10:53:21,616 INFO ]: Start removeUnreachable. Operand 263 states. [2018-06-22 10:53:21,619 INFO ]: Finished removeUnreachable. Reduced from 263 states to 263 states and 287 transitions. [2018-06-22 10:53:21,619 INFO ]: Start accepts. Automaton has 263 states and 287 transitions. Word has length 129 [2018-06-22 10:53:21,619 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:21,619 INFO ]: Abstraction has 263 states and 287 transitions. [2018-06-22 10:53:21,619 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:53:21,619 INFO ]: Start isEmpty. Operand 263 states and 287 transitions. [2018-06-22 10:53:21,622 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:53:21,622 INFO ]: Found error trace [2018-06-22 10:53:21,622 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:21,622 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:21,622 INFO ]: Analyzing trace with hash 1382939160, now seen corresponding path program 1 times [2018-06-22 10:53:21,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:21,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:21,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:21,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:21,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:21,644 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:21,832 INFO ]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 10:53:21,832 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:21,832 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:53:21,832 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:53:21,832 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:53:21,833 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:53:21,833 INFO ]: Start difference. First operand 263 states and 287 transitions. Second operand 13 states. [2018-06-22 10:53:22,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:22,108 INFO ]: Finished difference Result 271 states and 300 transitions. [2018-06-22 10:53:22,108 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:53:22,108 INFO ]: Start accepts. Automaton has 13 states. Word has length 129 [2018-06-22 10:53:22,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:22,110 INFO ]: With dead ends: 271 [2018-06-22 10:53:22,110 INFO ]: Without dead ends: 271 [2018-06-22 10:53:22,111 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:53:22,111 INFO ]: Start minimizeSevpa. Operand 271 states. [2018-06-22 10:53:22,130 INFO ]: Finished minimizeSevpa. Reduced states from 271 to 255. [2018-06-22 10:53:22,131 INFO ]: Start removeUnreachable. Operand 255 states. [2018-06-22 10:53:22,133 INFO ]: Finished removeUnreachable. Reduced from 255 states to 255 states and 274 transitions. [2018-06-22 10:53:22,133 INFO ]: Start accepts. Automaton has 255 states and 274 transitions. Word has length 129 [2018-06-22 10:53:22,133 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:22,133 INFO ]: Abstraction has 255 states and 274 transitions. [2018-06-22 10:53:22,133 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:53:22,133 INFO ]: Start isEmpty. Operand 255 states and 274 transitions. [2018-06-22 10:53:22,136 INFO ]: Finished isEmpty. Found accepting run of length 138 [2018-06-22 10:53:22,136 INFO ]: Found error trace [2018-06-22 10:53:22,136 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:22,136 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:22,136 INFO ]: Analyzing trace with hash -418757002, now seen corresponding path program 1 times [2018-06-22 10:53:22,136 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:22,136 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:22,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:22,137 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:22,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:22,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:23,360 INFO ]: Checked inductivity of 31 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:53:23,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:23,360 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:53:23,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:23,520 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:23,540 INFO ]: Computing forward predicates... [2018-06-22 10:53:24,531 INFO ]: Checked inductivity of 31 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:53:24,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:24,566 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 23] total 54 [2018-06-22 10:53:24,567 INFO ]: Interpolant automaton has 54 states [2018-06-22 10:53:24,567 INFO ]: Constructing interpolant automaton starting with 54 interpolants. [2018-06-22 10:53:24,568 INFO ]: CoverageRelationStatistics Valid=114, Invalid=2748, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 10:53:24,568 INFO ]: Start difference. First operand 255 states and 274 transitions. Second operand 54 states. [2018-06-22 10:53:27,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:27,521 INFO ]: Finished difference Result 319 states and 339 transitions. [2018-06-22 10:53:27,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-22 10:53:27,522 INFO ]: Start accepts. Automaton has 54 states. Word has length 137 [2018-06-22 10:53:27,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:27,524 INFO ]: With dead ends: 319 [2018-06-22 10:53:27,524 INFO ]: Without dead ends: 263 [2018-06-22 10:53:27,525 INFO ]: 0 DeclaredPredicates, 192 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=208, Invalid=5048, Unknown=0, NotChecked=0, Total=5256 [2018-06-22 10:53:27,525 INFO ]: Start minimizeSevpa. Operand 263 states. [2018-06-22 10:53:27,541 INFO ]: Finished minimizeSevpa. Reduced states from 263 to 259. [2018-06-22 10:53:27,542 INFO ]: Start removeUnreachable. Operand 259 states. [2018-06-22 10:53:27,550 INFO ]: Finished removeUnreachable. Reduced from 259 states to 259 states and 277 transitions. [2018-06-22 10:53:27,550 INFO ]: Start accepts. Automaton has 259 states and 277 transitions. Word has length 137 [2018-06-22 10:53:27,551 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:27,551 INFO ]: Abstraction has 259 states and 277 transitions. [2018-06-22 10:53:27,551 INFO ]: Interpolant automaton has 54 states. [2018-06-22 10:53:27,551 INFO ]: Start isEmpty. Operand 259 states and 277 transitions. [2018-06-22 10:53:27,553 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:53:27,553 INFO ]: Found error trace [2018-06-22 10:53:27,553 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:27,553 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:27,553 INFO ]: Analyzing trace with hash -89493671, now seen corresponding path program 1 times [2018-06-22 10:53:27,554 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:27,554 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:27,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:27,555 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:27,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:27,586 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:27,962 INFO ]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:53:27,962 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:27,962 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 10:53:27,963 INFO ]: Interpolant automaton has 21 states [2018-06-22 10:53:27,963 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 10:53:27,963 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:53:27,963 INFO ]: Start difference. First operand 259 states and 277 transitions. Second operand 21 states. [2018-06-22 10:53:28,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:28,233 INFO ]: Finished difference Result 297 states and 319 transitions. [2018-06-22 10:53:28,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 10:53:28,233 INFO ]: Start accepts. Automaton has 21 states. Word has length 157 [2018-06-22 10:53:28,234 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:28,235 INFO ]: With dead ends: 297 [2018-06-22 10:53:28,235 INFO ]: Without dead ends: 297 [2018-06-22 10:53:28,235 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:53:28,235 INFO ]: Start minimizeSevpa. Operand 297 states. [2018-06-22 10:53:28,248 INFO ]: Finished minimizeSevpa. Reduced states from 297 to 281. [2018-06-22 10:53:28,248 INFO ]: Start removeUnreachable. Operand 281 states. [2018-06-22 10:53:28,250 INFO ]: Finished removeUnreachable. Reduced from 281 states to 281 states and 303 transitions. [2018-06-22 10:53:28,250 INFO ]: Start accepts. Automaton has 281 states and 303 transitions. Word has length 157 [2018-06-22 10:53:28,250 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:28,250 INFO ]: Abstraction has 281 states and 303 transitions. [2018-06-22 10:53:28,250 INFO ]: Interpolant automaton has 21 states. [2018-06-22 10:53:28,250 INFO ]: Start isEmpty. Operand 281 states and 303 transitions. [2018-06-22 10:53:28,252 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:53:28,252 INFO ]: Found error trace [2018-06-22 10:53:28,253 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:28,253 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:28,253 INFO ]: Analyzing trace with hash 1614971221, now seen corresponding path program 1 times [2018-06-22 10:53:28,253 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:28,253 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:28,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:28,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:28,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:28,280 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:28,557 INFO ]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 10:53:28,557 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:28,557 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 10:53:28,557 INFO ]: Interpolant automaton has 20 states [2018-06-22 10:53:28,557 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 10:53:28,557 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:53:28,558 INFO ]: Start difference. First operand 281 states and 303 transitions. Second operand 20 states. [2018-06-22 10:53:28,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:28,981 INFO ]: Finished difference Result 406 states and 456 transitions. [2018-06-22 10:53:28,981 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 10:53:28,981 INFO ]: Start accepts. Automaton has 20 states. Word has length 157 [2018-06-22 10:53:28,982 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:28,984 INFO ]: With dead ends: 406 [2018-06-22 10:53:28,984 INFO ]: Without dead ends: 389 [2018-06-22 10:53:28,984 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:53:28,984 INFO ]: Start minimizeSevpa. Operand 389 states. [2018-06-22 10:53:29,004 INFO ]: Finished minimizeSevpa. Reduced states from 389 to 361. [2018-06-22 10:53:29,005 INFO ]: Start removeUnreachable. Operand 361 states. [2018-06-22 10:53:29,008 INFO ]: Finished removeUnreachable. Reduced from 361 states to 361 states and 405 transitions. [2018-06-22 10:53:29,008 INFO ]: Start accepts. Automaton has 361 states and 405 transitions. Word has length 157 [2018-06-22 10:53:29,009 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:29,009 INFO ]: Abstraction has 361 states and 405 transitions. [2018-06-22 10:53:29,009 INFO ]: Interpolant automaton has 20 states. [2018-06-22 10:53:29,010 INFO ]: Start isEmpty. Operand 361 states and 405 transitions. [2018-06-22 10:53:29,012 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:53:29,012 INFO ]: Found error trace [2018-06-22 10:53:29,012 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:29,012 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:29,012 INFO ]: Analyzing trace with hash 1101052895, now seen corresponding path program 1 times [2018-06-22 10:53:29,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:29,012 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:29,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:29,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:29,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:29,036 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:29,369 INFO ]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:53:29,369 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:29,369 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 10:53:29,370 INFO ]: Interpolant automaton has 21 states [2018-06-22 10:53:29,370 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 10:53:29,370 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:53:29,370 INFO ]: Start difference. First operand 361 states and 405 transitions. Second operand 21 states. [2018-06-22 10:53:29,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:29,957 INFO ]: Finished difference Result 401 states and 449 transitions. [2018-06-22 10:53:29,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 10:53:29,959 INFO ]: Start accepts. Automaton has 21 states. Word has length 157 [2018-06-22 10:53:29,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:29,961 INFO ]: With dead ends: 401 [2018-06-22 10:53:29,961 INFO ]: Without dead ends: 401 [2018-06-22 10:53:29,962 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:53:29,962 INFO ]: Start minimizeSevpa. Operand 401 states. [2018-06-22 10:53:29,981 INFO ]: Finished minimizeSevpa. Reduced states from 401 to 387. [2018-06-22 10:53:29,981 INFO ]: Start removeUnreachable. Operand 387 states. [2018-06-22 10:53:29,984 INFO ]: Finished removeUnreachable. Reduced from 387 states to 387 states and 435 transitions. [2018-06-22 10:53:29,984 INFO ]: Start accepts. Automaton has 387 states and 435 transitions. Word has length 157 [2018-06-22 10:53:29,984 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:29,984 INFO ]: Abstraction has 387 states and 435 transitions. [2018-06-22 10:53:29,984 INFO ]: Interpolant automaton has 21 states. [2018-06-22 10:53:29,984 INFO ]: Start isEmpty. Operand 387 states and 435 transitions. [2018-06-22 10:53:29,986 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:53:29,986 INFO ]: Found error trace [2018-06-22 10:53:29,986 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:29,986 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:29,987 INFO ]: Analyzing trace with hash 1607498232, now seen corresponding path program 1 times [2018-06-22 10:53:29,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:29,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:29,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:29,987 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:29,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:30,011 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:30,320 INFO ]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 10:53:30,320 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:30,320 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 10:53:30,320 INFO ]: Interpolant automaton has 20 states [2018-06-22 10:53:30,320 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 10:53:30,321 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:53:30,322 INFO ]: Start difference. First operand 387 states and 435 transitions. Second operand 20 states. [2018-06-22 10:53:31,823 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:31,823 INFO ]: Finished difference Result 488 states and 568 transitions. [2018-06-22 10:53:31,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 10:53:31,823 INFO ]: Start accepts. Automaton has 20 states. Word has length 157 [2018-06-22 10:53:31,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:31,825 INFO ]: With dead ends: 488 [2018-06-22 10:53:31,825 INFO ]: Without dead ends: 462 [2018-06-22 10:53:31,826 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:53:31,826 INFO ]: Start minimizeSevpa. Operand 462 states. [2018-06-22 10:53:31,850 INFO ]: Finished minimizeSevpa. Reduced states from 462 to 446. [2018-06-22 10:53:31,850 INFO ]: Start removeUnreachable. Operand 446 states. [2018-06-22 10:53:31,852 INFO ]: Finished removeUnreachable. Reduced from 446 states to 446 states and 520 transitions. [2018-06-22 10:53:31,852 INFO ]: Start accepts. Automaton has 446 states and 520 transitions. Word has length 157 [2018-06-22 10:53:31,853 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:31,853 INFO ]: Abstraction has 446 states and 520 transitions. [2018-06-22 10:53:31,853 INFO ]: Interpolant automaton has 20 states. [2018-06-22 10:53:31,853 INFO ]: Start isEmpty. Operand 446 states and 520 transitions. [2018-06-22 10:53:31,855 INFO ]: Finished isEmpty. Found accepting run of length 174 [2018-06-22 10:53:31,855 INFO ]: Found error trace [2018-06-22 10:53:31,855 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:31,855 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:31,855 INFO ]: Analyzing trace with hash -1995552060, now seen corresponding path program 1 times [2018-06-22 10:53:31,855 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:31,855 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:31,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:31,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:31,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:31,884 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:32,619 INFO ]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 10:53:32,619 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:32,619 INFO ]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-06-22 10:53:32,619 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:53:32,619 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:53:32,620 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:53:32,620 INFO ]: Start difference. First operand 446 states and 520 transitions. Second operand 23 states. [2018-06-22 10:53:33,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:33,116 INFO ]: Finished difference Result 498 states and 575 transitions. [2018-06-22 10:53:33,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:53:33,116 INFO ]: Start accepts. Automaton has 23 states. Word has length 173 [2018-06-22 10:53:33,116 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:33,119 INFO ]: With dead ends: 498 [2018-06-22 10:53:33,119 INFO ]: Without dead ends: 498 [2018-06-22 10:53:33,119 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:53:33,120 INFO ]: Start minimizeSevpa. Operand 498 states. [2018-06-22 10:53:33,140 INFO ]: Finished minimizeSevpa. Reduced states from 498 to 450. [2018-06-22 10:53:33,140 INFO ]: Start removeUnreachable. Operand 450 states. [2018-06-22 10:53:33,142 INFO ]: Finished removeUnreachable. Reduced from 450 states to 450 states and 524 transitions. [2018-06-22 10:53:33,142 INFO ]: Start accepts. Automaton has 450 states and 524 transitions. Word has length 173 [2018-06-22 10:53:33,143 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:33,143 INFO ]: Abstraction has 450 states and 524 transitions. [2018-06-22 10:53:33,143 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:53:33,143 INFO ]: Start isEmpty. Operand 450 states and 524 transitions. [2018-06-22 10:53:33,145 INFO ]: Finished isEmpty. Found accepting run of length 174 [2018-06-22 10:53:33,145 INFO ]: Found error trace [2018-06-22 10:53:33,145 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:33,145 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:33,145 INFO ]: Analyzing trace with hash 1544003293, now seen corresponding path program 1 times [2018-06-22 10:53:33,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:33,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:33,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:33,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:33,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:33,165 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:33,582 INFO ]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 10:53:33,583 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:33,583 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 10:53:33,583 INFO ]: Interpolant automaton has 22 states [2018-06-22 10:53:33,583 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 10:53:33,583 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:53:33,583 INFO ]: Start difference. First operand 450 states and 524 transitions. Second operand 22 states. [2018-06-22 10:53:34,006 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:34,006 INFO ]: Finished difference Result 539 states and 634 transitions. [2018-06-22 10:53:34,007 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:53:34,007 INFO ]: Start accepts. Automaton has 22 states. Word has length 173 [2018-06-22 10:53:34,007 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:34,010 INFO ]: With dead ends: 539 [2018-06-22 10:53:34,010 INFO ]: Without dead ends: 527 [2018-06-22 10:53:34,010 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:53:34,010 INFO ]: Start minimizeSevpa. Operand 527 states. [2018-06-22 10:53:34,031 INFO ]: Finished minimizeSevpa. Reduced states from 527 to 497. [2018-06-22 10:53:34,031 INFO ]: Start removeUnreachable. Operand 497 states. [2018-06-22 10:53:34,033 INFO ]: Finished removeUnreachable. Reduced from 497 states to 497 states and 589 transitions. [2018-06-22 10:53:34,033 INFO ]: Start accepts. Automaton has 497 states and 589 transitions. Word has length 173 [2018-06-22 10:53:34,033 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:34,033 INFO ]: Abstraction has 497 states and 589 transitions. [2018-06-22 10:53:34,033 INFO ]: Interpolant automaton has 22 states. [2018-06-22 10:53:34,034 INFO ]: Start isEmpty. Operand 497 states and 589 transitions. [2018-06-22 10:53:34,036 INFO ]: Finished isEmpty. Found accepting run of length 174 [2018-06-22 10:53:34,036 INFO ]: Found error trace [2018-06-22 10:53:34,036 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:34,036 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:34,036 INFO ]: Analyzing trace with hash -233347266, now seen corresponding path program 1 times [2018-06-22 10:53:34,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:34,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:34,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:34,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:34,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:34,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:34,788 INFO ]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 10:53:34,788 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:34,789 INFO ]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-06-22 10:53:34,789 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:53:34,789 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:53:34,789 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:53:34,789 INFO ]: Start difference. First operand 497 states and 589 transitions. Second operand 23 states. [2018-06-22 10:53:35,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:35,050 INFO ]: Finished difference Result 541 states and 639 transitions. [2018-06-22 10:53:35,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:53:35,050 INFO ]: Start accepts. Automaton has 23 states. Word has length 173 [2018-06-22 10:53:35,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:35,055 INFO ]: With dead ends: 541 [2018-06-22 10:53:35,055 INFO ]: Without dead ends: 541 [2018-06-22 10:53:35,055 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:53:35,055 INFO ]: Start minimizeSevpa. Operand 541 states. [2018-06-22 10:53:35,083 INFO ]: Finished minimizeSevpa. Reduced states from 541 to 513. [2018-06-22 10:53:35,083 INFO ]: Start removeUnreachable. Operand 513 states. [2018-06-22 10:53:35,086 INFO ]: Finished removeUnreachable. Reduced from 513 states to 513 states and 607 transitions. [2018-06-22 10:53:35,086 INFO ]: Start accepts. Automaton has 513 states and 607 transitions. Word has length 173 [2018-06-22 10:53:35,086 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:35,086 INFO ]: Abstraction has 513 states and 607 transitions. [2018-06-22 10:53:35,086 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:53:35,086 INFO ]: Start isEmpty. Operand 513 states and 607 transitions. [2018-06-22 10:53:35,088 INFO ]: Finished isEmpty. Found accepting run of length 174 [2018-06-22 10:53:35,088 INFO ]: Found error trace [2018-06-22 10:53:35,089 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:35,089 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:35,089 INFO ]: Analyzing trace with hash -2040596166, now seen corresponding path program 1 times [2018-06-22 10:53:35,089 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:35,089 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:35,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:35,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:35,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:35,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:35,346 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-06-22 10:53:35,976 INFO ]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 10:53:35,976 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:35,976 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 10:53:35,977 INFO ]: Interpolant automaton has 22 states [2018-06-22 10:53:35,977 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 10:53:35,977 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:53:35,977 INFO ]: Start difference. First operand 513 states and 607 transitions. Second operand 22 states. [2018-06-22 10:53:36,414 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:36,414 INFO ]: Finished difference Result 596 states and 714 transitions. [2018-06-22 10:53:36,414 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:53:36,414 INFO ]: Start accepts. Automaton has 22 states. Word has length 173 [2018-06-22 10:53:36,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:36,418 INFO ]: With dead ends: 596 [2018-06-22 10:53:36,418 INFO ]: Without dead ends: 583 [2018-06-22 10:53:36,420 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:53:36,421 INFO ]: Start minimizeSevpa. Operand 583 states. [2018-06-22 10:53:36,443 INFO ]: Finished minimizeSevpa. Reduced states from 583 to 547. [2018-06-22 10:53:36,443 INFO ]: Start removeUnreachable. Operand 547 states. [2018-06-22 10:53:36,446 INFO ]: Finished removeUnreachable. Reduced from 547 states to 547 states and 661 transitions. [2018-06-22 10:53:36,446 INFO ]: Start accepts. Automaton has 547 states and 661 transitions. Word has length 173 [2018-06-22 10:53:36,446 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:36,446 INFO ]: Abstraction has 547 states and 661 transitions. [2018-06-22 10:53:36,446 INFO ]: Interpolant automaton has 22 states. [2018-06-22 10:53:36,446 INFO ]: Start isEmpty. Operand 547 states and 661 transitions. [2018-06-22 10:53:36,448 INFO ]: Finished isEmpty. Found accepting run of length 178 [2018-06-22 10:53:36,448 INFO ]: Found error trace [2018-06-22 10:53:36,448 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:36,449 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:36,449 INFO ]: Analyzing trace with hash 1800989164, now seen corresponding path program 1 times [2018-06-22 10:53:36,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:36,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:36,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:36,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:36,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:36,466 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:36,705 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-22 10:53:38,175 INFO ]: Checked inductivity of 61 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 10:53:38,175 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:38,175 INFO ]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-06-22 10:53:38,175 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:53:38,176 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:53:38,176 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:53:38,176 INFO ]: Start difference. First operand 547 states and 661 transitions. Second operand 23 states. [2018-06-22 10:53:38,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:38,641 INFO ]: Finished difference Result 648 states and 784 transitions. [2018-06-22 10:53:38,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:53:38,642 INFO ]: Start accepts. Automaton has 23 states. Word has length 177 [2018-06-22 10:53:38,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:38,646 INFO ]: With dead ends: 648 [2018-06-22 10:53:38,646 INFO ]: Without dead ends: 636 [2018-06-22 10:53:38,646 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:53:38,647 INFO ]: Start minimizeSevpa. Operand 636 states. [2018-06-22 10:53:38,669 INFO ]: Finished minimizeSevpa. Reduced states from 636 to 608. [2018-06-22 10:53:38,669 INFO ]: Start removeUnreachable. Operand 608 states. [2018-06-22 10:53:38,672 INFO ]: Finished removeUnreachable. Reduced from 608 states to 608 states and 738 transitions. [2018-06-22 10:53:38,672 INFO ]: Start accepts. Automaton has 608 states and 738 transitions. Word has length 177 [2018-06-22 10:53:38,672 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:38,672 INFO ]: Abstraction has 608 states and 738 transitions. [2018-06-22 10:53:38,672 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:53:38,672 INFO ]: Start isEmpty. Operand 608 states and 738 transitions. [2018-06-22 10:53:38,675 INFO ]: Finished isEmpty. Found accepting run of length 178 [2018-06-22 10:53:38,675 INFO ]: Found error trace [2018-06-22 10:53:38,675 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:38,676 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:38,676 INFO ]: Analyzing trace with hash 1032307589, now seen corresponding path program 1 times [2018-06-22 10:53:38,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:38,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:38,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:38,676 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:38,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:38,706 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:39,934 INFO ]: Checked inductivity of 69 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 10:53:39,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:39,934 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:53:39,940 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:40,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:40,167 INFO ]: Computing forward predicates... [2018-06-22 10:53:41,830 INFO ]: Checked inductivity of 69 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 10:53:41,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:41,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 34] total 73 [2018-06-22 10:53:41,851 INFO ]: Interpolant automaton has 73 states [2018-06-22 10:53:41,851 INFO ]: Constructing interpolant automaton starting with 73 interpolants. [2018-06-22 10:53:41,852 INFO ]: CoverageRelationStatistics Valid=173, Invalid=5083, Unknown=0, NotChecked=0, Total=5256 [2018-06-22 10:53:41,852 INFO ]: Start difference. First operand 608 states and 738 transitions. Second operand 73 states. [2018-06-22 10:53:43,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:43,935 INFO ]: Finished difference Result 760 states and 928 transitions. [2018-06-22 10:53:43,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-06-22 10:53:43,935 INFO ]: Start accepts. Automaton has 73 states. Word has length 177 [2018-06-22 10:53:43,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:43,937 INFO ]: With dead ends: 760 [2018-06-22 10:53:43,937 INFO ]: Without dead ends: 704 [2018-06-22 10:53:43,941 INFO ]: 0 DeclaredPredicates, 254 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=344, Invalid=10576, Unknown=0, NotChecked=0, Total=10920 [2018-06-22 10:53:43,941 INFO ]: Start minimizeSevpa. Operand 704 states. [2018-06-22 10:53:43,965 INFO ]: Finished minimizeSevpa. Reduced states from 704 to 676. [2018-06-22 10:53:43,965 INFO ]: Start removeUnreachable. Operand 676 states. [2018-06-22 10:53:43,968 INFO ]: Finished removeUnreachable. Reduced from 676 states to 676 states and 820 transitions. [2018-06-22 10:53:43,968 INFO ]: Start accepts. Automaton has 676 states and 820 transitions. Word has length 177 [2018-06-22 10:53:43,968 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:43,968 INFO ]: Abstraction has 676 states and 820 transitions. [2018-06-22 10:53:43,968 INFO ]: Interpolant automaton has 73 states. [2018-06-22 10:53:43,968 INFO ]: Start isEmpty. Operand 676 states and 820 transitions. [2018-06-22 10:53:43,972 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:53:43,972 INFO ]: Found error trace [2018-06-22 10:53:43,972 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:43,972 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:43,972 INFO ]: Analyzing trace with hash 1677049385, now seen corresponding path program 1 times [2018-06-22 10:53:43,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:43,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:43,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:43,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:43,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:43,999 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:44,453 INFO ]: Checked inductivity of 61 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 10:53:44,453 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:44,453 INFO ]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2018-06-22 10:53:44,453 INFO ]: Interpolant automaton has 30 states [2018-06-22 10:53:44,453 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 10:53:44,454 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:53:44,454 INFO ]: Start difference. First operand 676 states and 820 transitions. Second operand 30 states. [2018-06-22 10:53:45,243 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:45,244 INFO ]: Finished difference Result 881 states and 1068 transitions. [2018-06-22 10:53:45,244 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:53:45,244 INFO ]: Start accepts. Automaton has 30 states. Word has length 205 [2018-06-22 10:53:45,244 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:45,248 INFO ]: With dead ends: 881 [2018-06-22 10:53:45,249 INFO ]: Without dead ends: 861 [2018-06-22 10:53:45,249 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:53:45,250 INFO ]: Start minimizeSevpa. Operand 861 states. [2018-06-22 10:53:45,280 INFO ]: Finished minimizeSevpa. Reduced states from 861 to 791. [2018-06-22 10:53:45,280 INFO ]: Start removeUnreachable. Operand 791 states. [2018-06-22 10:53:45,284 INFO ]: Finished removeUnreachable. Reduced from 791 states to 791 states and 943 transitions. [2018-06-22 10:53:45,284 INFO ]: Start accepts. Automaton has 791 states and 943 transitions. Word has length 205 [2018-06-22 10:53:45,284 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:45,284 INFO ]: Abstraction has 791 states and 943 transitions. [2018-06-22 10:53:45,284 INFO ]: Interpolant automaton has 30 states. [2018-06-22 10:53:45,284 INFO ]: Start isEmpty. Operand 791 states and 943 transitions. [2018-06-22 10:53:45,288 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:53:45,288 INFO ]: Found error trace [2018-06-22 10:53:45,288 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:45,288 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:45,288 INFO ]: Analyzing trace with hash -1120523312, now seen corresponding path program 1 times [2018-06-22 10:53:45,288 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:45,288 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:45,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:45,289 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:45,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:45,317 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:45,851 INFO ]: Checked inductivity of 64 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 10:53:45,851 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:45,851 INFO ]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2018-06-22 10:53:45,851 INFO ]: Interpolant automaton has 30 states [2018-06-22 10:53:45,851 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 10:53:45,851 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:53:45,851 INFO ]: Start difference. First operand 791 states and 943 transitions. Second operand 30 states. [2018-06-22 10:53:46,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:46,655 INFO ]: Finished difference Result 917 states and 1051 transitions. [2018-06-22 10:53:46,655 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:53:46,655 INFO ]: Start accepts. Automaton has 30 states. Word has length 205 [2018-06-22 10:53:46,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:46,664 INFO ]: With dead ends: 917 [2018-06-22 10:53:46,664 INFO ]: Without dead ends: 814 [2018-06-22 10:53:46,664 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:53:46,665 INFO ]: Start minimizeSevpa. Operand 814 states. [2018-06-22 10:53:46,697 INFO ]: Finished minimizeSevpa. Reduced states from 814 to 700. [2018-06-22 10:53:46,697 INFO ]: Start removeUnreachable. Operand 700 states. [2018-06-22 10:53:46,700 INFO ]: Finished removeUnreachable. Reduced from 700 states to 700 states and 805 transitions. [2018-06-22 10:53:46,700 INFO ]: Start accepts. Automaton has 700 states and 805 transitions. Word has length 205 [2018-06-22 10:53:46,700 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:46,700 INFO ]: Abstraction has 700 states and 805 transitions. [2018-06-22 10:53:46,700 INFO ]: Interpolant automaton has 30 states. [2018-06-22 10:53:46,700 INFO ]: Start isEmpty. Operand 700 states and 805 transitions. [2018-06-22 10:53:46,703 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:53:46,703 INFO ]: Found error trace [2018-06-22 10:53:46,703 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:46,703 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:46,704 INFO ]: Analyzing trace with hash -1042498100, now seen corresponding path program 1 times [2018-06-22 10:53:46,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:46,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:46,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:46,705 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:46,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:46,728 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:47,750 INFO ]: Checked inductivity of 61 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 10:53:47,750 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:47,750 INFO ]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2018-06-22 10:53:47,750 INFO ]: Interpolant automaton has 30 states [2018-06-22 10:53:47,750 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 10:53:47,750 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:53:47,750 INFO ]: Start difference. First operand 700 states and 805 transitions. Second operand 30 states. [2018-06-22 10:53:48,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:48,511 INFO ]: Finished difference Result 738 states and 844 transitions. [2018-06-22 10:53:48,530 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:53:48,530 INFO ]: Start accepts. Automaton has 30 states. Word has length 205 [2018-06-22 10:53:48,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:48,535 INFO ]: With dead ends: 738 [2018-06-22 10:53:48,535 INFO ]: Without dead ends: 702 [2018-06-22 10:53:48,536 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:53:48,536 INFO ]: Start minimizeSevpa. Operand 702 states. [2018-06-22 10:53:48,558 INFO ]: Finished minimizeSevpa. Reduced states from 702 to 700. [2018-06-22 10:53:48,558 INFO ]: Start removeUnreachable. Operand 700 states. [2018-06-22 10:53:48,560 INFO ]: Finished removeUnreachable. Reduced from 700 states to 700 states and 801 transitions. [2018-06-22 10:53:48,561 INFO ]: Start accepts. Automaton has 700 states and 801 transitions. Word has length 205 [2018-06-22 10:53:48,561 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:48,561 INFO ]: Abstraction has 700 states and 801 transitions. [2018-06-22 10:53:48,561 INFO ]: Interpolant automaton has 30 states. [2018-06-22 10:53:48,561 INFO ]: Start isEmpty. Operand 700 states and 801 transitions. [2018-06-22 10:53:48,564 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:53:48,564 INFO ]: Found error trace [2018-06-22 10:53:48,564 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:48,564 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:48,564 INFO ]: Analyzing trace with hash -1424736845, now seen corresponding path program 1 times [2018-06-22 10:53:48,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:48,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:48,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:48,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:48,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:48,590 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:48,861 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-06-22 10:53:49,593 INFO ]: Checked inductivity of 69 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 10:53:49,593 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:49,593 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 10:53:49,593 INFO ]: Interpolant automaton has 10 states [2018-06-22 10:53:49,594 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 10:53:49,594 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:53:49,594 INFO ]: Start difference. First operand 700 states and 801 transitions. Second operand 10 states. [2018-06-22 10:53:49,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:49,667 INFO ]: Finished difference Result 680 states and 767 transitions. [2018-06-22 10:53:49,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 10:53:49,670 INFO ]: Start accepts. Automaton has 10 states. Word has length 205 [2018-06-22 10:53:49,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:49,672 INFO ]: With dead ends: 680 [2018-06-22 10:53:49,672 INFO ]: Without dead ends: 660 [2018-06-22 10:53:49,672 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:53:49,673 INFO ]: Start minimizeSevpa. Operand 660 states. [2018-06-22 10:53:49,696 INFO ]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-06-22 10:53:49,696 INFO ]: Start removeUnreachable. Operand 660 states. [2018-06-22 10:53:49,698 INFO ]: Finished removeUnreachable. Reduced from 660 states to 660 states and 727 transitions. [2018-06-22 10:53:49,698 INFO ]: Start accepts. Automaton has 660 states and 727 transitions. Word has length 205 [2018-06-22 10:53:49,698 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:49,698 INFO ]: Abstraction has 660 states and 727 transitions. [2018-06-22 10:53:49,698 INFO ]: Interpolant automaton has 10 states. [2018-06-22 10:53:49,699 INFO ]: Start isEmpty. Operand 660 states and 727 transitions. [2018-06-22 10:53:49,701 INFO ]: Finished isEmpty. Found accepting run of length 218 [2018-06-22 10:53:49,701 INFO ]: Found error trace [2018-06-22 10:53:49,701 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:49,702 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:49,702 INFO ]: Analyzing trace with hash -788846308, now seen corresponding path program 1 times [2018-06-22 10:53:49,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:49,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:49,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:49,702 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:49,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:49,735 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:49,969 WARN ]: Spent 154.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:53:50,728 INFO ]: Checked inductivity of 131 backedges. 52 proven. 1 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-22 10:53:50,728 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:50,728 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:53:50,734 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:50,908 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:50,921 INFO ]: Computing forward predicates... [2018-06-22 10:53:51,532 INFO ]: Checked inductivity of 131 backedges. 52 proven. 1 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-22 10:53:51,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:51,553 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-06-22 10:53:51,553 INFO ]: Interpolant automaton has 44 states [2018-06-22 10:53:51,554 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 10:53:51,554 INFO ]: CoverageRelationStatistics Valid=106, Invalid=1786, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:53:51,554 INFO ]: Start difference. First operand 660 states and 727 transitions. Second operand 44 states. [2018-06-22 10:53:53,111 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:53,111 INFO ]: Finished difference Result 703 states and 781 transitions. [2018-06-22 10:53:53,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:53:53,114 INFO ]: Start accepts. Automaton has 44 states. Word has length 217 [2018-06-22 10:53:53,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:53,116 INFO ]: With dead ends: 703 [2018-06-22 10:53:53,116 INFO ]: Without dead ends: 597 [2018-06-22 10:53:53,117 INFO ]: 0 DeclaredPredicates, 242 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=106, Invalid=1786, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:53:53,117 INFO ]: Start minimizeSevpa. Operand 597 states. [2018-06-22 10:53:53,136 INFO ]: Finished minimizeSevpa. Reduced states from 597 to 596. [2018-06-22 10:53:53,137 INFO ]: Start removeUnreachable. Operand 596 states. [2018-06-22 10:53:53,139 INFO ]: Finished removeUnreachable. Reduced from 596 states to 596 states and 657 transitions. [2018-06-22 10:53:53,139 INFO ]: Start accepts. Automaton has 596 states and 657 transitions. Word has length 217 [2018-06-22 10:53:53,139 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:53,139 INFO ]: Abstraction has 596 states and 657 transitions. [2018-06-22 10:53:53,139 INFO ]: Interpolant automaton has 44 states. [2018-06-22 10:53:53,139 INFO ]: Start isEmpty. Operand 596 states and 657 transitions. [2018-06-22 10:53:53,142 INFO ]: Finished isEmpty. Found accepting run of length 222 [2018-06-22 10:53:53,142 INFO ]: Found error trace [2018-06-22 10:53:53,142 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:53,142 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:53,143 INFO ]: Analyzing trace with hash 1973219736, now seen corresponding path program 1 times [2018-06-22 10:53:53,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:53,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:53,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:53,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:53,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:53,174 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:54,119 INFO ]: Checked inductivity of 76 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 10:53:54,119 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:54,119 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:53:54,127 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:54,302 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:54,313 INFO ]: Computing forward predicates... [2018-06-22 10:53:54,545 INFO ]: Checked inductivity of 76 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 10:53:54,565 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:54,565 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-06-22 10:53:54,565 INFO ]: Interpolant automaton has 49 states [2018-06-22 10:53:54,565 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-22 10:53:54,566 INFO ]: CoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 10:53:54,566 INFO ]: Start difference. First operand 596 states and 657 transitions. Second operand 49 states. [2018-06-22 10:53:55,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:55,933 INFO ]: Finished difference Result 834 states and 914 transitions. [2018-06-22 10:53:55,934 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 10:53:55,934 INFO ]: Start accepts. Automaton has 49 states. Word has length 221 [2018-06-22 10:53:55,934 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:55,936 INFO ]: With dead ends: 834 [2018-06-22 10:53:55,936 INFO ]: Without dead ends: 834 [2018-06-22 10:53:55,937 INFO ]: 0 DeclaredPredicates, 283 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=3629, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 10:53:55,938 INFO ]: Start minimizeSevpa. Operand 834 states. [2018-06-22 10:53:55,961 INFO ]: Finished minimizeSevpa. Reduced states from 834 to 672. [2018-06-22 10:53:55,961 INFO ]: Start removeUnreachable. Operand 672 states. [2018-06-22 10:53:55,964 INFO ]: Finished removeUnreachable. Reduced from 672 states to 672 states and 750 transitions. [2018-06-22 10:53:55,964 INFO ]: Start accepts. Automaton has 672 states and 750 transitions. Word has length 221 [2018-06-22 10:53:55,964 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:55,964 INFO ]: Abstraction has 672 states and 750 transitions. [2018-06-22 10:53:55,964 INFO ]: Interpolant automaton has 49 states. [2018-06-22 10:53:55,964 INFO ]: Start isEmpty. Operand 672 states and 750 transitions. [2018-06-22 10:53:55,967 INFO ]: Finished isEmpty. Found accepting run of length 222 [2018-06-22 10:53:55,967 INFO ]: Found error trace [2018-06-22 10:53:55,967 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:55,968 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:55,968 INFO ]: Analyzing trace with hash -2062223947, now seen corresponding path program 1 times [2018-06-22 10:53:55,968 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:55,968 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:55,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:55,968 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:55,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:55,991 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:56,655 INFO ]: Checked inductivity of 71 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 10:53:56,655 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:56,655 INFO ]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2018-06-22 10:53:56,656 INFO ]: Interpolant automaton has 32 states [2018-06-22 10:53:56,656 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 10:53:56,656 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:53:56,656 INFO ]: Start difference. First operand 672 states and 750 transitions. Second operand 32 states. [2018-06-22 10:53:57,563 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:57,563 INFO ]: Finished difference Result 789 states and 885 transitions. [2018-06-22 10:53:57,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 10:53:57,564 INFO ]: Start accepts. Automaton has 32 states. Word has length 221 [2018-06-22 10:53:57,564 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:57,566 INFO ]: With dead ends: 789 [2018-06-22 10:53:57,566 INFO ]: Without dead ends: 678 [2018-06-22 10:53:57,567 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:53:57,567 INFO ]: Start minimizeSevpa. Operand 678 states. [2018-06-22 10:53:57,585 INFO ]: Finished minimizeSevpa. Reduced states from 678 to 616. [2018-06-22 10:53:57,585 INFO ]: Start removeUnreachable. Operand 616 states. [2018-06-22 10:53:57,587 INFO ]: Finished removeUnreachable. Reduced from 616 states to 616 states and 677 transitions. [2018-06-22 10:53:57,587 INFO ]: Start accepts. Automaton has 616 states and 677 transitions. Word has length 221 [2018-06-22 10:53:57,588 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:57,588 INFO ]: Abstraction has 616 states and 677 transitions. [2018-06-22 10:53:57,588 INFO ]: Interpolant automaton has 32 states. [2018-06-22 10:53:57,588 INFO ]: Start isEmpty. Operand 616 states and 677 transitions. [2018-06-22 10:53:57,590 INFO ]: Finished isEmpty. Found accepting run of length 222 [2018-06-22 10:53:57,590 INFO ]: Found error trace [2018-06-22 10:53:57,591 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:57,591 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:57,591 INFO ]: Analyzing trace with hash -882178127, now seen corresponding path program 1 times [2018-06-22 10:53:57,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:57,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:57,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:57,591 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:57,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:57,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:58,181 INFO ]: Checked inductivity of 68 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 10:53:58,181 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:58,181 INFO ]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2018-06-22 10:53:58,182 INFO ]: Interpolant automaton has 32 states [2018-06-22 10:53:58,182 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 10:53:58,182 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:53:58,182 INFO ]: Start difference. First operand 616 states and 677 transitions. Second operand 32 states. [2018-06-22 10:53:59,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:59,183 INFO ]: Finished difference Result 660 states and 723 transitions. [2018-06-22 10:53:59,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 10:53:59,183 INFO ]: Start accepts. Automaton has 32 states. Word has length 221 [2018-06-22 10:53:59,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:59,185 INFO ]: With dead ends: 660 [2018-06-22 10:53:59,185 INFO ]: Without dead ends: 618 [2018-06-22 10:53:59,185 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:53:59,185 INFO ]: Start minimizeSevpa. Operand 618 states. [2018-06-22 10:53:59,201 INFO ]: Finished minimizeSevpa. Reduced states from 618 to 609. [2018-06-22 10:53:59,201 INFO ]: Start removeUnreachable. Operand 609 states. [2018-06-22 10:53:59,203 INFO ]: Finished removeUnreachable. Reduced from 609 states to 609 states and 646 transitions. [2018-06-22 10:53:59,203 INFO ]: Start accepts. Automaton has 609 states and 646 transitions. Word has length 221 [2018-06-22 10:53:59,203 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:59,204 INFO ]: Abstraction has 609 states and 646 transitions. [2018-06-22 10:53:59,204 INFO ]: Interpolant automaton has 32 states. [2018-06-22 10:53:59,204 INFO ]: Start isEmpty. Operand 609 states and 646 transitions. [2018-06-22 10:53:59,205 INFO ]: Finished isEmpty. Found accepting run of length 222 [2018-06-22 10:53:59,205 INFO ]: Found error trace [2018-06-22 10:53:59,206 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:59,206 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:59,206 INFO ]: Analyzing trace with hash -620082926, now seen corresponding path program 1 times [2018-06-22 10:53:59,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:59,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:59,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:59,206 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:59,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:59,233 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:00,217 INFO ]: Checked inductivity of 76 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 10:54:00,217 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:00,217 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:54:00,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:00,395 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:00,406 INFO ]: Computing forward predicates... [2018-06-22 10:54:00,578 INFO ]: Checked inductivity of 76 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 10:54:00,600 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:00,600 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-06-22 10:54:00,600 INFO ]: Interpolant automaton has 49 states [2018-06-22 10:54:00,600 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-22 10:54:00,601 INFO ]: CoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 10:54:00,601 INFO ]: Start difference. First operand 609 states and 646 transitions. Second operand 49 states. [2018-06-22 10:54:02,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:02,098 INFO ]: Finished difference Result 751 states and 803 transitions. [2018-06-22 10:54:02,100 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 10:54:02,100 INFO ]: Start accepts. Automaton has 49 states. Word has length 221 [2018-06-22 10:54:02,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:02,102 INFO ]: With dead ends: 751 [2018-06-22 10:54:02,102 INFO ]: Without dead ends: 751 [2018-06-22 10:54:02,104 INFO ]: 0 DeclaredPredicates, 283 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=3629, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 10:54:02,106 INFO ]: Start minimizeSevpa. Operand 751 states. [2018-06-22 10:54:02,124 INFO ]: Finished minimizeSevpa. Reduced states from 751 to 667. [2018-06-22 10:54:02,124 INFO ]: Start removeUnreachable. Operand 667 states. [2018-06-22 10:54:02,131 INFO ]: Finished removeUnreachable. Reduced from 667 states to 667 states and 718 transitions. [2018-06-22 10:54:02,131 INFO ]: Start accepts. Automaton has 667 states and 718 transitions. Word has length 221 [2018-06-22 10:54:02,132 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:02,132 INFO ]: Abstraction has 667 states and 718 transitions. [2018-06-22 10:54:02,132 INFO ]: Interpolant automaton has 49 states. [2018-06-22 10:54:02,132 INFO ]: Start isEmpty. Operand 667 states and 718 transitions. [2018-06-22 10:54:02,134 INFO ]: Finished isEmpty. Found accepting run of length 222 [2018-06-22 10:54:02,134 INFO ]: Found error trace [2018-06-22 10:54:02,134 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:02,134 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:02,134 INFO ]: Analyzing trace with hash 559962894, now seen corresponding path program 1 times [2018-06-22 10:54:02,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:02,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:02,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:02,135 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:02,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:02,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:02,688 INFO ]: Checked inductivity of 68 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 10:54:02,688 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:02,688 INFO ]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2018-06-22 10:54:02,688 INFO ]: Interpolant automaton has 32 states [2018-06-22 10:54:02,688 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 10:54:02,689 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:54:02,689 INFO ]: Start difference. First operand 667 states and 718 transitions. Second operand 32 states. [2018-06-22 10:54:03,905 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:03,906 INFO ]: Finished difference Result 656 states and 730 transitions. [2018-06-22 10:54:03,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 10:54:03,919 INFO ]: Start accepts. Automaton has 32 states. Word has length 221 [2018-06-22 10:54:03,919 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:03,920 INFO ]: With dead ends: 656 [2018-06-22 10:54:03,920 INFO ]: Without dead ends: 538 [2018-06-22 10:54:03,921 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:54:03,921 INFO ]: Start minimizeSevpa. Operand 538 states. [2018-06-22 10:54:03,933 INFO ]: Finished minimizeSevpa. Reduced states from 538 to 511. [2018-06-22 10:54:03,933 INFO ]: Start removeUnreachable. Operand 511 states. [2018-06-22 10:54:03,935 INFO ]: Finished removeUnreachable. Reduced from 511 states to 511 states and 530 transitions. [2018-06-22 10:54:03,938 INFO ]: Start accepts. Automaton has 511 states and 530 transitions. Word has length 221 [2018-06-22 10:54:03,938 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:03,938 INFO ]: Abstraction has 511 states and 530 transitions. [2018-06-22 10:54:03,938 INFO ]: Interpolant automaton has 32 states. [2018-06-22 10:54:03,938 INFO ]: Start isEmpty. Operand 511 states and 530 transitions. [2018-06-22 10:54:03,940 INFO ]: Finished isEmpty. Found accepting run of length 306 [2018-06-22 10:54:03,940 INFO ]: Found error trace [2018-06-22 10:54:03,941 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:03,941 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:03,941 INFO ]: Analyzing trace with hash -327473106, now seen corresponding path program 2 times [2018-06-22 10:54:03,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:03,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:03,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:03,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:03,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:03,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:04,786 INFO ]: Checked inductivity of 219 backedges. 70 proven. 46 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-06-22 10:54:04,786 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:04,786 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) [2018-06-22 10:54:04,795 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:54:05,017 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:54:05,017 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:05,032 INFO ]: Computing forward predicates... [2018-06-22 10:54:06,153 INFO ]: Checked inductivity of 219 backedges. 72 proven. 48 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-06-22 10:54:06,185 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:06,185 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 43] total 62 [2018-06-22 10:54:06,185 INFO ]: Interpolant automaton has 62 states [2018-06-22 10:54:06,186 INFO ]: Constructing interpolant automaton starting with 62 interpolants. [2018-06-22 10:54:06,186 INFO ]: CoverageRelationStatistics Valid=142, Invalid=3640, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 10:54:06,186 INFO ]: Start difference. First operand 511 states and 530 transitions. Second operand 62 states. Received shutdown request... [2018-06-22 10:54:07,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 10:54:07,740 WARN ]: Verification canceled [2018-06-22 10:54:07,912 WARN ]: Timeout [2018-06-22 10:54:07,913 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:54:07 BoogieIcfgContainer [2018-06-22 10:54:07,913 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:54:07,913 INFO ]: Toolchain (without parser) took 54559.54 ms. Allocated memory was 302.0 MB in the beginning and 1.0 GB in the end (delta: 740.8 MB). Free memory was 222.4 MB in the beginning and 1.0 GB in the end (delta: -777.9 MB). Peak memory consumption was 554.8 MB. Max. memory is 3.6 GB. [2018-06-22 10:54:07,914 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 302.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:54:07,914 INFO ]: ChcToBoogie took 73.51 ms. Allocated memory is still 302.0 MB. Free memory was 221.4 MB in the beginning and 219.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:54:07,914 INFO ]: Boogie Preprocessor took 76.06 ms. Allocated memory is still 302.0 MB. Free memory was 219.4 MB in the beginning and 216.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:54:07,915 INFO ]: RCFGBuilder took 1066.92 ms. Allocated memory was 302.0 MB in the beginning and 321.9 MB in the end (delta: 19.9 MB). Free memory was 216.4 MB in the beginning and 283.8 MB in the end (delta: -67.4 MB). Peak memory consumption was 41.3 MB. Max. memory is 3.6 GB. [2018-06-22 10:54:07,915 INFO ]: TraceAbstraction took 53330.37 ms. Allocated memory was 321.9 MB in the beginning and 1.0 GB in the end (delta: 720.9 MB). Free memory was 282.3 MB in the beginning and 1.0 GB in the end (delta: -718.0 MB). Peak memory consumption was 594.8 MB. Max. memory is 3.6 GB. [2018-06-22 10:54:07,923 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 302.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 73.51 ms. Allocated memory is still 302.0 MB. Free memory was 221.4 MB in the beginning and 219.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 76.06 ms. Allocated memory is still 302.0 MB. Free memory was 219.4 MB in the beginning and 216.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1066.92 ms. Allocated memory was 302.0 MB in the beginning and 321.9 MB in the end (delta: 19.9 MB). Free memory was 216.4 MB in the beginning and 283.8 MB in the end (delta: -67.4 MB). Peak memory consumption was 41.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53330.37 ms. Allocated memory was 321.9 MB in the beginning and 1.0 GB in the end (delta: 720.9 MB). Free memory was 282.3 MB in the beginning and 1.0 GB in the end (delta: -718.0 MB). Peak memory consumption was 594.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (511states) and interpolant automaton (currently 52 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 90 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 44 procedures, 182 locations, 1 error locations. TIMEOUT Result, 53.2s OverallTime, 28 OverallIterations, 4 TraceHistogramMax, 25.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5663 SDtfs, 429 SDslu, 145044 SDs, 0 SdLazy, 31883 SolverSat, 345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2186 GetRequests, 1291 SyntacticMatches, 11 SemanticMatches, 883 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3200 ImplicationChecksByTransitivity, 24.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=791occurred in iteration=18, 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.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 837 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 6190 NumberOfCodeBlocks, 6190 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 6156 ConstructedInterpolants, 0 QuantifiedInterpolants, 2128980 SizeOfPredicates, 26 NumberOfNonLiveVariables, 10475 ConjunctsInSsa, 299 ConjunctsInUnsatCore, 34 InterpolantComputations, 22 PerfectInterpolantSequences, 1776/2048 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/31.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-54-07-934.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/31.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-54-07-934.csv Completed graceful shutdown