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/45.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:56:41,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:56:41,870 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:56:41,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:56:41,882 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:56:41,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:56:41,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:56:41,886 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:56:41,888 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:56:41,890 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:56:41,890 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:56:41,891 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:56:41,892 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:56:41,893 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:56:41,895 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:56:41,896 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:56:41,897 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:56:41,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:56:41,900 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:56:41,911 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:56:41,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:56:41,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:56:41,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:56:41,914 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:56:41,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:56:41,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:56:41,917 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:56:41,917 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:56:41,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:56:41,924 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:56:41,925 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:56:41,926 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:56:41,926 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:56:41,927 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:56:41,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:56:41,927 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:56:41,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:56:41,944 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:56:41,945 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:56:41,945 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:56:41,946 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:56:41,946 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:56:41,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:56:41,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:56:41,947 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:56:41,947 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:56:41,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:56:41,947 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:56:41,947 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:56:41,947 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:56:41,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:56:41,948 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:56:41,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:56:41,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:56:41,948 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:56:41,950 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:56:41,950 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:56:42,000 INFO ]: Repository-Root is: /tmp [2018-06-22 10:56:42,017 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:56:42,020 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:56:42,021 INFO ]: Initializing SmtParser... [2018-06-22 10:56:42,022 INFO ]: SmtParser initialized [2018-06-22 10:56:42,023 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/45.c.smt2 [2018-06-22 10:56:42,024 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:56:42,112 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/45.c.smt2 unknown [2018-06-22 10:56:42,994 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/45.c.smt2 [2018-06-22 10:56:42,999 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:56:43,004 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:56:43,005 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:56:43,005 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:56:43,005 INFO ]: ChcToBoogie initialized [2018-06-22 10:56:43,009 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:56:42" (1/1) ... [2018-06-22 10:56:43,085 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:43 Unit [2018-06-22 10:56:43,086 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:56:43,086 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:56:43,086 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:56:43,086 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:56:43,108 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:43" (1/1) ... [2018-06-22 10:56:43,108 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:43" (1/1) ... [2018-06-22 10:56:43,133 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:43" (1/1) ... [2018-06-22 10:56:43,133 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:43" (1/1) ... [2018-06-22 10:56:43,147 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:43" (1/1) ... [2018-06-22 10:56:43,152 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:43" (1/1) ... [2018-06-22 10:56:43,158 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:43" (1/1) ... [2018-06-22 10:56:43,172 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:56:43,172 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:56:43,172 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:56:43,172 INFO ]: RCFGBuilder initialized [2018-06-22 10:56:43,173 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:43" (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:56:43,202 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:56:43,202 INFO ]: Found specification of procedure False [2018-06-22 10:56:43,202 INFO ]: Found implementation of procedure False [2018-06-22 10:56:43,202 INFO ]: Specification and implementation of procedure h60 given in one single declaration [2018-06-22 10:56:43,202 INFO ]: Found specification of procedure h60 [2018-06-22 10:56:43,202 INFO ]: Found implementation of procedure h60 [2018-06-22 10:56:43,202 INFO ]: Specification and implementation of procedure h59 given in one single declaration [2018-06-22 10:56:43,202 INFO ]: Found specification of procedure h59 [2018-06-22 10:56:43,202 INFO ]: Found implementation of procedure h59 [2018-06-22 10:56:43,202 INFO ]: Specification and implementation of procedure h37 given in one single declaration [2018-06-22 10:56:43,202 INFO ]: Found specification of procedure h37 [2018-06-22 10:56:43,202 INFO ]: Found implementation of procedure h37 [2018-06-22 10:56:43,202 INFO ]: Specification and implementation of procedure h36 given in one single declaration [2018-06-22 10:56:43,202 INFO ]: Found specification of procedure h36 [2018-06-22 10:56:43,202 INFO ]: Found implementation of procedure h36 [2018-06-22 10:56:43,202 INFO ]: Specification and implementation of procedure h35 given in one single declaration [2018-06-22 10:56:43,202 INFO ]: Found specification of procedure h35 [2018-06-22 10:56:43,202 INFO ]: Found implementation of procedure h35 [2018-06-22 10:56:43,202 INFO ]: Specification and implementation of procedure h31 given in one single declaration [2018-06-22 10:56:43,202 INFO ]: Found specification of procedure h31 [2018-06-22 10:56:43,202 INFO ]: Found implementation of procedure h31 [2018-06-22 10:56:43,202 INFO ]: Specification and implementation of procedure h30 given in one single declaration [2018-06-22 10:56:43,202 INFO ]: Found specification of procedure h30 [2018-06-22 10:56:43,202 INFO ]: Found implementation of procedure h30 [2018-06-22 10:56:43,202 INFO ]: Specification and implementation of procedure h29 given in one single declaration [2018-06-22 10:56:43,202 INFO ]: Found specification of procedure h29 [2018-06-22 10:56:43,202 INFO ]: Found implementation of procedure h29 [2018-06-22 10:56:43,202 INFO ]: Specification and implementation of procedure h28 given in one single declaration [2018-06-22 10:56:43,202 INFO ]: Found specification of procedure h28 [2018-06-22 10:56:43,202 INFO ]: Found implementation of procedure h28 [2018-06-22 10:56:43,202 INFO ]: Specification and implementation of procedure h58 given in one single declaration [2018-06-22 10:56:43,202 INFO ]: Found specification of procedure h58 [2018-06-22 10:56:43,202 INFO ]: Found implementation of procedure h58 [2018-06-22 10:56:43,203 INFO ]: Specification and implementation of procedure h48 given in one single declaration [2018-06-22 10:56:43,203 INFO ]: Found specification of procedure h48 [2018-06-22 10:56:43,203 INFO ]: Found implementation of procedure h48 [2018-06-22 10:56:43,203 INFO ]: Specification and implementation of procedure h47 given in one single declaration [2018-06-22 10:56:43,203 INFO ]: Found specification of procedure h47 [2018-06-22 10:56:43,203 INFO ]: Found implementation of procedure h47 [2018-06-22 10:56:43,203 INFO ]: Specification and implementation of procedure h46 given in one single declaration [2018-06-22 10:56:43,203 INFO ]: Found specification of procedure h46 [2018-06-22 10:56:43,203 INFO ]: Found implementation of procedure h46 [2018-06-22 10:56:43,203 INFO ]: Specification and implementation of procedure h42 given in one single declaration [2018-06-22 10:56:43,203 INFO ]: Found specification of procedure h42 [2018-06-22 10:56:43,203 INFO ]: Found implementation of procedure h42 [2018-06-22 10:56:43,203 INFO ]: Specification and implementation of procedure h41 given in one single declaration [2018-06-22 10:56:43,203 INFO ]: Found specification of procedure h41 [2018-06-22 10:56:43,203 INFO ]: Found implementation of procedure h41 [2018-06-22 10:56:43,203 INFO ]: Specification and implementation of procedure h40 given in one single declaration [2018-06-22 10:56:43,203 INFO ]: Found specification of procedure h40 [2018-06-22 10:56:43,203 INFO ]: Found implementation of procedure h40 [2018-06-22 10:56:43,203 INFO ]: Specification and implementation of procedure h39 given in one single declaration [2018-06-22 10:56:43,203 INFO ]: Found specification of procedure h39 [2018-06-22 10:56:43,203 INFO ]: Found implementation of procedure h39 [2018-06-22 10:56:43,203 INFO ]: Specification and implementation of procedure h55 given in one single declaration [2018-06-22 10:56:43,203 INFO ]: Found specification of procedure h55 [2018-06-22 10:56:43,203 INFO ]: Found implementation of procedure h55 [2018-06-22 10:56:43,203 INFO ]: Specification and implementation of procedure h54 given in one single declaration [2018-06-22 10:56:43,203 INFO ]: Found specification of procedure h54 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h54 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h52 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h52 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h52 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h50 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h50 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h50 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h49 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h49 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h49 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h44 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h44 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h44 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h45 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h45 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h45 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h43 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h43 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h43 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h51 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h51 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h51 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h53 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h53 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h53 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h57 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h57 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h57 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h38 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h38 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h38 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h33 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h33 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h33 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h34 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h34 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h34 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h32 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h32 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h32 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h56 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h56 [2018-06-22 10:56:43,204 INFO ]: Found implementation of procedure h56 [2018-06-22 10:56:43,204 INFO ]: Specification and implementation of procedure h27 given in one single declaration [2018-06-22 10:56:43,204 INFO ]: Found specification of procedure h27 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h27 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h26 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h26 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h26 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h25 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h25 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h25 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h22 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h22 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h21 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h21 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h20 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h20 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h14 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h14 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h13 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h13 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h12 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h12 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h8 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h8 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h7 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h7 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h6 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h6 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h5 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h5 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h17 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h17 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h18 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h18 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h15 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h15 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h10 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h10 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h9 [2018-06-22 10:56:43,205 INFO ]: Found implementation of procedure h9 [2018-06-22 10:56:43,205 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:56:43,205 INFO ]: Found specification of procedure h11 [2018-06-22 10:56:43,206 INFO ]: Found implementation of procedure h11 [2018-06-22 10:56:43,206 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:56:43,206 INFO ]: Found specification of procedure h16 [2018-06-22 10:56:43,206 INFO ]: Found implementation of procedure h16 [2018-06-22 10:56:43,206 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:56:43,206 INFO ]: Found specification of procedure h4 [2018-06-22 10:56:43,206 INFO ]: Found implementation of procedure h4 [2018-06-22 10:56:43,206 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:56:43,206 INFO ]: Found specification of procedure h3 [2018-06-22 10:56:43,206 INFO ]: Found implementation of procedure h3 [2018-06-22 10:56:43,206 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:56:43,206 INFO ]: Found specification of procedure h2 [2018-06-22 10:56:43,206 INFO ]: Found implementation of procedure h2 [2018-06-22 10:56:43,206 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:56:43,206 INFO ]: Found specification of procedure h1 [2018-06-22 10:56:43,206 INFO ]: Found implementation of procedure h1 [2018-06-22 10:56:43,206 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:56:43,206 INFO ]: Found specification of procedure h19 [2018-06-22 10:56:43,206 INFO ]: Found implementation of procedure h19 [2018-06-22 10:56:43,206 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:56:43,206 INFO ]: Found specification of procedure h24 [2018-06-22 10:56:43,206 INFO ]: Found implementation of procedure h24 [2018-06-22 10:56:43,206 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:56:43,206 INFO ]: Found specification of procedure h23 [2018-06-22 10:56:43,206 INFO ]: Found implementation of procedure h23 [2018-06-22 10:56:43,206 INFO ]: Specification and implementation of procedure h61 given in one single declaration [2018-06-22 10:56:43,206 INFO ]: Found specification of procedure h61 [2018-06-22 10:56:43,206 INFO ]: Found implementation of procedure h61 [2018-06-22 10:56:43,206 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:56:43,206 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:56:43,206 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:56:44,043 INFO ]: Using library mode [2018-06-22 10:56:44,043 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:56:44 BoogieIcfgContainer [2018-06-22 10:56:44,043 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:56:44,045 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:56:44,045 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:56:44,051 INFO ]: TraceAbstraction initialized [2018-06-22 10:56:44,052 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:56:42" (1/3) ... [2018-06-22 10:56:44,052 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec91ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:56:44, skipping insertion in model container [2018-06-22 10:56:44,052 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:43" (2/3) ... [2018-06-22 10:56:44,053 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec91ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:56:44, skipping insertion in model container [2018-06-22 10:56:44,053 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:56:44" (3/3) ... [2018-06-22 10:56:44,055 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:56:44,064 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:56:44,075 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:56:44,115 INFO ]: Using default assertion order modulation [2018-06-22 10:56:44,115 INFO ]: Interprodecural is true [2018-06-22 10:56:44,115 INFO ]: Hoare is false [2018-06-22 10:56:44,115 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:56:44,115 INFO ]: Backedges is TWOTRACK [2018-06-22 10:56:44,115 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:56:44,115 INFO ]: Difference is false [2018-06-22 10:56:44,115 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:56:44,115 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:56:44,139 INFO ]: Start isEmpty. Operand 266 states. [2018-06-22 10:56:44,179 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:56:44,179 INFO ]: Found error trace [2018-06-22 10:56:44,180 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:56:44,181 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:44,186 INFO ]: Analyzing trace with hash -115481360, now seen corresponding path program 1 times [2018-06-22 10:56:44,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:44,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:44,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:44,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:44,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:44,409 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:44,785 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:56:45,160 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:56:45,173 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:45,173 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 10:56:45,176 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:56:45,192 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:56:45,194 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:56:45,196 INFO ]: Start difference. First operand 266 states. Second operand 15 states. [2018-06-22 10:56:46,500 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:46,500 INFO ]: Finished difference Result 286 states and 315 transitions. [2018-06-22 10:56:46,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:56:46,502 INFO ]: Start accepts. Automaton has 15 states. Word has length 109 [2018-06-22 10:56:46,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:46,519 INFO ]: With dead ends: 286 [2018-06-22 10:56:46,519 INFO ]: Without dead ends: 286 [2018-06-22 10:56:46,521 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:56:46,539 INFO ]: Start minimizeSevpa. Operand 286 states. [2018-06-22 10:56:46,598 INFO ]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-06-22 10:56:46,600 INFO ]: Start removeUnreachable. Operand 286 states. [2018-06-22 10:56:46,606 INFO ]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2018-06-22 10:56:46,612 INFO ]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 109 [2018-06-22 10:56:46,612 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:46,613 INFO ]: Abstraction has 286 states and 315 transitions. [2018-06-22 10:56:46,613 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:56:46,613 INFO ]: Start isEmpty. Operand 286 states and 315 transitions. [2018-06-22 10:56:46,620 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:56:46,620 INFO ]: Found error trace [2018-06-22 10:56:46,620 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:56:46,620 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:46,620 INFO ]: Analyzing trace with hash 1981872685, now seen corresponding path program 1 times [2018-06-22 10:56:46,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:46,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:46,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:46,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:46,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:46,652 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:46,894 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-06-22 10:56:47,245 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:56:47,245 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:47,246 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 10:56:47,248 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:56:47,248 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:56:47,248 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:56:47,248 INFO ]: Start difference. First operand 286 states and 315 transitions. Second operand 15 states. [2018-06-22 10:56:47,896 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:47,896 INFO ]: Finished difference Result 286 states and 314 transitions. [2018-06-22 10:56:47,897 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:56:47,897 INFO ]: Start accepts. Automaton has 15 states. Word has length 109 [2018-06-22 10:56:47,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:47,902 INFO ]: With dead ends: 286 [2018-06-22 10:56:47,902 INFO ]: Without dead ends: 278 [2018-06-22 10:56:47,903 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:56:47,904 INFO ]: Start minimizeSevpa. Operand 278 states. [2018-06-22 10:56:47,933 INFO ]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-06-22 10:56:47,933 INFO ]: Start removeUnreachable. Operand 278 states. [2018-06-22 10:56:47,937 INFO ]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2018-06-22 10:56:47,938 INFO ]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 109 [2018-06-22 10:56:47,938 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:47,939 INFO ]: Abstraction has 278 states and 306 transitions. [2018-06-22 10:56:47,939 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:56:47,939 INFO ]: Start isEmpty. Operand 278 states and 306 transitions. [2018-06-22 10:56:47,947 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:56:47,947 INFO ]: Found error trace [2018-06-22 10:56:47,947 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:56:47,947 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:47,947 INFO ]: Analyzing trace with hash 1463228621, now seen corresponding path program 1 times [2018-06-22 10:56:47,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:47,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:47,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:47,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:47,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:48,001 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:48,305 WARN ]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-06-22 10:56:48,779 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:56:48,779 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:48,779 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:48,780 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:48,780 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:48,780 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:48,780 INFO ]: Start difference. First operand 278 states and 306 transitions. Second operand 14 states. [2018-06-22 10:56:49,163 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:49,163 INFO ]: Finished difference Result 294 states and 324 transitions. [2018-06-22 10:56:49,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:49,163 INFO ]: Start accepts. Automaton has 14 states. Word has length 109 [2018-06-22 10:56:49,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:49,167 INFO ]: With dead ends: 294 [2018-06-22 10:56:49,167 INFO ]: Without dead ends: 294 [2018-06-22 10:56:49,167 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:49,167 INFO ]: Start minimizeSevpa. Operand 294 states. [2018-06-22 10:56:49,186 INFO ]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-06-22 10:56:49,187 INFO ]: Start removeUnreachable. Operand 294 states. [2018-06-22 10:56:49,189 INFO ]: Finished removeUnreachable. Reduced from 294 states to 294 states and 324 transitions. [2018-06-22 10:56:49,190 INFO ]: Start accepts. Automaton has 294 states and 324 transitions. Word has length 109 [2018-06-22 10:56:49,190 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:49,190 INFO ]: Abstraction has 294 states and 324 transitions. [2018-06-22 10:56:49,190 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:49,190 INFO ]: Start isEmpty. Operand 294 states and 324 transitions. [2018-06-22 10:56:49,193 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 10:56:49,193 INFO ]: Found error trace [2018-06-22 10:56:49,193 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, 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:56:49,193 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:49,193 INFO ]: Analyzing trace with hash 511279927, now seen corresponding path program 1 times [2018-06-22 10:56:49,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:49,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:49,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:49,194 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:49,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:49,230 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:49,431 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:56:49,431 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:49,431 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:56:49,432 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:56:49,432 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:56:49,432 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:56:49,432 INFO ]: Start difference. First operand 294 states and 324 transitions. Second operand 11 states. [2018-06-22 10:56:49,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:49,663 INFO ]: Finished difference Result 334 states and 378 transitions. [2018-06-22 10:56:49,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:56:49,663 INFO ]: Start accepts. Automaton has 11 states. Word has length 141 [2018-06-22 10:56:49,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:49,666 INFO ]: With dead ends: 334 [2018-06-22 10:56:49,666 INFO ]: Without dead ends: 334 [2018-06-22 10:56:49,666 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:56:49,667 INFO ]: Start minimizeSevpa. Operand 334 states. [2018-06-22 10:56:49,689 INFO ]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-06-22 10:56:49,689 INFO ]: Start removeUnreachable. Operand 332 states. [2018-06-22 10:56:49,693 INFO ]: Finished removeUnreachable. Reduced from 332 states to 332 states and 375 transitions. [2018-06-22 10:56:49,693 INFO ]: Start accepts. Automaton has 332 states and 375 transitions. Word has length 141 [2018-06-22 10:56:49,693 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:49,693 INFO ]: Abstraction has 332 states and 375 transitions. [2018-06-22 10:56:49,693 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:56:49,693 INFO ]: Start isEmpty. Operand 332 states and 375 transitions. [2018-06-22 10:56:49,697 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 10:56:49,697 INFO ]: Found error trace [2018-06-22 10:56:49,697 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, 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:56:49,697 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:49,697 INFO ]: Analyzing trace with hash -2029796585, now seen corresponding path program 1 times [2018-06-22 10:56:49,697 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:49,697 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:49,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:49,698 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:49,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:49,731 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:50,002 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:56:50,002 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:50,002 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:56:50,002 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:56:50,002 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:56:50,003 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:56:50,003 INFO ]: Start difference. First operand 332 states and 375 transitions. Second operand 11 states. [2018-06-22 10:56:50,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:50,255 INFO ]: Finished difference Result 380 states and 440 transitions. [2018-06-22 10:56:50,281 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:56:50,281 INFO ]: Start accepts. Automaton has 11 states. Word has length 141 [2018-06-22 10:56:50,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:50,285 INFO ]: With dead ends: 380 [2018-06-22 10:56:50,285 INFO ]: Without dead ends: 377 [2018-06-22 10:56:50,285 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:56:50,286 INFO ]: Start minimizeSevpa. Operand 377 states. [2018-06-22 10:56:50,309 INFO ]: Finished minimizeSevpa. Reduced states from 377 to 359. [2018-06-22 10:56:50,309 INFO ]: Start removeUnreachable. Operand 359 states. [2018-06-22 10:56:50,312 INFO ]: Finished removeUnreachable. Reduced from 359 states to 359 states and 407 transitions. [2018-06-22 10:56:50,312 INFO ]: Start accepts. Automaton has 359 states and 407 transitions. Word has length 141 [2018-06-22 10:56:50,312 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:50,312 INFO ]: Abstraction has 359 states and 407 transitions. [2018-06-22 10:56:50,312 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:56:50,312 INFO ]: Start isEmpty. Operand 359 states and 407 transitions. [2018-06-22 10:56:50,316 INFO ]: Finished isEmpty. Found accepting run of length 146 [2018-06-22 10:56:50,316 INFO ]: Found error trace [2018-06-22 10:56:50,316 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, 1, 1, 1, 1, 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:56:50,316 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:50,316 INFO ]: Analyzing trace with hash 766612359, now seen corresponding path program 1 times [2018-06-22 10:56:50,316 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:50,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:50,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:50,317 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:50,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:50,348 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:50,609 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-06-22 10:56:50,677 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:56:50,677 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:50,677 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:56:50,677 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:56:50,677 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:56:50,677 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:56:50,677 INFO ]: Start difference. First operand 359 states and 407 transitions. Second operand 12 states. [2018-06-22 10:56:50,927 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:50,927 INFO ]: Finished difference Result 406 states and 456 transitions. [2018-06-22 10:56:50,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:56:50,928 INFO ]: Start accepts. Automaton has 12 states. Word has length 145 [2018-06-22 10:56:50,928 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:50,931 INFO ]: With dead ends: 406 [2018-06-22 10:56:50,931 INFO ]: Without dead ends: 398 [2018-06-22 10:56:50,931 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:56:50,931 INFO ]: Start minimizeSevpa. Operand 398 states. [2018-06-22 10:56:50,949 INFO ]: Finished minimizeSevpa. Reduced states from 398 to 372. [2018-06-22 10:56:50,949 INFO ]: Start removeUnreachable. Operand 372 states. [2018-06-22 10:56:50,952 INFO ]: Finished removeUnreachable. Reduced from 372 states to 372 states and 421 transitions. [2018-06-22 10:56:50,952 INFO ]: Start accepts. Automaton has 372 states and 421 transitions. Word has length 145 [2018-06-22 10:56:50,952 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:50,952 INFO ]: Abstraction has 372 states and 421 transitions. [2018-06-22 10:56:50,952 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:56:50,952 INFO ]: Start isEmpty. Operand 372 states and 421 transitions. [2018-06-22 10:56:50,955 INFO ]: Finished isEmpty. Found accepting run of length 146 [2018-06-22 10:56:50,955 INFO ]: Found error trace [2018-06-22 10:56:50,955 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, 1, 1, 1, 1, 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:56:50,956 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:50,956 INFO ]: Analyzing trace with hash 2094266820, now seen corresponding path program 1 times [2018-06-22 10:56:50,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:50,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:50,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:50,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:50,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:50,986 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:51,740 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:56:51,740 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:51,740 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:56:51,741 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:56:51,741 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:56:51,741 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:56:51,741 INFO ]: Start difference. First operand 372 states and 421 transitions. Second operand 12 states. [2018-06-22 10:56:52,584 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:52,584 INFO ]: Finished difference Result 406 states and 459 transitions. [2018-06-22 10:56:52,584 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:56:52,584 INFO ]: Start accepts. Automaton has 12 states. Word has length 145 [2018-06-22 10:56:52,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:52,587 INFO ]: With dead ends: 406 [2018-06-22 10:56:52,587 INFO ]: Without dead ends: 398 [2018-06-22 10:56:52,587 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:56:52,588 INFO ]: Start minimizeSevpa. Operand 398 states. [2018-06-22 10:56:52,612 INFO ]: Finished minimizeSevpa. Reduced states from 398 to 386. [2018-06-22 10:56:52,612 INFO ]: Start removeUnreachable. Operand 386 states. [2018-06-22 10:56:52,615 INFO ]: Finished removeUnreachable. Reduced from 386 states to 386 states and 438 transitions. [2018-06-22 10:56:52,615 INFO ]: Start accepts. Automaton has 386 states and 438 transitions. Word has length 145 [2018-06-22 10:56:52,616 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:52,616 INFO ]: Abstraction has 386 states and 438 transitions. [2018-06-22 10:56:52,616 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:56:52,616 INFO ]: Start isEmpty. Operand 386 states and 438 transitions. [2018-06-22 10:56:52,619 INFO ]: Finished isEmpty. Found accepting run of length 146 [2018-06-22 10:56:52,619 INFO ]: Found error trace [2018-06-22 10:56:52,619 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, 1, 1, 1, 1, 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:56:52,619 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:52,622 INFO ]: Analyzing trace with hash -1929413727, now seen corresponding path program 1 times [2018-06-22 10:56:52,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:52,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:52,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:52,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:52,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:52,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:53,041 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:56:53,041 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:53,041 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:56:53,042 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:56:53,042 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:56:53,042 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:56:53,042 INFO ]: Start difference. First operand 386 states and 438 transitions. Second operand 12 states. [2018-06-22 10:56:53,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:53,296 INFO ]: Finished difference Result 425 states and 485 transitions. [2018-06-22 10:56:53,297 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:56:53,297 INFO ]: Start accepts. Automaton has 12 states. Word has length 145 [2018-06-22 10:56:53,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:53,301 INFO ]: With dead ends: 425 [2018-06-22 10:56:53,301 INFO ]: Without dead ends: 412 [2018-06-22 10:56:53,302 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:56:53,302 INFO ]: Start minimizeSevpa. Operand 412 states. [2018-06-22 10:56:53,320 INFO ]: Finished minimizeSevpa. Reduced states from 412 to 398. [2018-06-22 10:56:53,320 INFO ]: Start removeUnreachable. Operand 398 states. [2018-06-22 10:56:53,323 INFO ]: Finished removeUnreachable. Reduced from 398 states to 398 states and 452 transitions. [2018-06-22 10:56:53,323 INFO ]: Start accepts. Automaton has 398 states and 452 transitions. Word has length 145 [2018-06-22 10:56:53,323 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:53,323 INFO ]: Abstraction has 398 states and 452 transitions. [2018-06-22 10:56:53,323 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:56:53,323 INFO ]: Start isEmpty. Operand 398 states and 452 transitions. [2018-06-22 10:56:53,326 INFO ]: Finished isEmpty. Found accepting run of length 146 [2018-06-22 10:56:53,326 INFO ]: Found error trace [2018-06-22 10:56:53,326 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, 1, 1, 1, 1, 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:56:53,326 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:53,327 INFO ]: Analyzing trace with hash 1037899108, now seen corresponding path program 1 times [2018-06-22 10:56:53,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:53,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:53,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:53,327 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:53,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:53,354 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:53,631 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:56:53,631 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:53,631 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:56:53,631 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:56:53,631 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:56:53,631 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:56:53,632 INFO ]: Start difference. First operand 398 states and 452 transitions. Second operand 12 states. [2018-06-22 10:56:54,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:54,645 INFO ]: Finished difference Result 404 states and 461 transitions. [2018-06-22 10:56:54,646 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:56:54,646 INFO ]: Start accepts. Automaton has 12 states. Word has length 145 [2018-06-22 10:56:54,646 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:54,647 INFO ]: With dead ends: 404 [2018-06-22 10:56:54,647 INFO ]: Without dead ends: 227 [2018-06-22 10:56:54,647 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:56:54,647 INFO ]: Start minimizeSevpa. Operand 227 states. [2018-06-22 10:56:54,654 INFO ]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-06-22 10:56:54,654 INFO ]: Start removeUnreachable. Operand 227 states. [2018-06-22 10:56:54,656 INFO ]: Finished removeUnreachable. Reduced from 227 states to 227 states and 245 transitions. [2018-06-22 10:56:54,656 INFO ]: Start accepts. Automaton has 227 states and 245 transitions. Word has length 145 [2018-06-22 10:56:54,656 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:54,656 INFO ]: Abstraction has 227 states and 245 transitions. [2018-06-22 10:56:54,656 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:56:54,656 INFO ]: Start isEmpty. Operand 227 states and 245 transitions. [2018-06-22 10:56:54,659 INFO ]: Finished isEmpty. Found accepting run of length 170 [2018-06-22 10:56:54,659 INFO ]: Found error trace [2018-06-22 10:56:54,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:54,659 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:54,659 INFO ]: Analyzing trace with hash 811923400, now seen corresponding path program 1 times [2018-06-22 10:56:54,659 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:54,659 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:54,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:54,660 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:54,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:54,690 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:55,050 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:56:55,051 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:55,051 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-06-22 10:56:55,052 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:56:55,052 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:56:55,052 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:56:55,052 INFO ]: Start difference. First operand 227 states and 245 transitions. Second operand 18 states. [2018-06-22 10:56:55,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:55,671 INFO ]: Finished difference Result 297 states and 340 transitions. [2018-06-22 10:56:55,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:56:55,671 INFO ]: Start accepts. Automaton has 18 states. Word has length 169 [2018-06-22 10:56:55,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:55,674 INFO ]: With dead ends: 297 [2018-06-22 10:56:55,674 INFO ]: Without dead ends: 297 [2018-06-22 10:56:55,674 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:56:55,674 INFO ]: Start minimizeSevpa. Operand 297 states. [2018-06-22 10:56:55,687 INFO ]: Finished minimizeSevpa. Reduced states from 297 to 295. [2018-06-22 10:56:55,687 INFO ]: Start removeUnreachable. Operand 295 states. [2018-06-22 10:56:55,689 INFO ]: Finished removeUnreachable. Reduced from 295 states to 295 states and 337 transitions. [2018-06-22 10:56:55,689 INFO ]: Start accepts. Automaton has 295 states and 337 transitions. Word has length 169 [2018-06-22 10:56:55,691 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:55,691 INFO ]: Abstraction has 295 states and 337 transitions. [2018-06-22 10:56:55,691 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:56:55,691 INFO ]: Start isEmpty. Operand 295 states and 337 transitions. [2018-06-22 10:56:55,695 INFO ]: Finished isEmpty. Found accepting run of length 170 [2018-06-22 10:56:55,695 INFO ]: Found error trace [2018-06-22 10:56:55,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:55,695 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:55,695 INFO ]: Analyzing trace with hash 1822225259, now seen corresponding path program 1 times [2018-06-22 10:56:55,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:55,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:55,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:55,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:55,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:55,724 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:56,042 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:56:56,042 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:56,042 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-06-22 10:56:56,042 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:56:56,043 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:56:56,043 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:56:56,043 INFO ]: Start difference. First operand 295 states and 337 transitions. Second operand 18 states. [2018-06-22 10:56:57,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:57,075 INFO ]: Finished difference Result 389 states and 468 transitions. [2018-06-22 10:56:57,076 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:56:57,076 INFO ]: Start accepts. Automaton has 18 states. Word has length 169 [2018-06-22 10:56:57,076 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:57,078 INFO ]: With dead ends: 389 [2018-06-22 10:56:57,078 INFO ]: Without dead ends: 380 [2018-06-22 10:56:57,078 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:56:57,079 INFO ]: Start minimizeSevpa. Operand 380 states. [2018-06-22 10:56:57,093 INFO ]: Finished minimizeSevpa. Reduced states from 380 to 362. [2018-06-22 10:56:57,093 INFO ]: Start removeUnreachable. Operand 362 states. [2018-06-22 10:56:57,095 INFO ]: Finished removeUnreachable. Reduced from 362 states to 362 states and 423 transitions. [2018-06-22 10:56:57,095 INFO ]: Start accepts. Automaton has 362 states and 423 transitions. Word has length 169 [2018-06-22 10:56:57,096 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:57,096 INFO ]: Abstraction has 362 states and 423 transitions. [2018-06-22 10:56:57,096 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:56:57,096 INFO ]: Start isEmpty. Operand 362 states and 423 transitions. [2018-06-22 10:56:57,098 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:56:57,098 INFO ]: Found error trace [2018-06-22 10:56:57,098 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:57,098 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:57,099 INFO ]: Analyzing trace with hash 468398266, now seen corresponding path program 1 times [2018-06-22 10:56:57,099 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:57,099 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:57,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:57,099 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:57,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:57,133 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:57,570 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:56:57,570 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:57,570 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:56:57,570 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:56:57,570 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:56:57,570 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:56:57,570 INFO ]: Start difference. First operand 362 states and 423 transitions. Second operand 12 states. [2018-06-22 10:56:57,777 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:57,777 INFO ]: Finished difference Result 417 states and 509 transitions. [2018-06-22 10:56:57,777 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:56:57,777 INFO ]: Start accepts. Automaton has 12 states. Word has length 205 [2018-06-22 10:56:57,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:57,780 INFO ]: With dead ends: 417 [2018-06-22 10:56:57,780 INFO ]: Without dead ends: 417 [2018-06-22 10:56:57,780 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:56:57,781 INFO ]: Start minimizeSevpa. Operand 417 states. [2018-06-22 10:56:57,800 INFO ]: Finished minimizeSevpa. Reduced states from 417 to 407. [2018-06-22 10:56:57,800 INFO ]: Start removeUnreachable. Operand 407 states. [2018-06-22 10:56:57,802 INFO ]: Finished removeUnreachable. Reduced from 407 states to 407 states and 490 transitions. [2018-06-22 10:56:57,802 INFO ]: Start accepts. Automaton has 407 states and 490 transitions. Word has length 205 [2018-06-22 10:56:57,803 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:57,803 INFO ]: Abstraction has 407 states and 490 transitions. [2018-06-22 10:56:57,803 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:56:57,803 INFO ]: Start isEmpty. Operand 407 states and 490 transitions. [2018-06-22 10:56:57,805 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:56:57,805 INFO ]: Found error trace [2018-06-22 10:56:57,805 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:57,805 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:57,806 INFO ]: Analyzing trace with hash -424380390, now seen corresponding path program 1 times [2018-06-22 10:56:57,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:57,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:57,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:57,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:57,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:57,835 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:58,157 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:56:58,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:58,157 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:56:58,158 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:56:58,158 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:56:58,158 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:56:58,158 INFO ]: Start difference. First operand 407 states and 490 transitions. Second operand 12 states. [2018-06-22 10:56:58,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:58,467 INFO ]: Finished difference Result 474 states and 593 transitions. [2018-06-22 10:56:58,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:56:58,467 INFO ]: Start accepts. Automaton has 12 states. Word has length 205 [2018-06-22 10:56:58,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:58,470 INFO ]: With dead ends: 474 [2018-06-22 10:56:58,470 INFO ]: Without dead ends: 473 [2018-06-22 10:56:58,470 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:56:58,471 INFO ]: Start minimizeSevpa. Operand 473 states. [2018-06-22 10:56:58,492 INFO ]: Finished minimizeSevpa. Reduced states from 473 to 447. [2018-06-22 10:56:58,492 INFO ]: Start removeUnreachable. Operand 447 states. [2018-06-22 10:56:58,495 INFO ]: Finished removeUnreachable. Reduced from 447 states to 447 states and 538 transitions. [2018-06-22 10:56:58,495 INFO ]: Start accepts. Automaton has 447 states and 538 transitions. Word has length 205 [2018-06-22 10:56:58,495 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:58,495 INFO ]: Abstraction has 447 states and 538 transitions. [2018-06-22 10:56:58,495 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:56:58,495 INFO ]: Start isEmpty. Operand 447 states and 538 transitions. [2018-06-22 10:56:58,498 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:56:58,498 INFO ]: Found error trace [2018-06-22 10:56:58,499 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:58,500 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:58,500 INFO ]: Analyzing trace with hash 153050021, now seen corresponding path program 1 times [2018-06-22 10:56:58,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:58,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:58,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:58,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:58,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:58,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:59,367 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:56:59,367 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:59,367 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:56:59,367 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:56:59,367 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:56:59,367 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:56:59,367 INFO ]: Start difference. First operand 447 states and 538 transitions. Second operand 12 states. [2018-06-22 10:56:59,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:59,533 INFO ]: Finished difference Result 513 states and 615 transitions. [2018-06-22 10:56:59,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:56:59,533 INFO ]: Start accepts. Automaton has 12 states. Word has length 205 [2018-06-22 10:56:59,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:59,535 INFO ]: With dead ends: 513 [2018-06-22 10:56:59,535 INFO ]: Without dead ends: 489 [2018-06-22 10:56:59,536 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:56:59,536 INFO ]: Start minimizeSevpa. Operand 489 states. [2018-06-22 10:56:59,556 INFO ]: Finished minimizeSevpa. Reduced states from 489 to 463. [2018-06-22 10:56:59,556 INFO ]: Start removeUnreachable. Operand 463 states. [2018-06-22 10:56:59,558 INFO ]: Finished removeUnreachable. Reduced from 463 states to 463 states and 564 transitions. [2018-06-22 10:56:59,558 INFO ]: Start accepts. Automaton has 463 states and 564 transitions. Word has length 205 [2018-06-22 10:56:59,559 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:59,559 INFO ]: Abstraction has 463 states and 564 transitions. [2018-06-22 10:56:59,559 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:56:59,559 INFO ]: Start isEmpty. Operand 463 states and 564 transitions. [2018-06-22 10:56:59,561 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:56:59,561 INFO ]: Found error trace [2018-06-22 10:56:59,561 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:59,562 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:59,562 INFO ]: Analyzing trace with hash -857418078, now seen corresponding path program 1 times [2018-06-22 10:56:59,562 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:59,562 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:59,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:59,562 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:59,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:59,589 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:59,871 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:56:59,871 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:59,871 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:56:59,871 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:56:59,871 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:56:59,872 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:56:59,872 INFO ]: Start difference. First operand 463 states and 564 transitions. Second operand 12 states. [2018-06-22 10:57:00,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:00,045 INFO ]: Finished difference Result 521 states and 620 transitions. [2018-06-22 10:57:00,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:00,046 INFO ]: Start accepts. Automaton has 12 states. Word has length 205 [2018-06-22 10:57:00,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:00,048 INFO ]: With dead ends: 521 [2018-06-22 10:57:00,048 INFO ]: Without dead ends: 497 [2018-06-22 10:57:00,048 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:57:00,048 INFO ]: Start minimizeSevpa. Operand 497 states. [2018-06-22 10:57:00,065 INFO ]: Finished minimizeSevpa. Reduced states from 497 to 479. [2018-06-22 10:57:00,065 INFO ]: Start removeUnreachable. Operand 479 states. [2018-06-22 10:57:00,067 INFO ]: Finished removeUnreachable. Reduced from 479 states to 479 states and 577 transitions. [2018-06-22 10:57:00,067 INFO ]: Start accepts. Automaton has 479 states and 577 transitions. Word has length 205 [2018-06-22 10:57:00,067 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:00,068 INFO ]: Abstraction has 479 states and 577 transitions. [2018-06-22 10:57:00,068 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:00,068 INFO ]: Start isEmpty. Operand 479 states and 577 transitions. [2018-06-22 10:57:00,070 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:57:00,070 INFO ]: Found error trace [2018-06-22 10:57:00,070 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:00,070 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:00,071 INFO ]: Analyzing trace with hash 1478866365, now seen corresponding path program 1 times [2018-06-22 10:57:00,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:00,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:00,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:00,071 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:00,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:00,096 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:00,434 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:57:00,441 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:00,441 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:57:00,441 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:57:00,444 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:57:00,444 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:00,444 INFO ]: Start difference. First operand 479 states and 577 transitions. Second operand 12 states. [2018-06-22 10:57:00,607 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:00,607 INFO ]: Finished difference Result 533 states and 630 transitions. [2018-06-22 10:57:00,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:00,607 INFO ]: Start accepts. Automaton has 12 states. Word has length 205 [2018-06-22 10:57:00,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:00,610 INFO ]: With dead ends: 533 [2018-06-22 10:57:00,610 INFO ]: Without dead ends: 507 [2018-06-22 10:57:00,610 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:57:00,610 INFO ]: Start minimizeSevpa. Operand 507 states. [2018-06-22 10:57:00,626 INFO ]: Finished minimizeSevpa. Reduced states from 507 to 481. [2018-06-22 10:57:00,626 INFO ]: Start removeUnreachable. Operand 481 states. [2018-06-22 10:57:00,630 INFO ]: Finished removeUnreachable. Reduced from 481 states to 481 states and 576 transitions. [2018-06-22 10:57:00,630 INFO ]: Start accepts. Automaton has 481 states and 576 transitions. Word has length 205 [2018-06-22 10:57:00,630 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:00,630 INFO ]: Abstraction has 481 states and 576 transitions. [2018-06-22 10:57:00,630 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:00,630 INFO ]: Start isEmpty. Operand 481 states and 576 transitions. [2018-06-22 10:57:00,633 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:57:00,633 INFO ]: Found error trace [2018-06-22 10:57:00,633 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:00,634 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:00,634 INFO ]: Analyzing trace with hash -1750196734, now seen corresponding path program 1 times [2018-06-22 10:57:00,634 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:00,634 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:00,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:00,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:00,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:00,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:01,071 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:57:01,071 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:01,071 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:57:01,071 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:57:01,072 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:57:01,072 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:01,072 INFO ]: Start difference. First operand 481 states and 576 transitions. Second operand 12 states. [2018-06-22 10:57:01,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:01,247 INFO ]: Finished difference Result 545 states and 649 transitions. [2018-06-22 10:57:01,249 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:01,249 INFO ]: Start accepts. Automaton has 12 states. Word has length 205 [2018-06-22 10:57:01,250 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:01,252 INFO ]: With dead ends: 545 [2018-06-22 10:57:01,252 INFO ]: Without dead ends: 519 [2018-06-22 10:57:01,252 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:01,253 INFO ]: Start minimizeSevpa. Operand 519 states. [2018-06-22 10:57:01,270 INFO ]: Finished minimizeSevpa. Reduced states from 519 to 497. [2018-06-22 10:57:01,270 INFO ]: Start removeUnreachable. Operand 497 states. [2018-06-22 10:57:01,272 INFO ]: Finished removeUnreachable. Reduced from 497 states to 497 states and 599 transitions. [2018-06-22 10:57:01,272 INFO ]: Start accepts. Automaton has 497 states and 599 transitions. Word has length 205 [2018-06-22 10:57:01,273 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:01,273 INFO ]: Abstraction has 497 states and 599 transitions. [2018-06-22 10:57:01,273 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:01,273 INFO ]: Start isEmpty. Operand 497 states and 599 transitions. [2018-06-22 10:57:01,275 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:57:01,275 INFO ]: Found error trace [2018-06-22 10:57:01,276 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:01,276 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:01,276 INFO ]: Analyzing trace with hash -1434848489, now seen corresponding path program 1 times [2018-06-22 10:57:01,276 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:01,276 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:01,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:01,276 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:01,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:01,299 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:01,547 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:57:01,547 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:01,547 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:57:01,548 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:57:01,548 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:57:01,548 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:01,548 INFO ]: Start difference. First operand 497 states and 599 transitions. Second operand 12 states. [2018-06-22 10:57:01,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:01,736 INFO ]: Finished difference Result 553 states and 658 transitions. [2018-06-22 10:57:01,736 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:01,736 INFO ]: Start accepts. Automaton has 12 states. Word has length 205 [2018-06-22 10:57:01,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:01,738 INFO ]: With dead ends: 553 [2018-06-22 10:57:01,738 INFO ]: Without dead ends: 527 [2018-06-22 10:57:01,738 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:57:01,739 INFO ]: Start minimizeSevpa. Operand 527 states. [2018-06-22 10:57:01,756 INFO ]: Finished minimizeSevpa. Reduced states from 527 to 507. [2018-06-22 10:57:01,756 INFO ]: Start removeUnreachable. Operand 507 states. [2018-06-22 10:57:01,758 INFO ]: Finished removeUnreachable. Reduced from 507 states to 507 states and 611 transitions. [2018-06-22 10:57:01,758 INFO ]: Start accepts. Automaton has 507 states and 611 transitions. Word has length 205 [2018-06-22 10:57:01,759 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:01,759 INFO ]: Abstraction has 507 states and 611 transitions. [2018-06-22 10:57:01,759 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:01,759 INFO ]: Start isEmpty. Operand 507 states and 611 transitions. [2018-06-22 10:57:01,761 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:57:01,761 INFO ]: Found error trace [2018-06-22 10:57:01,761 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:01,761 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:01,762 INFO ]: Analyzing trace with hash 1534302463, now seen corresponding path program 1 times [2018-06-22 10:57:01,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:01,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:01,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:01,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:01,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:01,784 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:02,205 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:57:02,206 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:02,206 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:57:02,206 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:57:02,206 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:57:02,206 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:02,206 INFO ]: Start difference. First operand 507 states and 611 transitions. Second operand 12 states. [2018-06-22 10:57:02,814 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:02,814 INFO ]: Finished difference Result 561 states and 666 transitions. [2018-06-22 10:57:02,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:02,814 INFO ]: Start accepts. Automaton has 12 states. Word has length 205 [2018-06-22 10:57:02,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:02,815 INFO ]: With dead ends: 561 [2018-06-22 10:57:02,815 INFO ]: Without dead ends: 535 [2018-06-22 10:57:02,816 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:02,816 INFO ]: Start minimizeSevpa. Operand 535 states. [2018-06-22 10:57:02,832 INFO ]: Finished minimizeSevpa. Reduced states from 535 to 511. [2018-06-22 10:57:02,832 INFO ]: Start removeUnreachable. Operand 511 states. [2018-06-22 10:57:02,834 INFO ]: Finished removeUnreachable. Reduced from 511 states to 511 states and 615 transitions. [2018-06-22 10:57:02,834 INFO ]: Start accepts. Automaton has 511 states and 615 transitions. Word has length 205 [2018-06-22 10:57:02,835 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:02,835 INFO ]: Abstraction has 511 states and 615 transitions. [2018-06-22 10:57:02,835 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:02,835 INFO ]: Start isEmpty. Operand 511 states and 615 transitions. [2018-06-22 10:57:02,837 INFO ]: Finished isEmpty. Found accepting run of length 210 [2018-06-22 10:57:02,837 INFO ]: Found error trace [2018-06-22 10:57:02,838 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:02,838 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:02,838 INFO ]: Analyzing trace with hash -293149304, now seen corresponding path program 1 times [2018-06-22 10:57:02,838 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:02,838 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:02,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:02,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:02,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:02,862 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:03,553 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:57:03,553 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:03,553 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:03,554 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:03,554 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:03,554 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:03,554 INFO ]: Start difference. First operand 511 states and 615 transitions. Second operand 13 states. [2018-06-22 10:57:03,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:03,877 INFO ]: Finished difference Result 577 states and 693 transitions. [2018-06-22 10:57:03,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:03,877 INFO ]: Start accepts. Automaton has 13 states. Word has length 209 [2018-06-22 10:57:03,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:03,879 INFO ]: With dead ends: 577 [2018-06-22 10:57:03,879 INFO ]: Without dead ends: 553 [2018-06-22 10:57:03,879 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:03,879 INFO ]: Start minimizeSevpa. Operand 553 states. [2018-06-22 10:57:03,894 INFO ]: Finished minimizeSevpa. Reduced states from 553 to 535. [2018-06-22 10:57:03,894 INFO ]: Start removeUnreachable. Operand 535 states. [2018-06-22 10:57:03,897 INFO ]: Finished removeUnreachable. Reduced from 535 states to 535 states and 650 transitions. [2018-06-22 10:57:03,897 INFO ]: Start accepts. Automaton has 535 states and 650 transitions. Word has length 209 [2018-06-22 10:57:03,897 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:03,897 INFO ]: Abstraction has 535 states and 650 transitions. [2018-06-22 10:57:03,897 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:03,897 INFO ]: Start isEmpty. Operand 535 states and 650 transitions. [2018-06-22 10:57:03,900 INFO ]: Finished isEmpty. Found accepting run of length 210 [2018-06-22 10:57:03,900 INFO ]: Found error trace [2018-06-22 10:57:03,900 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:03,901 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:03,901 INFO ]: Analyzing trace with hash -895758517, now seen corresponding path program 1 times [2018-06-22 10:57:03,901 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:03,901 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:03,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:03,901 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:03,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:03,926 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:04,230 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:57:04,230 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:04,230 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:04,231 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:04,231 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:04,231 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:04,231 INFO ]: Start difference. First operand 535 states and 650 transitions. Second operand 13 states. [2018-06-22 10:57:04,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:04,486 INFO ]: Finished difference Result 595 states and 720 transitions. [2018-06-22 10:57:04,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:04,486 INFO ]: Start accepts. Automaton has 13 states. Word has length 209 [2018-06-22 10:57:04,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:04,488 INFO ]: With dead ends: 595 [2018-06-22 10:57:04,488 INFO ]: Without dead ends: 569 [2018-06-22 10:57:04,488 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:57:04,488 INFO ]: Start minimizeSevpa. Operand 569 states. [2018-06-22 10:57:04,502 INFO ]: Finished minimizeSevpa. Reduced states from 569 to 549. [2018-06-22 10:57:04,502 INFO ]: Start removeUnreachable. Operand 549 states. [2018-06-22 10:57:04,505 INFO ]: Finished removeUnreachable. Reduced from 549 states to 549 states and 673 transitions. [2018-06-22 10:57:04,505 INFO ]: Start accepts. Automaton has 549 states and 673 transitions. Word has length 209 [2018-06-22 10:57:04,505 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:04,505 INFO ]: Abstraction has 549 states and 673 transitions. [2018-06-22 10:57:04,505 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:04,505 INFO ]: Start isEmpty. Operand 549 states and 673 transitions. [2018-06-22 10:57:04,508 INFO ]: Finished isEmpty. Found accepting run of length 210 [2018-06-22 10:57:04,508 INFO ]: Found error trace [2018-06-22 10:57:04,509 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:04,509 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:04,509 INFO ]: Analyzing trace with hash 1000414691, now seen corresponding path program 1 times [2018-06-22 10:57:04,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:04,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:04,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:04,510 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:04,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:04,530 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:04,907 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:57:04,907 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:04,907 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:04,907 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:04,908 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:04,908 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:04,908 INFO ]: Start difference. First operand 549 states and 673 transitions. Second operand 13 states. [2018-06-22 10:57:06,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:06,438 INFO ]: Finished difference Result 611 states and 738 transitions. [2018-06-22 10:57:06,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:06,440 INFO ]: Start accepts. Automaton has 13 states. Word has length 209 [2018-06-22 10:57:06,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:06,442 INFO ]: With dead ends: 611 [2018-06-22 10:57:06,442 INFO ]: Without dead ends: 585 [2018-06-22 10:57:06,442 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:57:06,442 INFO ]: Start minimizeSevpa. Operand 585 states. [2018-06-22 10:57:06,459 INFO ]: Finished minimizeSevpa. Reduced states from 585 to 563. [2018-06-22 10:57:06,459 INFO ]: Start removeUnreachable. Operand 563 states. [2018-06-22 10:57:06,461 INFO ]: Finished removeUnreachable. Reduced from 563 states to 563 states and 689 transitions. [2018-06-22 10:57:06,461 INFO ]: Start accepts. Automaton has 563 states and 689 transitions. Word has length 209 [2018-06-22 10:57:06,462 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:06,462 INFO ]: Abstraction has 563 states and 689 transitions. [2018-06-22 10:57:06,462 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:06,462 INFO ]: Start isEmpty. Operand 563 states and 689 transitions. [2018-06-22 10:57:06,465 INFO ]: Finished isEmpty. Found accepting run of length 210 [2018-06-22 10:57:06,465 INFO ]: Found error trace [2018-06-22 10:57:06,465 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:06,465 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:06,465 INFO ]: Analyzing trace with hash -929085845, now seen corresponding path program 1 times [2018-06-22 10:57:06,465 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:06,465 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:06,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:06,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:06,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:06,488 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:06,729 WARN ]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-06-22 10:57:07,301 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:57:07,301 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:07,301 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:07,302 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:07,302 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:07,303 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:07,303 INFO ]: Start difference. First operand 563 states and 689 transitions. Second operand 13 states. [2018-06-22 10:57:07,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:07,549 INFO ]: Finished difference Result 635 states and 775 transitions. [2018-06-22 10:57:07,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:07,549 INFO ]: Start accepts. Automaton has 13 states. Word has length 209 [2018-06-22 10:57:07,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:07,551 INFO ]: With dead ends: 635 [2018-06-22 10:57:07,552 INFO ]: Without dead ends: 608 [2018-06-22 10:57:07,552 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:07,552 INFO ]: Start minimizeSevpa. Operand 608 states. [2018-06-22 10:57:07,568 INFO ]: Finished minimizeSevpa. Reduced states from 608 to 586. [2018-06-22 10:57:07,568 INFO ]: Start removeUnreachable. Operand 586 states. [2018-06-22 10:57:07,571 INFO ]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2018-06-22 10:57:07,571 INFO ]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 209 [2018-06-22 10:57:07,571 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:07,571 INFO ]: Abstraction has 586 states and 716 transitions. [2018-06-22 10:57:07,571 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:07,571 INFO ]: Start isEmpty. Operand 586 states and 716 transitions. [2018-06-22 10:57:07,574 INFO ]: Finished isEmpty. Found accepting run of length 210 [2018-06-22 10:57:07,575 INFO ]: Found error trace [2018-06-22 10:57:07,575 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:07,575 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:07,575 INFO ]: Analyzing trace with hash -259821976, now seen corresponding path program 1 times [2018-06-22 10:57:07,575 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:07,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:07,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:07,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:07,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:07,596 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:08,169 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:57:08,169 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:08,170 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:08,170 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:08,170 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:08,170 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:08,170 INFO ]: Start difference. First operand 586 states and 716 transitions. Second operand 13 states. [2018-06-22 10:57:08,562 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:08,562 INFO ]: Finished difference Result 644 states and 775 transitions. [2018-06-22 10:57:08,563 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:08,563 INFO ]: Start accepts. Automaton has 13 states. Word has length 209 [2018-06-22 10:57:08,563 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:08,566 INFO ]: With dead ends: 644 [2018-06-22 10:57:08,566 INFO ]: Without dead ends: 613 [2018-06-22 10:57:08,566 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:08,566 INFO ]: Start minimizeSevpa. Operand 613 states. [2018-06-22 10:57:08,586 INFO ]: Finished minimizeSevpa. Reduced states from 613 to 591. [2018-06-22 10:57:08,587 INFO ]: Start removeUnreachable. Operand 591 states. [2018-06-22 10:57:08,590 INFO ]: Finished removeUnreachable. Reduced from 591 states to 591 states and 718 transitions. [2018-06-22 10:57:08,590 INFO ]: Start accepts. Automaton has 591 states and 718 transitions. Word has length 209 [2018-06-22 10:57:08,590 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:08,590 INFO ]: Abstraction has 591 states and 718 transitions. [2018-06-22 10:57:08,590 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:08,590 INFO ]: Start isEmpty. Operand 591 states and 718 transitions. [2018-06-22 10:57:08,594 INFO ]: Finished isEmpty. Found accepting run of length 210 [2018-06-22 10:57:08,594 INFO ]: Found error trace [2018-06-22 10:57:08,594 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:08,594 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:08,594 INFO ]: Analyzing trace with hash -690383547, now seen corresponding path program 1 times [2018-06-22 10:57:08,594 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:08,594 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:08,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:08,595 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:08,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:08,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:09,290 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:57:09,290 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:09,290 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:09,290 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:09,290 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:09,290 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:09,290 INFO ]: Start difference. First operand 591 states and 718 transitions. Second operand 13 states. [2018-06-22 10:57:09,555 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:09,555 INFO ]: Finished difference Result 659 states and 785 transitions. [2018-06-22 10:57:09,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:09,555 INFO ]: Start accepts. Automaton has 13 states. Word has length 209 [2018-06-22 10:57:09,556 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:09,557 INFO ]: With dead ends: 659 [2018-06-22 10:57:09,557 INFO ]: Without dead ends: 629 [2018-06-22 10:57:09,557 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:09,558 INFO ]: Start minimizeSevpa. Operand 629 states. [2018-06-22 10:57:09,573 INFO ]: Finished minimizeSevpa. Reduced states from 629 to 593. [2018-06-22 10:57:09,573 INFO ]: Start removeUnreachable. Operand 593 states. [2018-06-22 10:57:09,575 INFO ]: Finished removeUnreachable. Reduced from 593 states to 593 states and 718 transitions. [2018-06-22 10:57:09,575 INFO ]: Start accepts. Automaton has 593 states and 718 transitions. Word has length 209 [2018-06-22 10:57:09,576 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:09,576 INFO ]: Abstraction has 593 states and 718 transitions. [2018-06-22 10:57:09,576 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:09,576 INFO ]: Start isEmpty. Operand 593 states and 718 transitions. [2018-06-22 10:57:09,579 INFO ]: Finished isEmpty. Found accepting run of length 210 [2018-06-22 10:57:09,579 INFO ]: Found error trace [2018-06-22 10:57:09,579 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:09,579 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:09,579 INFO ]: Analyzing trace with hash -1326320088, now seen corresponding path program 1 times [2018-06-22 10:57:09,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:09,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:09,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:09,580 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:09,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:09,599 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:09,770 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:57:09,770 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:09,770 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:09,770 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:09,770 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:09,770 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:09,771 INFO ]: Start difference. First operand 593 states and 718 transitions. Second operand 13 states. [2018-06-22 10:57:10,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:10,154 INFO ]: Finished difference Result 655 states and 782 transitions. [2018-06-22 10:57:10,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:10,155 INFO ]: Start accepts. Automaton has 13 states. Word has length 209 [2018-06-22 10:57:10,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:10,157 INFO ]: With dead ends: 655 [2018-06-22 10:57:10,157 INFO ]: Without dead ends: 622 [2018-06-22 10:57:10,157 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:57:10,157 INFO ]: Start minimizeSevpa. Operand 622 states. [2018-06-22 10:57:10,170 INFO ]: Finished minimizeSevpa. Reduced states from 622 to 598. [2018-06-22 10:57:10,170 INFO ]: Start removeUnreachable. Operand 598 states. [2018-06-22 10:57:10,172 INFO ]: Finished removeUnreachable. Reduced from 598 states to 598 states and 721 transitions. [2018-06-22 10:57:10,172 INFO ]: Start accepts. Automaton has 598 states and 721 transitions. Word has length 209 [2018-06-22 10:57:10,172 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:10,172 INFO ]: Abstraction has 598 states and 721 transitions. [2018-06-22 10:57:10,172 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:10,172 INFO ]: Start isEmpty. Operand 598 states and 721 transitions. [2018-06-22 10:57:10,176 INFO ]: Finished isEmpty. Found accepting run of length 210 [2018-06-22 10:57:10,176 INFO ]: Found error trace [2018-06-22 10:57:10,176 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:10,176 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:10,176 INFO ]: Analyzing trace with hash 1636351232, now seen corresponding path program 1 times [2018-06-22 10:57:10,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:10,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:10,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:10,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:10,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:10,195 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:10,516 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:57:10,516 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:10,516 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:10,517 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:10,517 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:10,517 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:10,517 INFO ]: Start difference. First operand 598 states and 721 transitions. Second operand 13 states. [2018-06-22 10:57:10,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:10,716 INFO ]: Finished difference Result 656 states and 780 transitions. [2018-06-22 10:57:10,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:10,716 INFO ]: Start accepts. Automaton has 13 states. Word has length 209 [2018-06-22 10:57:10,717 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:10,718 INFO ]: With dead ends: 656 [2018-06-22 10:57:10,718 INFO ]: Without dead ends: 625 [2018-06-22 10:57:10,719 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:57:10,719 INFO ]: Start minimizeSevpa. Operand 625 states. [2018-06-22 10:57:10,733 INFO ]: Finished minimizeSevpa. Reduced states from 625 to 601. [2018-06-22 10:57:10,733 INFO ]: Start removeUnreachable. Operand 601 states. [2018-06-22 10:57:10,735 INFO ]: Finished removeUnreachable. Reduced from 601 states to 601 states and 721 transitions. [2018-06-22 10:57:10,735 INFO ]: Start accepts. Automaton has 601 states and 721 transitions. Word has length 209 [2018-06-22 10:57:10,736 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:10,736 INFO ]: Abstraction has 601 states and 721 transitions. [2018-06-22 10:57:10,736 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:10,736 INFO ]: Start isEmpty. Operand 601 states and 721 transitions. [2018-06-22 10:57:10,738 INFO ]: Finished isEmpty. Found accepting run of length 214 [2018-06-22 10:57:10,738 INFO ]: Found error trace [2018-06-22 10:57:10,738 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:10,738 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:10,739 INFO ]: Analyzing trace with hash 1348610321, now seen corresponding path program 1 times [2018-06-22 10:57:10,739 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:10,739 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:10,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:10,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:10,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:10,758 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:11,077 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:57:11,077 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:11,077 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:57:11,077 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:57:11,077 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:57:11,077 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:57:11,077 INFO ]: Start difference. First operand 601 states and 721 transitions. Second operand 14 states. [2018-06-22 10:57:11,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:11,433 INFO ]: Finished difference Result 667 states and 790 transitions. [2018-06-22 10:57:11,433 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:57:11,433 INFO ]: Start accepts. Automaton has 14 states. Word has length 213 [2018-06-22 10:57:11,433 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:11,435 INFO ]: With dead ends: 667 [2018-06-22 10:57:11,435 INFO ]: Without dead ends: 637 [2018-06-22 10:57:11,435 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:57:11,435 INFO ]: Start minimizeSevpa. Operand 637 states. [2018-06-22 10:57:11,446 INFO ]: Finished minimizeSevpa. Reduced states from 637 to 613. [2018-06-22 10:57:11,446 INFO ]: Start removeUnreachable. Operand 613 states. [2018-06-22 10:57:11,452 INFO ]: Finished removeUnreachable. Reduced from 613 states to 613 states and 735 transitions. [2018-06-22 10:57:11,452 INFO ]: Start accepts. Automaton has 613 states and 735 transitions. Word has length 213 [2018-06-22 10:57:11,453 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:11,453 INFO ]: Abstraction has 613 states and 735 transitions. [2018-06-22 10:57:11,453 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:57:11,453 INFO ]: Start isEmpty. Operand 613 states and 735 transitions. [2018-06-22 10:57:11,455 INFO ]: Finished isEmpty. Found accepting run of length 214 [2018-06-22 10:57:11,455 INFO ]: Found error trace [2018-06-22 10:57:11,455 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:11,455 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:11,455 INFO ]: Analyzing trace with hash -1696697106, now seen corresponding path program 1 times [2018-06-22 10:57:11,455 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:11,455 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:11,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:11,456 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:11,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:11,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:12,536 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:57:12,536 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:12,536 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:57:12,536 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:57:12,536 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:57:12,537 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:57:12,537 INFO ]: Start difference. First operand 613 states and 735 transitions. Second operand 14 states. [2018-06-22 10:57:12,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:12,760 INFO ]: Finished difference Result 633 states and 756 transitions. [2018-06-22 10:57:12,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:57:12,760 INFO ]: Start accepts. Automaton has 14 states. Word has length 213 [2018-06-22 10:57:12,760 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:12,760 INFO ]: With dead ends: 633 [2018-06-22 10:57:12,760 INFO ]: Without dead ends: 0 [2018-06-22 10:57:12,760 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:57:12,760 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 10:57:12,760 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 10:57:12,760 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 10:57:12,760 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 10:57:12,761 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2018-06-22 10:57:12,761 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:12,761 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 10:57:12,761 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:57:12,761 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 10:57:12,761 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 10:57:12,765 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:57:12 BoogieIcfgContainer [2018-06-22 10:57:12,765 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:57:12,766 INFO ]: Toolchain (without parser) took 29766.88 ms. Allocated memory was 307.8 MB in the beginning and 712.0 MB in the end (delta: 404.2 MB). Free memory was 197.8 MB in the beginning and 433.7 MB in the end (delta: -235.9 MB). Peak memory consumption was 168.3 MB. Max. memory is 3.6 GB. [2018-06-22 10:57:12,766 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:57:12,766 INFO ]: ChcToBoogie took 81.34 ms. Allocated memory is still 307.8 MB. Free memory was 196.8 MB in the beginning and 193.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:57:12,766 INFO ]: Boogie Preprocessor took 85.38 ms. Allocated memory is still 307.8 MB. Free memory was 193.8 MB in the beginning and 190.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:57:12,767 INFO ]: RCFGBuilder took 871.24 ms. Allocated memory was 307.8 MB in the beginning and 325.1 MB in the end (delta: 17.3 MB). Free memory was 190.9 MB in the beginning and 220.6 MB in the end (delta: -29.7 MB). Peak memory consumption was 9.3 MB. Max. memory is 3.6 GB. [2018-06-22 10:57:12,767 INFO ]: TraceAbstraction took 28720.27 ms. Allocated memory was 325.1 MB in the beginning and 712.0 MB in the end (delta: 386.9 MB). Free memory was 220.6 MB in the beginning and 433.7 MB in the end (delta: -213.1 MB). Peak memory consumption was 173.8 MB. Max. memory is 3.6 GB. [2018-06-22 10:57:12,768 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 81.34 ms. Allocated memory is still 307.8 MB. Free memory was 196.8 MB in the beginning and 193.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 85.38 ms. Allocated memory is still 307.8 MB. Free memory was 193.8 MB in the beginning and 190.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 871.24 ms. Allocated memory was 307.8 MB in the beginning and 325.1 MB in the end (delta: 17.3 MB). Free memory was 190.9 MB in the beginning and 220.6 MB in the end (delta: -29.7 MB). Peak memory consumption was 9.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 28720.27 ms. Allocated memory was 325.1 MB in the beginning and 712.0 MB in the end (delta: 386.9 MB). Free memory was 220.6 MB in the beginning and 433.7 MB in the end (delta: -213.1 MB). Peak memory consumption was 173.8 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 63 procedures, 266 locations, 1 error locations. SAFE Result, 28.6s OverallTime, 29 OverallIterations, 2 TraceHistogramMax, 13.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8096 SDtfs, 399 SDslu, 87724 SDs, 0 SdLazy, 8347 SolverSat, 256 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=613occurred in iteration=28, 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, 29 MinimizatonAttempts, 476 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 5265 NumberOfCodeBlocks, 5265 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 5236 ConstructedInterpolants, 0 QuantifiedInterpolants, 1325024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 660/660 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/45.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-57-12-779.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/45.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-57-12-779.csv Received shutdown request...