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/06.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:47:41,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:47:41,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:47:41,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:47:41,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:47:41,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:47:41,602 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:47:41,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:47:41,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:47:41,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:47:41,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:47:41,614 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:47:41,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:47:41,616 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:47:41,616 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:47:41,617 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:47:41,619 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:47:41,621 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:47:41,622 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:47:41,623 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:47:41,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:47:41,632 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:47:41,632 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:47:41,632 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:47:41,633 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:47:41,634 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:47:41,634 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:47:41,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:47:41,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:47:41,639 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:47:41,640 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:47:41,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:47:41,645 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:47:41,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:47:41,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:47:41,647 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:47:41,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:47:41,666 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:47:41,666 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:47:41,666 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:47:41,668 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:47:41,668 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:47:41,668 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:47:41,669 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:47:41,669 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:47:41,669 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:47:41,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:47:41,669 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:47:41,669 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:47:41,670 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:47:41,670 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:47:41,670 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:47:41,670 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:47:41,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:47:41,671 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:47:41,673 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:47:41,673 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:47:41,727 INFO ]: Repository-Root is: /tmp [2018-06-22 10:47:41,739 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:47:41,746 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:47:41,747 INFO ]: Initializing SmtParser... [2018-06-22 10:47:41,747 INFO ]: SmtParser initialized [2018-06-22 10:47:41,748 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/06.c.smt2 [2018-06-22 10:47:41,750 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:47:41,827 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/06.c.smt2 unknown [2018-06-22 10:47:42,292 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/06.c.smt2 [2018-06-22 10:47:42,306 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:47:42,312 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:47:42,312 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:47:42,312 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:47:42,312 INFO ]: ChcToBoogie initialized [2018-06-22 10:47:42,321 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:47:42" (1/1) ... [2018-06-22 10:47:42,420 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:42 Unit [2018-06-22 10:47:42,420 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:47:42,421 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:47:42,421 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:47:42,421 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:47:42,460 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:42" (1/1) ... [2018-06-22 10:47:42,460 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:42" (1/1) ... [2018-06-22 10:47:42,476 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:42" (1/1) ... [2018-06-22 10:47:42,477 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:42" (1/1) ... [2018-06-22 10:47:42,506 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:42" (1/1) ... [2018-06-22 10:47:42,508 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:42" (1/1) ... [2018-06-22 10:47:42,510 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:42" (1/1) ... [2018-06-22 10:47:42,515 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:47:42,515 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:47:42,515 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:47:42,515 INFO ]: RCFGBuilder initialized [2018-06-22 10:47:42,516 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:42" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:47:42,528 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:47:42,528 INFO ]: Found specification of procedure False [2018-06-22 10:47:42,528 INFO ]: Found implementation of procedure False [2018-06-22 10:47:42,528 INFO ]: Specification and implementation of procedure h37 given in one single declaration [2018-06-22 10:47:42,528 INFO ]: Found specification of procedure h37 [2018-06-22 10:47:42,528 INFO ]: Found implementation of procedure h37 [2018-06-22 10:47:42,528 INFO ]: Specification and implementation of procedure h36 given in one single declaration [2018-06-22 10:47:42,528 INFO ]: Found specification of procedure h36 [2018-06-22 10:47:42,528 INFO ]: Found implementation of procedure h36 [2018-06-22 10:47:42,528 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:47:42,528 INFO ]: Found specification of procedure h14 [2018-06-22 10:47:42,528 INFO ]: Found implementation of procedure h14 [2018-06-22 10:47:42,528 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:47:42,528 INFO ]: Found specification of procedure h13 [2018-06-22 10:47:42,528 INFO ]: Found implementation of procedure h13 [2018-06-22 10:47:42,528 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:47:42,528 INFO ]: Found specification of procedure h12 [2018-06-22 10:47:42,528 INFO ]: Found implementation of procedure h12 [2018-06-22 10:47:42,528 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:47:42,528 INFO ]: Found specification of procedure h8 [2018-06-22 10:47:42,528 INFO ]: Found implementation of procedure h8 [2018-06-22 10:47:42,528 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:47:42,528 INFO ]: Found specification of procedure h7 [2018-06-22 10:47:42,529 INFO ]: Found implementation of procedure h7 [2018-06-22 10:47:42,529 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:47:42,529 INFO ]: Found specification of procedure h6 [2018-06-22 10:47:42,529 INFO ]: Found implementation of procedure h6 [2018-06-22 10:47:42,529 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:47:42,529 INFO ]: Found specification of procedure h5 [2018-06-22 10:47:42,529 INFO ]: Found implementation of procedure h5 [2018-06-22 10:47:42,529 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:47:42,529 INFO ]: Found specification of procedure h4 [2018-06-22 10:47:42,529 INFO ]: Found implementation of procedure h4 [2018-06-22 10:47:42,529 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:47:42,529 INFO ]: Found specification of procedure h3 [2018-06-22 10:47:42,529 INFO ]: Found implementation of procedure h3 [2018-06-22 10:47:42,529 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:47:42,529 INFO ]: Found specification of procedure h2 [2018-06-22 10:47:42,529 INFO ]: Found implementation of procedure h2 [2018-06-22 10:47:42,529 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:47:42,529 INFO ]: Found specification of procedure h1 [2018-06-22 10:47:42,529 INFO ]: Found implementation of procedure h1 [2018-06-22 10:47:42,529 INFO ]: Specification and implementation of procedure h35 given in one single declaration [2018-06-22 10:47:42,529 INFO ]: Found specification of procedure h35 [2018-06-22 10:47:42,529 INFO ]: Found implementation of procedure h35 [2018-06-22 10:47:42,529 INFO ]: Specification and implementation of procedure h25 given in one single declaration [2018-06-22 10:47:42,529 INFO ]: Found specification of procedure h25 [2018-06-22 10:47:42,529 INFO ]: Found implementation of procedure h25 [2018-06-22 10:47:42,529 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:47:42,529 INFO ]: Found specification of procedure h24 [2018-06-22 10:47:42,529 INFO ]: Found implementation of procedure h24 [2018-06-22 10:47:42,530 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:47:42,530 INFO ]: Found specification of procedure h23 [2018-06-22 10:47:42,530 INFO ]: Found implementation of procedure h23 [2018-06-22 10:47:42,530 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:47:42,530 INFO ]: Found specification of procedure h19 [2018-06-22 10:47:42,530 INFO ]: Found implementation of procedure h19 [2018-06-22 10:47:42,530 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:47:42,530 INFO ]: Found specification of procedure h18 [2018-06-22 10:47:42,530 INFO ]: Found implementation of procedure h18 [2018-06-22 10:47:42,530 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:47:42,530 INFO ]: Found specification of procedure h17 [2018-06-22 10:47:42,530 INFO ]: Found implementation of procedure h17 [2018-06-22 10:47:42,530 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:47:42,530 INFO ]: Found specification of procedure h16 [2018-06-22 10:47:42,530 INFO ]: Found implementation of procedure h16 [2018-06-22 10:47:42,530 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:47:42,530 INFO ]: Found specification of procedure h15 [2018-06-22 10:47:42,530 INFO ]: Found implementation of procedure h15 [2018-06-22 10:47:42,530 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:47:42,530 INFO ]: Found specification of procedure h10 [2018-06-22 10:47:42,530 INFO ]: Found implementation of procedure h10 [2018-06-22 10:47:42,530 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:47:42,530 INFO ]: Found specification of procedure h11 [2018-06-22 10:47:42,530 INFO ]: Found implementation of procedure h11 [2018-06-22 10:47:42,530 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:47:42,531 INFO ]: Found specification of procedure h9 [2018-06-22 10:47:42,531 INFO ]: Found implementation of procedure h9 [2018-06-22 10:47:42,531 INFO ]: Specification and implementation of procedure h32 given in one single declaration [2018-06-22 10:47:42,531 INFO ]: Found specification of procedure h32 [2018-06-22 10:47:42,531 INFO ]: Found implementation of procedure h32 [2018-06-22 10:47:42,531 INFO ]: Specification and implementation of procedure h31 given in one single declaration [2018-06-22 10:47:42,531 INFO ]: Found specification of procedure h31 [2018-06-22 10:47:42,531 INFO ]: Found implementation of procedure h31 [2018-06-22 10:47:42,531 INFO ]: Specification and implementation of procedure h29 given in one single declaration [2018-06-22 10:47:42,531 INFO ]: Found specification of procedure h29 [2018-06-22 10:47:42,531 INFO ]: Found implementation of procedure h29 [2018-06-22 10:47:42,531 INFO ]: Specification and implementation of procedure h30 given in one single declaration [2018-06-22 10:47:42,531 INFO ]: Found specification of procedure h30 [2018-06-22 10:47:42,531 INFO ]: Found implementation of procedure h30 [2018-06-22 10:47:42,531 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:47:42,531 INFO ]: Found specification of procedure h21 [2018-06-22 10:47:42,531 INFO ]: Found implementation of procedure h21 [2018-06-22 10:47:42,531 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:47:42,531 INFO ]: Found specification of procedure h22 [2018-06-22 10:47:42,531 INFO ]: Found implementation of procedure h22 [2018-06-22 10:47:42,531 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:47:42,531 INFO ]: Found specification of procedure h20 [2018-06-22 10:47:42,531 INFO ]: Found implementation of procedure h20 [2018-06-22 10:47:42,531 INFO ]: Specification and implementation of procedure h28 given in one single declaration [2018-06-22 10:47:42,531 INFO ]: Found specification of procedure h28 [2018-06-22 10:47:42,531 INFO ]: Found implementation of procedure h28 [2018-06-22 10:47:42,531 INFO ]: Specification and implementation of procedure h27 given in one single declaration [2018-06-22 10:47:42,531 INFO ]: Found specification of procedure h27 [2018-06-22 10:47:42,531 INFO ]: Found implementation of procedure h27 [2018-06-22 10:47:42,532 INFO ]: Specification and implementation of procedure h26 given in one single declaration [2018-06-22 10:47:42,532 INFO ]: Found specification of procedure h26 [2018-06-22 10:47:42,532 INFO ]: Found implementation of procedure h26 [2018-06-22 10:47:42,532 INFO ]: Specification and implementation of procedure h34 given in one single declaration [2018-06-22 10:47:42,536 INFO ]: Found specification of procedure h34 [2018-06-22 10:47:42,536 INFO ]: Found implementation of procedure h34 [2018-06-22 10:47:42,536 INFO ]: Specification and implementation of procedure h33 given in one single declaration [2018-06-22 10:47:42,536 INFO ]: Found specification of procedure h33 [2018-06-22 10:47:42,536 INFO ]: Found implementation of procedure h33 [2018-06-22 10:47:42,536 INFO ]: Specification and implementation of procedure h38 given in one single declaration [2018-06-22 10:47:42,536 INFO ]: Found specification of procedure h38 [2018-06-22 10:47:42,536 INFO ]: Found implementation of procedure h38 [2018-06-22 10:47:42,536 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:47:42,536 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:47:42,537 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:47:43,234 INFO ]: Using library mode [2018-06-22 10:47:43,234 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:47:43 BoogieIcfgContainer [2018-06-22 10:47:43,234 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:47:43,237 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:47:43,237 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:47:43,240 INFO ]: TraceAbstraction initialized [2018-06-22 10:47:43,240 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:47:42" (1/3) ... [2018-06-22 10:47:43,241 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be0bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:47:43, skipping insertion in model container [2018-06-22 10:47:43,241 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:42" (2/3) ... [2018-06-22 10:47:43,242 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be0bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:47:43, skipping insertion in model container [2018-06-22 10:47:43,242 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:47:43" (3/3) ... [2018-06-22 10:47:43,243 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:47:43,252 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:47:43,264 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:47:43,304 INFO ]: Using default assertion order modulation [2018-06-22 10:47:43,304 INFO ]: Interprodecural is true [2018-06-22 10:47:43,304 INFO ]: Hoare is false [2018-06-22 10:47:43,304 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:47:43,304 INFO ]: Backedges is TWOTRACK [2018-06-22 10:47:43,304 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:47:43,304 INFO ]: Difference is false [2018-06-22 10:47:43,304 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:47:43,304 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:47:43,325 INFO ]: Start isEmpty. Operand 169 states. [2018-06-22 10:47:43,347 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:47:43,347 INFO ]: Found error trace [2018-06-22 10:47:43,348 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] [2018-06-22 10:47:43,348 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:43,352 INFO ]: Analyzing trace with hash -658742055, now seen corresponding path program 1 times [2018-06-22 10:47:43,353 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:43,353 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:43,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:43,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:43,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:43,485 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:44,478 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:47:44,480 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:44,480 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:47:44,483 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:47:44,498 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:47:44,498 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:47:44,501 INFO ]: Start difference. First operand 169 states. Second operand 14 states. [2018-06-22 10:47:45,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:45,114 INFO ]: Finished difference Result 183 states and 202 transitions. [2018-06-22 10:47:45,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:47:45,118 INFO ]: Start accepts. Automaton has 14 states. Word has length 57 [2018-06-22 10:47:45,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:45,133 INFO ]: With dead ends: 183 [2018-06-22 10:47:45,133 INFO ]: Without dead ends: 183 [2018-06-22 10:47:45,135 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:47:45,148 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-22 10:47:45,190 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-06-22 10:47:45,191 INFO ]: Start removeUnreachable. Operand 183 states. [2018-06-22 10:47:45,195 INFO ]: Finished removeUnreachable. Reduced from 183 states to 183 states and 202 transitions. [2018-06-22 10:47:45,196 INFO ]: Start accepts. Automaton has 183 states and 202 transitions. Word has length 57 [2018-06-22 10:47:45,197 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:45,197 INFO ]: Abstraction has 183 states and 202 transitions. [2018-06-22 10:47:45,197 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:47:45,197 INFO ]: Start isEmpty. Operand 183 states and 202 transitions. [2018-06-22 10:47:45,203 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:47:45,203 INFO ]: Found error trace [2018-06-22 10:47:45,203 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] [2018-06-22 10:47:45,203 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:45,203 INFO ]: Analyzing trace with hash -288641124, now seen corresponding path program 1 times [2018-06-22 10:47:45,203 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:45,203 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:45,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:45,204 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:45,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:45,237 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:45,650 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:47:45,650 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:45,717 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:47:45,719 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:47:45,719 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:47:45,719 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:47:45,719 INFO ]: Start difference. First operand 183 states and 202 transitions. Second operand 14 states. [2018-06-22 10:47:46,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:46,226 INFO ]: Finished difference Result 183 states and 201 transitions. [2018-06-22 10:47:46,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:47:46,226 INFO ]: Start accepts. Automaton has 14 states. Word has length 57 [2018-06-22 10:47:46,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:46,230 INFO ]: With dead ends: 183 [2018-06-22 10:47:46,230 INFO ]: Without dead ends: 175 [2018-06-22 10:47:46,231 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:47:46,231 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-22 10:47:46,246 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-06-22 10:47:46,246 INFO ]: Start removeUnreachable. Operand 175 states. [2018-06-22 10:47:46,249 INFO ]: Finished removeUnreachable. Reduced from 175 states to 175 states and 193 transitions. [2018-06-22 10:47:46,249 INFO ]: Start accepts. Automaton has 175 states and 193 transitions. Word has length 57 [2018-06-22 10:47:46,249 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:46,249 INFO ]: Abstraction has 175 states and 193 transitions. [2018-06-22 10:47:46,249 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:47:46,249 INFO ]: Start isEmpty. Operand 175 states and 193 transitions. [2018-06-22 10:47:46,253 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:47:46,253 INFO ]: Found error trace [2018-06-22 10:47:46,253 INFO ]: trace histogram [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] [2018-06-22 10:47:46,254 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:46,254 INFO ]: Analyzing trace with hash 2050606558, now seen corresponding path program 1 times [2018-06-22 10:47:46,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:46,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:46,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:46,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:46,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:46,288 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:46,647 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:47:46,647 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:46,647 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-06-22 10:47:46,648 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:47:46,648 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:47:46,648 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:47:46,648 INFO ]: Start difference. First operand 175 states and 193 transitions. Second operand 18 states. [2018-06-22 10:47:47,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:47,310 INFO ]: Finished difference Result 245 states and 288 transitions. [2018-06-22 10:47:47,310 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:47:47,310 INFO ]: Start accepts. Automaton has 18 states. Word has length 117 [2018-06-22 10:47:47,311 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:47,316 INFO ]: With dead ends: 245 [2018-06-22 10:47:47,316 INFO ]: Without dead ends: 245 [2018-06-22 10:47:47,316 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:47:47,316 INFO ]: Start minimizeSevpa. Operand 245 states. [2018-06-22 10:47:47,346 INFO ]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-06-22 10:47:47,346 INFO ]: Start removeUnreachable. Operand 243 states. [2018-06-22 10:47:47,349 INFO ]: Finished removeUnreachable. Reduced from 243 states to 243 states and 285 transitions. [2018-06-22 10:47:47,350 INFO ]: Start accepts. Automaton has 243 states and 285 transitions. Word has length 117 [2018-06-22 10:47:47,351 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:47,351 INFO ]: Abstraction has 243 states and 285 transitions. [2018-06-22 10:47:47,351 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:47:47,351 INFO ]: Start isEmpty. Operand 243 states and 285 transitions. [2018-06-22 10:47:47,355 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:47:47,355 INFO ]: Found error trace [2018-06-22 10:47:47,356 INFO ]: trace histogram [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] [2018-06-22 10:47:47,356 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:47,356 INFO ]: Analyzing trace with hash -376784933, now seen corresponding path program 1 times [2018-06-22 10:47:47,356 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:47,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:47,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:47,357 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:47,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:47,403 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:47,680 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:47:47,680 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:47,680 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-06-22 10:47:47,681 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:47:47,681 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:47:47,681 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:47:47,681 INFO ]: Start difference. First operand 243 states and 285 transitions. Second operand 18 states. [2018-06-22 10:47:48,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:48,129 INFO ]: Finished difference Result 337 states and 416 transitions. [2018-06-22 10:47:48,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:47:48,129 INFO ]: Start accepts. Automaton has 18 states. Word has length 117 [2018-06-22 10:47:48,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:48,132 INFO ]: With dead ends: 337 [2018-06-22 10:47:48,132 INFO ]: Without dead ends: 328 [2018-06-22 10:47:48,132 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:47:48,133 INFO ]: Start minimizeSevpa. Operand 328 states. [2018-06-22 10:47:48,163 INFO ]: Finished minimizeSevpa. Reduced states from 328 to 310. [2018-06-22 10:47:48,163 INFO ]: Start removeUnreachable. Operand 310 states. [2018-06-22 10:47:48,166 INFO ]: Finished removeUnreachable. Reduced from 310 states to 310 states and 371 transitions. [2018-06-22 10:47:48,166 INFO ]: Start accepts. Automaton has 310 states and 371 transitions. Word has length 117 [2018-06-22 10:47:48,167 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:48,167 INFO ]: Abstraction has 310 states and 371 transitions. [2018-06-22 10:47:48,167 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:47:48,167 INFO ]: Start isEmpty. Operand 310 states and 371 transitions. [2018-06-22 10:47:48,172 INFO ]: Finished isEmpty. Found accepting run of length 154 [2018-06-22 10:47:48,172 INFO ]: Found error trace [2018-06-22 10:47:48,172 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] [2018-06-22 10:47:48,172 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:48,172 INFO ]: Analyzing trace with hash -1237431752, now seen corresponding path program 1 times [2018-06-22 10:47:48,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:48,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:48,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:48,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:48,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:48,198 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:48,452 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:48,452 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:48,452 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:47:48,453 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:47:48,453 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:47:48,453 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:48,454 INFO ]: Start difference. First operand 310 states and 371 transitions. Second operand 12 states. [2018-06-22 10:47:48,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:48,670 INFO ]: Finished difference Result 365 states and 457 transitions. [2018-06-22 10:47:48,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:47:48,673 INFO ]: Start accepts. Automaton has 12 states. Word has length 153 [2018-06-22 10:47:48,674 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:48,678 INFO ]: With dead ends: 365 [2018-06-22 10:47:48,678 INFO ]: Without dead ends: 365 [2018-06-22 10:47:48,678 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:48,679 INFO ]: Start minimizeSevpa. Operand 365 states. [2018-06-22 10:47:48,702 INFO ]: Finished minimizeSevpa. Reduced states from 365 to 355. [2018-06-22 10:47:48,702 INFO ]: Start removeUnreachable. Operand 355 states. [2018-06-22 10:47:48,706 INFO ]: Finished removeUnreachable. Reduced from 355 states to 355 states and 438 transitions. [2018-06-22 10:47:48,707 INFO ]: Start accepts. Automaton has 355 states and 438 transitions. Word has length 153 [2018-06-22 10:47:48,707 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:48,707 INFO ]: Abstraction has 355 states and 438 transitions. [2018-06-22 10:47:48,707 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:47:48,707 INFO ]: Start isEmpty. Operand 355 states and 438 transitions. [2018-06-22 10:47:48,711 INFO ]: Finished isEmpty. Found accepting run of length 154 [2018-06-22 10:47:48,711 INFO ]: Found error trace [2018-06-22 10:47:48,712 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] [2018-06-22 10:47:48,712 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:48,712 INFO ]: Analyzing trace with hash -892640272, now seen corresponding path program 1 times [2018-06-22 10:47:48,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:48,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:48,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:48,713 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:48,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:48,739 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:48,924 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:48,924 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:48,924 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:47:48,925 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:47:48,925 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:47:48,925 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:48,925 INFO ]: Start difference. First operand 355 states and 438 transitions. Second operand 12 states. [2018-06-22 10:47:50,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:50,434 INFO ]: Finished difference Result 422 states and 541 transitions. [2018-06-22 10:47:50,435 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:47:50,435 INFO ]: Start accepts. Automaton has 12 states. Word has length 153 [2018-06-22 10:47:50,435 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:50,439 INFO ]: With dead ends: 422 [2018-06-22 10:47:50,439 INFO ]: Without dead ends: 421 [2018-06-22 10:47:50,439 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:50,439 INFO ]: Start minimizeSevpa. Operand 421 states. [2018-06-22 10:47:50,463 INFO ]: Finished minimizeSevpa. Reduced states from 421 to 395. [2018-06-22 10:47:50,463 INFO ]: Start removeUnreachable. Operand 395 states. [2018-06-22 10:47:50,467 INFO ]: Finished removeUnreachable. Reduced from 395 states to 395 states and 486 transitions. [2018-06-22 10:47:50,467 INFO ]: Start accepts. Automaton has 395 states and 486 transitions. Word has length 153 [2018-06-22 10:47:50,468 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:50,468 INFO ]: Abstraction has 395 states and 486 transitions. [2018-06-22 10:47:50,468 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:47:50,468 INFO ]: Start isEmpty. Operand 395 states and 486 transitions. [2018-06-22 10:47:50,472 INFO ]: Finished isEmpty. Found accepting run of length 154 [2018-06-22 10:47:50,472 INFO ]: Found error trace [2018-06-22 10:47:50,472 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] [2018-06-22 10:47:50,472 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:50,472 INFO ]: Analyzing trace with hash 682086869, now seen corresponding path program 1 times [2018-06-22 10:47:50,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:50,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:50,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:50,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:50,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:50,491 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:51,296 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:51,296 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:51,296 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:47:51,296 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:47:51,296 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:47:51,296 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:51,297 INFO ]: Start difference. First operand 395 states and 486 transitions. Second operand 12 states. [2018-06-22 10:47:51,646 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:51,646 INFO ]: Finished difference Result 465 states and 561 transitions. [2018-06-22 10:47:51,646 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:47:51,646 INFO ]: Start accepts. Automaton has 12 states. Word has length 153 [2018-06-22 10:47:51,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:51,650 INFO ]: With dead ends: 465 [2018-06-22 10:47:51,650 INFO ]: Without dead ends: 441 [2018-06-22 10:47:51,650 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:51,650 INFO ]: Start minimizeSevpa. Operand 441 states. [2018-06-22 10:47:51,683 INFO ]: Finished minimizeSevpa. Reduced states from 441 to 413. [2018-06-22 10:47:51,683 INFO ]: Start removeUnreachable. Operand 413 states. [2018-06-22 10:47:51,686 INFO ]: Finished removeUnreachable. Reduced from 413 states to 413 states and 508 transitions. [2018-06-22 10:47:51,686 INFO ]: Start accepts. Automaton has 413 states and 508 transitions. Word has length 153 [2018-06-22 10:47:51,686 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:51,686 INFO ]: Abstraction has 413 states and 508 transitions. [2018-06-22 10:47:51,686 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:47:51,686 INFO ]: Start isEmpty. Operand 413 states and 508 transitions. [2018-06-22 10:47:51,691 INFO ]: Finished isEmpty. Found accepting run of length 154 [2018-06-22 10:47:51,691 INFO ]: Found error trace [2018-06-22 10:47:51,692 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] [2018-06-22 10:47:51,692 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:51,693 INFO ]: Analyzing trace with hash 472990483, now seen corresponding path program 1 times [2018-06-22 10:47:51,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:51,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:51,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:51,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:51,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:51,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:51,964 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:51,964 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:51,965 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:47:51,965 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:47:51,965 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:47:51,965 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:51,965 INFO ]: Start difference. First operand 413 states and 508 transitions. Second operand 12 states. [2018-06-22 10:47:52,561 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:52,561 INFO ]: Finished difference Result 469 states and 567 transitions. [2018-06-22 10:47:52,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:47:52,562 INFO ]: Start accepts. Automaton has 12 states. Word has length 153 [2018-06-22 10:47:52,562 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:52,567 INFO ]: With dead ends: 469 [2018-06-22 10:47:52,567 INFO ]: Without dead ends: 443 [2018-06-22 10:47:52,567 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:52,568 INFO ]: Start minimizeSevpa. Operand 443 states. [2018-06-22 10:47:52,586 INFO ]: Finished minimizeSevpa. Reduced states from 443 to 419. [2018-06-22 10:47:52,586 INFO ]: Start removeUnreachable. Operand 419 states. [2018-06-22 10:47:52,595 INFO ]: Finished removeUnreachable. Reduced from 419 states to 419 states and 516 transitions. [2018-06-22 10:47:52,596 INFO ]: Start accepts. Automaton has 419 states and 516 transitions. Word has length 153 [2018-06-22 10:47:52,596 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:52,596 INFO ]: Abstraction has 419 states and 516 transitions. [2018-06-22 10:47:52,596 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:47:52,596 INFO ]: Start isEmpty. Operand 419 states and 516 transitions. [2018-06-22 10:47:52,601 INFO ]: Finished isEmpty. Found accepting run of length 154 [2018-06-22 10:47:52,601 INFO ]: Found error trace [2018-06-22 10:47:52,601 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] [2018-06-22 10:47:52,601 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:52,602 INFO ]: Analyzing trace with hash 1691904789, now seen corresponding path program 1 times [2018-06-22 10:47:52,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:52,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:52,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:52,602 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:52,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:52,622 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:52,831 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:52,831 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:52,831 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:47:52,832 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:47:52,832 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:47:52,832 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:52,832 INFO ]: Start difference. First operand 419 states and 516 transitions. Second operand 12 states. [2018-06-22 10:47:53,006 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:53,006 INFO ]: Finished difference Result 473 states and 573 transitions. [2018-06-22 10:47:53,007 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:47:53,007 INFO ]: Start accepts. Automaton has 12 states. Word has length 153 [2018-06-22 10:47:53,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:53,012 INFO ]: With dead ends: 473 [2018-06-22 10:47:53,012 INFO ]: Without dead ends: 447 [2018-06-22 10:47:53,012 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:53,013 INFO ]: Start minimizeSevpa. Operand 447 states. [2018-06-22 10:47:53,035 INFO ]: Finished minimizeSevpa. Reduced states from 447 to 425. [2018-06-22 10:47:53,035 INFO ]: Start removeUnreachable. Operand 425 states. [2018-06-22 10:47:53,038 INFO ]: Finished removeUnreachable. Reduced from 425 states to 425 states and 522 transitions. [2018-06-22 10:47:53,038 INFO ]: Start accepts. Automaton has 425 states and 522 transitions. Word has length 153 [2018-06-22 10:47:53,039 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:53,039 INFO ]: Abstraction has 425 states and 522 transitions. [2018-06-22 10:47:53,039 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:47:53,039 INFO ]: Start isEmpty. Operand 425 states and 522 transitions. [2018-06-22 10:47:53,042 INFO ]: Finished isEmpty. Found accepting run of length 154 [2018-06-22 10:47:53,042 INFO ]: Found error trace [2018-06-22 10:47:53,042 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] [2018-06-22 10:47:53,042 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:53,043 INFO ]: Analyzing trace with hash -1902458192, now seen corresponding path program 1 times [2018-06-22 10:47:53,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:53,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:53,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:53,043 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:53,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:53,061 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:53,306 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-06-22 10:47:53,992 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:53,992 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:53,992 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:47:53,993 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:47:53,993 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:47:53,993 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:53,993 INFO ]: Start difference. First operand 425 states and 522 transitions. Second operand 12 states. [2018-06-22 10:47:54,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:54,230 INFO ]: Finished difference Result 481 states and 579 transitions. [2018-06-22 10:47:54,230 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:47:54,230 INFO ]: Start accepts. Automaton has 12 states. Word has length 153 [2018-06-22 10:47:54,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:54,233 INFO ]: With dead ends: 481 [2018-06-22 10:47:54,233 INFO ]: Without dead ends: 457 [2018-06-22 10:47:54,234 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:54,234 INFO ]: Start minimizeSevpa. Operand 457 states. [2018-06-22 10:47:54,252 INFO ]: Finished minimizeSevpa. Reduced states from 457 to 437. [2018-06-22 10:47:54,252 INFO ]: Start removeUnreachable. Operand 437 states. [2018-06-22 10:47:54,255 INFO ]: Finished removeUnreachable. Reduced from 437 states to 437 states and 533 transitions. [2018-06-22 10:47:54,255 INFO ]: Start accepts. Automaton has 437 states and 533 transitions. Word has length 153 [2018-06-22 10:47:54,255 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:54,255 INFO ]: Abstraction has 437 states and 533 transitions. [2018-06-22 10:47:54,255 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:47:54,255 INFO ]: Start isEmpty. Operand 437 states and 533 transitions. [2018-06-22 10:47:54,258 INFO ]: Finished isEmpty. Found accepting run of length 154 [2018-06-22 10:47:54,258 INFO ]: Found error trace [2018-06-22 10:47:54,258 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] [2018-06-22 10:47:54,258 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:54,259 INFO ]: Analyzing trace with hash -1174716561, now seen corresponding path program 1 times [2018-06-22 10:47:54,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:54,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:54,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:54,260 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:54,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:54,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:54,565 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:54,565 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:54,565 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:47:54,565 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:47:54,565 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:47:54,565 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:54,565 INFO ]: Start difference. First operand 437 states and 533 transitions. Second operand 12 states. [2018-06-22 10:47:55,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:55,288 INFO ]: Finished difference Result 503 states and 609 transitions. [2018-06-22 10:47:55,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:47:55,288 INFO ]: Start accepts. Automaton has 12 states. Word has length 153 [2018-06-22 10:47:55,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:55,291 INFO ]: With dead ends: 503 [2018-06-22 10:47:55,291 INFO ]: Without dead ends: 477 [2018-06-22 10:47:55,291 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:55,292 INFO ]: Start minimizeSevpa. Operand 477 states. [2018-06-22 10:47:55,311 INFO ]: Finished minimizeSevpa. Reduced states from 477 to 455. [2018-06-22 10:47:55,311 INFO ]: Start removeUnreachable. Operand 455 states. [2018-06-22 10:47:55,315 INFO ]: Finished removeUnreachable. Reduced from 455 states to 455 states and 559 transitions. [2018-06-22 10:47:55,315 INFO ]: Start accepts. Automaton has 455 states and 559 transitions. Word has length 153 [2018-06-22 10:47:55,316 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:55,316 INFO ]: Abstraction has 455 states and 559 transitions. [2018-06-22 10:47:55,316 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:47:55,316 INFO ]: Start isEmpty. Operand 455 states and 559 transitions. [2018-06-22 10:47:55,319 INFO ]: Finished isEmpty. Found accepting run of length 154 [2018-06-22 10:47:55,319 INFO ]: Found error trace [2018-06-22 10:47:55,319 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] [2018-06-22 10:47:55,319 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:55,319 INFO ]: Analyzing trace with hash 1026878349, now seen corresponding path program 1 times [2018-06-22 10:47:55,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:55,319 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:55,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:55,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:55,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:55,343 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:55,862 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:55,862 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:55,863 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:47:55,863 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:47:55,863 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:47:55,863 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:55,863 INFO ]: Start difference. First operand 455 states and 559 transitions. Second operand 12 states. [2018-06-22 10:47:56,115 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:56,115 INFO ]: Finished difference Result 509 states and 614 transitions. [2018-06-22 10:47:56,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:47:56,116 INFO ]: Start accepts. Automaton has 12 states. Word has length 153 [2018-06-22 10:47:56,116 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:56,119 INFO ]: With dead ends: 509 [2018-06-22 10:47:56,119 INFO ]: Without dead ends: 483 [2018-06-22 10:47:56,119 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:47:56,119 INFO ]: Start minimizeSevpa. Operand 483 states. [2018-06-22 10:47:56,137 INFO ]: Finished minimizeSevpa. Reduced states from 483 to 459. [2018-06-22 10:47:56,137 INFO ]: Start removeUnreachable. Operand 459 states. [2018-06-22 10:47:56,239 INFO ]: Finished removeUnreachable. Reduced from 459 states to 459 states and 563 transitions. [2018-06-22 10:47:56,239 INFO ]: Start accepts. Automaton has 459 states and 563 transitions. Word has length 153 [2018-06-22 10:47:56,240 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:56,240 INFO ]: Abstraction has 459 states and 563 transitions. [2018-06-22 10:47:56,240 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:47:56,240 INFO ]: Start isEmpty. Operand 459 states and 563 transitions. [2018-06-22 10:47:56,243 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:47:56,243 INFO ]: Found error trace [2018-06-22 10:47:56,243 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] [2018-06-22 10:47:56,243 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:56,243 INFO ]: Analyzing trace with hash 1650193867, now seen corresponding path program 1 times [2018-06-22 10:47:56,243 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:56,243 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:56,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:56,244 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:56,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:56,260 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:56,665 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:56,665 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:56,665 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:47:56,666 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:47:56,666 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:47:56,666 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:47:56,666 INFO ]: Start difference. First operand 459 states and 563 transitions. Second operand 13 states. [2018-06-22 10:47:56,834 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:56,834 INFO ]: Finished difference Result 517 states and 630 transitions. [2018-06-22 10:47:56,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:47:56,839 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:47:56,839 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:56,842 INFO ]: With dead ends: 517 [2018-06-22 10:47:56,842 INFO ]: Without dead ends: 491 [2018-06-22 10:47:56,842 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:47:56,843 INFO ]: Start minimizeSevpa. Operand 491 states. [2018-06-22 10:47:56,861 INFO ]: Finished minimizeSevpa. Reduced states from 491 to 473. [2018-06-22 10:47:56,861 INFO ]: Start removeUnreachable. Operand 473 states. [2018-06-22 10:47:56,863 INFO ]: Finished removeUnreachable. Reduced from 473 states to 473 states and 585 transitions. [2018-06-22 10:47:56,863 INFO ]: Start accepts. Automaton has 473 states and 585 transitions. Word has length 157 [2018-06-22 10:47:56,863 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:56,863 INFO ]: Abstraction has 473 states and 585 transitions. [2018-06-22 10:47:56,863 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:47:56,864 INFO ]: Start isEmpty. Operand 473 states and 585 transitions. [2018-06-22 10:47:56,867 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:47:56,867 INFO ]: Found error trace [2018-06-22 10:47:56,867 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] [2018-06-22 10:47:56,867 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:56,867 INFO ]: Analyzing trace with hash -69243653, now seen corresponding path program 1 times [2018-06-22 10:47:56,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:56,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:56,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:56,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:56,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:56,886 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:57,156 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:57,156 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:57,156 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:47:57,156 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:47:57,156 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:47:57,156 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:47:57,156 INFO ]: Start difference. First operand 473 states and 585 transitions. Second operand 13 states. [2018-06-22 10:47:57,328 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:57,328 INFO ]: Finished difference Result 541 states and 666 transitions. [2018-06-22 10:47:57,329 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:47:57,329 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:47:57,329 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:57,331 INFO ]: With dead ends: 541 [2018-06-22 10:47:57,331 INFO ]: Without dead ends: 517 [2018-06-22 10:47:57,331 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 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:47:57,332 INFO ]: Start minimizeSevpa. Operand 517 states. [2018-06-22 10:47:57,355 INFO ]: Finished minimizeSevpa. Reduced states from 517 to 497. [2018-06-22 10:47:57,355 INFO ]: Start removeUnreachable. Operand 497 states. [2018-06-22 10:47:57,357 INFO ]: Finished removeUnreachable. Reduced from 497 states to 497 states and 621 transitions. [2018-06-22 10:47:57,357 INFO ]: Start accepts. Automaton has 497 states and 621 transitions. Word has length 157 [2018-06-22 10:47:57,358 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:57,358 INFO ]: Abstraction has 497 states and 621 transitions. [2018-06-22 10:47:57,358 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:47:57,358 INFO ]: Start isEmpty. Operand 497 states and 621 transitions. [2018-06-22 10:47:57,361 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:47:57,361 INFO ]: Found error trace [2018-06-22 10:47:57,361 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] [2018-06-22 10:47:57,362 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:57,362 INFO ]: Analyzing trace with hash -1325950186, now seen corresponding path program 1 times [2018-06-22 10:47:57,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:57,362 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:57,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:57,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:57,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:57,380 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:57,676 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:57,676 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:57,676 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:47:57,676 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:47:57,676 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:47:57,676 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:47:57,676 INFO ]: Start difference. First operand 497 states and 621 transitions. Second operand 13 states. [2018-06-22 10:47:57,852 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:57,852 INFO ]: Finished difference Result 559 states and 683 transitions. [2018-06-22 10:47:57,853 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:47:57,853 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:47:57,853 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:57,856 INFO ]: With dead ends: 559 [2018-06-22 10:47:57,856 INFO ]: Without dead ends: 535 [2018-06-22 10:47:57,856 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 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:47:57,857 INFO ]: Start minimizeSevpa. Operand 535 states. [2018-06-22 10:47:57,878 INFO ]: Finished minimizeSevpa. Reduced states from 535 to 509. [2018-06-22 10:47:57,878 INFO ]: Start removeUnreachable. Operand 509 states. [2018-06-22 10:47:57,881 INFO ]: Finished removeUnreachable. Reduced from 509 states to 509 states and 632 transitions. [2018-06-22 10:47:57,881 INFO ]: Start accepts. Automaton has 509 states and 632 transitions. Word has length 157 [2018-06-22 10:47:57,881 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:57,881 INFO ]: Abstraction has 509 states and 632 transitions. [2018-06-22 10:47:57,881 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:47:57,882 INFO ]: Start isEmpty. Operand 509 states and 632 transitions. [2018-06-22 10:47:57,884 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:47:57,884 INFO ]: Found error trace [2018-06-22 10:47:57,884 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] [2018-06-22 10:47:57,884 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:57,884 INFO ]: Analyzing trace with hash -1295232082, now seen corresponding path program 1 times [2018-06-22 10:47:57,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:57,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:57,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:57,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:57,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:57,901 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:58,168 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-06-22 10:47:58,982 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:58,983 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:58,983 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:47:58,983 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:47:58,983 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:47:58,983 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:47:58,983 INFO ]: Start difference. First operand 509 states and 632 transitions. Second operand 13 states. [2018-06-22 10:47:59,157 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:59,157 INFO ]: Finished difference Result 571 states and 697 transitions. [2018-06-22 10:47:59,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:47:59,160 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:47:59,160 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:59,163 INFO ]: With dead ends: 571 [2018-06-22 10:47:59,163 INFO ]: Without dead ends: 545 [2018-06-22 10:47:59,163 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:47:59,164 INFO ]: Start minimizeSevpa. Operand 545 states. [2018-06-22 10:47:59,180 INFO ]: Finished minimizeSevpa. Reduced states from 545 to 523. [2018-06-22 10:47:59,180 INFO ]: Start removeUnreachable. Operand 523 states. [2018-06-22 10:47:59,182 INFO ]: Finished removeUnreachable. Reduced from 523 states to 523 states and 648 transitions. [2018-06-22 10:47:59,183 INFO ]: Start accepts. Automaton has 523 states and 648 transitions. Word has length 157 [2018-06-22 10:47:59,183 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:59,183 INFO ]: Abstraction has 523 states and 648 transitions. [2018-06-22 10:47:59,183 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:47:59,183 INFO ]: Start isEmpty. Operand 523 states and 648 transitions. [2018-06-22 10:47:59,186 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:47:59,186 INFO ]: Found error trace [2018-06-22 10:47:59,186 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] [2018-06-22 10:47:59,186 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:59,186 INFO ]: Analyzing trace with hash -1958080674, now seen corresponding path program 1 times [2018-06-22 10:47:59,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:59,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:59,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:59,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:59,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:59,203 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:59,378 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:47:59,378 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:59,379 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:47:59,379 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:47:59,379 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:47:59,379 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:47:59,379 INFO ]: Start difference. First operand 523 states and 648 transitions. Second operand 13 states. [2018-06-22 10:47:59,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:59,881 INFO ]: Finished difference Result 601 states and 737 transitions. [2018-06-22 10:47:59,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:47:59,881 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:47:59,882 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:59,884 INFO ]: With dead ends: 601 [2018-06-22 10:47:59,884 INFO ]: Without dead ends: 568 [2018-06-22 10:47:59,884 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:47:59,884 INFO ]: Start minimizeSevpa. Operand 568 states. [2018-06-22 10:47:59,902 INFO ]: Finished minimizeSevpa. Reduced states from 568 to 536. [2018-06-22 10:47:59,903 INFO ]: Start removeUnreachable. Operand 536 states. [2018-06-22 10:47:59,905 INFO ]: Finished removeUnreachable. Reduced from 536 states to 536 states and 664 transitions. [2018-06-22 10:47:59,905 INFO ]: Start accepts. Automaton has 536 states and 664 transitions. Word has length 157 [2018-06-22 10:47:59,905 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:59,905 INFO ]: Abstraction has 536 states and 664 transitions. [2018-06-22 10:47:59,905 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:47:59,905 INFO ]: Start isEmpty. Operand 536 states and 664 transitions. [2018-06-22 10:47:59,908 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:47:59,908 INFO ]: Found error trace [2018-06-22 10:47:59,908 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] [2018-06-22 10:47:59,908 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:59,908 INFO ]: Analyzing trace with hash 1110898193, now seen corresponding path program 1 times [2018-06-22 10:47:59,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:59,908 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:59,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:59,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:59,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:59,924 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:00,103 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:48:00,104 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:00,104 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:00,104 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:00,104 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:00,104 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:00,104 INFO ]: Start difference. First operand 536 states and 664 transitions. Second operand 13 states. [2018-06-22 10:48:00,385 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:00,385 INFO ]: Finished difference Result 594 states and 723 transitions. [2018-06-22 10:48:00,385 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:00,385 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:48:00,385 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:00,387 INFO ]: With dead ends: 594 [2018-06-22 10:48:00,387 INFO ]: Without dead ends: 563 [2018-06-22 10:48:00,387 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:00,387 INFO ]: Start minimizeSevpa. Operand 563 states. [2018-06-22 10:48:00,404 INFO ]: Finished minimizeSevpa. Reduced states from 563 to 541. [2018-06-22 10:48:00,404 INFO ]: Start removeUnreachable. Operand 541 states. [2018-06-22 10:48:00,406 INFO ]: Finished removeUnreachable. Reduced from 541 states to 541 states and 666 transitions. [2018-06-22 10:48:00,406 INFO ]: Start accepts. Automaton has 541 states and 666 transitions. Word has length 157 [2018-06-22 10:48:00,407 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:00,407 INFO ]: Abstraction has 541 states and 666 transitions. [2018-06-22 10:48:00,407 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:00,407 INFO ]: Start isEmpty. Operand 541 states and 666 transitions. [2018-06-22 10:48:00,409 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:48:00,409 INFO ]: Found error trace [2018-06-22 10:48:00,409 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] [2018-06-22 10:48:00,409 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:00,410 INFO ]: Analyzing trace with hash 1080180089, now seen corresponding path program 1 times [2018-06-22 10:48:00,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:00,410 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:00,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:00,410 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:00,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:00,426 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:00,723 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:48:00,723 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:00,723 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:00,724 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:00,724 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:00,724 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:00,724 INFO ]: Start difference. First operand 541 states and 666 transitions. Second operand 13 states. [2018-06-22 10:48:00,905 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:00,905 INFO ]: Finished difference Result 603 states and 730 transitions. [2018-06-22 10:48:00,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:00,905 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:48:00,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:00,907 INFO ]: With dead ends: 603 [2018-06-22 10:48:00,907 INFO ]: Without dead ends: 570 [2018-06-22 10:48:00,908 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 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:48:00,908 INFO ]: Start minimizeSevpa. Operand 570 states. [2018-06-22 10:48:00,925 INFO ]: Finished minimizeSevpa. Reduced states from 570 to 546. [2018-06-22 10:48:00,925 INFO ]: Start removeUnreachable. Operand 546 states. [2018-06-22 10:48:00,927 INFO ]: Finished removeUnreachable. Reduced from 546 states to 546 states and 669 transitions. [2018-06-22 10:48:00,927 INFO ]: Start accepts. Automaton has 546 states and 669 transitions. Word has length 157 [2018-06-22 10:48:00,928 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:00,928 INFO ]: Abstraction has 546 states and 669 transitions. [2018-06-22 10:48:00,928 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:00,928 INFO ]: Start isEmpty. Operand 546 states and 669 transitions. [2018-06-22 10:48:00,930 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:48:00,930 INFO ]: Found error trace [2018-06-22 10:48:00,930 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] [2018-06-22 10:48:00,930 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:00,930 INFO ]: Analyzing trace with hash -238643154, now seen corresponding path program 1 times [2018-06-22 10:48:00,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:00,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:00,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:00,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:00,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:00,946 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:01,118 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:48:01,118 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:01,118 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:01,118 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:01,118 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:01,118 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:01,118 INFO ]: Start difference. First operand 546 states and 669 transitions. Second operand 13 states. [2018-06-22 10:48:01,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:01,689 INFO ]: Finished difference Result 604 states and 728 transitions. [2018-06-22 10:48:01,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:01,689 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:48:01,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:01,691 INFO ]: With dead ends: 604 [2018-06-22 10:48:01,691 INFO ]: Without dead ends: 573 [2018-06-22 10:48:01,691 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:01,692 INFO ]: Start minimizeSevpa. Operand 573 states. [2018-06-22 10:48:01,712 INFO ]: Finished minimizeSevpa. Reduced states from 573 to 549. [2018-06-22 10:48:01,712 INFO ]: Start removeUnreachable. Operand 549 states. [2018-06-22 10:48:01,714 INFO ]: Finished removeUnreachable. Reduced from 549 states to 549 states and 669 transitions. [2018-06-22 10:48:01,714 INFO ]: Start accepts. Automaton has 549 states and 669 transitions. Word has length 157 [2018-06-22 10:48:01,715 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:01,715 INFO ]: Abstraction has 549 states and 669 transitions. [2018-06-22 10:48:01,715 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:01,715 INFO ]: Start isEmpty. Operand 549 states and 669 transitions. [2018-06-22 10:48:01,718 INFO ]: Finished isEmpty. Found accepting run of length 162 [2018-06-22 10:48:01,718 INFO ]: Found error trace [2018-06-22 10:48:01,718 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] [2018-06-22 10:48:01,718 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:01,718 INFO ]: Analyzing trace with hash -1372826633, now seen corresponding path program 1 times [2018-06-22 10:48:01,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:01,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:01,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:01,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:01,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:01,735 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:02,163 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:48:02,163 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:02,164 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:48:02,164 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:48:02,164 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:48:02,165 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:02,165 INFO ]: Start difference. First operand 549 states and 669 transitions. Second operand 14 states. [2018-06-22 10:48:02,423 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:02,423 INFO ]: Finished difference Result 615 states and 738 transitions. [2018-06-22 10:48:02,423 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:48:02,423 INFO ]: Start accepts. Automaton has 14 states. Word has length 161 [2018-06-22 10:48:02,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:02,426 INFO ]: With dead ends: 615 [2018-06-22 10:48:02,426 INFO ]: Without dead ends: 585 [2018-06-22 10:48:02,426 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:02,426 INFO ]: Start minimizeSevpa. Operand 585 states. [2018-06-22 10:48:02,443 INFO ]: Finished minimizeSevpa. Reduced states from 585 to 561. [2018-06-22 10:48:02,443 INFO ]: Start removeUnreachable. Operand 561 states. [2018-06-22 10:48:02,446 INFO ]: Finished removeUnreachable. Reduced from 561 states to 561 states and 683 transitions. [2018-06-22 10:48:02,446 INFO ]: Start accepts. Automaton has 561 states and 683 transitions. Word has length 161 [2018-06-22 10:48:02,446 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:02,446 INFO ]: Abstraction has 561 states and 683 transitions. [2018-06-22 10:48:02,446 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:48:02,446 INFO ]: Start isEmpty. Operand 561 states and 683 transitions. [2018-06-22 10:48:02,449 INFO ]: Finished isEmpty. Found accepting run of length 162 [2018-06-22 10:48:02,449 INFO ]: Found error trace [2018-06-22 10:48:02,449 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] [2018-06-22 10:48:02,449 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:02,449 INFO ]: Analyzing trace with hash 1323351636, now seen corresponding path program 1 times [2018-06-22 10:48:02,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:02,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:02,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:02,450 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:02,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:02,464 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:02,646 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:48:02,646 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:02,646 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:48:02,646 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:48:02,647 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:48:02,647 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:02,647 INFO ]: Start difference. First operand 561 states and 683 transitions. Second operand 14 states. [2018-06-22 10:48:02,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:02,837 INFO ]: Finished difference Result 581 states and 704 transitions. [2018-06-22 10:48:02,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:48:02,838 INFO ]: Start accepts. Automaton has 14 states. Word has length 161 [2018-06-22 10:48:02,838 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:02,839 INFO ]: With dead ends: 581 [2018-06-22 10:48:02,839 INFO ]: Without dead ends: 0 [2018-06-22 10:48:02,839 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:02,839 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 10:48:02,839 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 10:48:02,839 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 10:48:02,839 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 10:48:02,839 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2018-06-22 10:48:02,839 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:02,839 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 10:48:02,839 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:48:02,839 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 10:48:02,839 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 10:48:02,843 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:48:02 BoogieIcfgContainer [2018-06-22 10:48:02,843 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:48:02,843 INFO ]: Toolchain (without parser) took 20536.98 ms. Allocated memory was 308.8 MB in the beginning and 524.8 MB in the end (delta: 216.0 MB). Free memory was 239.2 MB in the beginning and 297.0 MB in the end (delta: -57.8 MB). Peak memory consumption was 158.2 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:02,844 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:48:02,844 INFO ]: ChcToBoogie took 108.01 ms. Allocated memory is still 308.8 MB. Free memory was 239.2 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:02,844 INFO ]: Boogie Preprocessor took 94.37 ms. Allocated memory is still 308.8 MB. Free memory was 237.3 MB in the beginning and 235.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:02,845 INFO ]: RCFGBuilder took 719.02 ms. Allocated memory is still 308.8 MB. Free memory was 235.3 MB in the beginning and 199.3 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:02,845 INFO ]: TraceAbstraction took 19605.45 ms. Allocated memory was 308.8 MB in the beginning and 524.8 MB in the end (delta: 216.0 MB). Free memory was 197.3 MB in the beginning and 297.0 MB in the end (delta: -99.7 MB). Peak memory consumption was 116.3 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:02,855 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 108.01 ms. Allocated memory is still 308.8 MB. Free memory was 239.2 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 94.37 ms. Allocated memory is still 308.8 MB. Free memory was 237.3 MB in the beginning and 235.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 719.02 ms. Allocated memory is still 308.8 MB. Free memory was 235.3 MB in the beginning and 199.3 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 19605.45 ms. Allocated memory was 308.8 MB in the beginning and 524.8 MB in the end (delta: 216.0 MB). Free memory was 197.3 MB in the beginning and 297.0 MB in the end (delta: -99.7 MB). Peak memory consumption was 116.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 40 procedures, 169 locations, 1 error locations. SAFE Result, 19.5s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4662 SDtfs, 324 SDslu, 51468 SDs, 0 SdLazy, 6765 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=561occurred in iteration=21, 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, 22 MinimizatonAttempts, 408 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 3150 NumberOfCodeBlocks, 3150 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3128 ConstructedInterpolants, 0 QuantifiedInterpolants, 677880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 570/570 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/06.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-48-02-867.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/06.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-48-02-867.csv Received shutdown request...