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/21.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:51:23,944 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:51:23,946 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:51:23,957 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:51:23,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:51:23,959 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:51:23,960 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:51:23,964 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:51:23,966 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:51:23,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:51:23,969 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:51:23,969 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:51:23,970 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:51:23,974 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:51:23,975 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:51:23,976 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:51:23,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:51:23,980 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:51:23,982 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:51:23,983 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:51:23,984 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:51:23,986 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:51:23,987 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:51:23,987 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:51:23,987 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:51:23,988 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:51:23,989 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:51:23,990 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:51:23,991 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:51:23,991 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:51:23,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:51:23,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:51:23,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:51:23,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:51:23,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:51:23,995 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:51:24,008 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:51:24,008 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:51:24,008 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:51:24,009 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:51:24,010 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:51:24,010 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:51:24,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:51:24,010 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:51:24,011 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:51:24,011 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:51:24,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:51:24,011 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:51:24,011 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:51:24,012 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:51:24,012 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:51:24,012 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:51:24,012 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:51:24,012 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:51:24,012 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:51:24,014 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:51:24,014 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:51:24,055 INFO ]: Repository-Root is: /tmp [2018-06-22 10:51:24,072 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:51:24,079 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:51:24,081 INFO ]: Initializing SmtParser... [2018-06-22 10:51:24,081 INFO ]: SmtParser initialized [2018-06-22 10:51:24,082 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/21.c.smt2 [2018-06-22 10:51:24,083 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:51:24,174 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/21.c.smt2 unknown [2018-06-22 10:51:24,830 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/21.c.smt2 [2018-06-22 10:51:24,834 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:51:24,840 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:51:24,840 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:51:24,840 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:51:24,840 INFO ]: ChcToBoogie initialized [2018-06-22 10:51:24,843 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:51:24" (1/1) ... [2018-06-22 10:51:24,918 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:24 Unit [2018-06-22 10:51:24,918 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:51:24,919 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:51:24,919 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:51:24,919 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:51:24,942 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:24" (1/1) ... [2018-06-22 10:51:24,942 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:24" (1/1) ... [2018-06-22 10:51:24,960 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:24" (1/1) ... [2018-06-22 10:51:24,960 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:24" (1/1) ... [2018-06-22 10:51:24,969 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:24" (1/1) ... [2018-06-22 10:51:24,971 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:24" (1/1) ... [2018-06-22 10:51:24,974 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:24" (1/1) ... [2018-06-22 10:51:24,981 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:51:24,982 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:51:24,982 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:51:24,982 INFO ]: RCFGBuilder initialized [2018-06-22 10:51:24,983 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:24" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 10:51:24,998 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:51:24,998 INFO ]: Found specification of procedure False [2018-06-22 10:51:24,998 INFO ]: Found implementation of procedure False [2018-06-22 10:51:24,998 INFO ]: Specification and implementation of procedure h32 given in one single declaration [2018-06-22 10:51:24,998 INFO ]: Found specification of procedure h32 [2018-06-22 10:51:24,998 INFO ]: Found implementation of procedure h32 [2018-06-22 10:51:24,998 INFO ]: Specification and implementation of procedure h31 given in one single declaration [2018-06-22 10:51:24,998 INFO ]: Found specification of procedure h31 [2018-06-22 10:51:24,999 INFO ]: Found implementation of procedure h31 [2018-06-22 10:51:24,999 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:51:24,999 INFO ]: Found specification of procedure h18 [2018-06-22 10:51:24,999 INFO ]: Found implementation of procedure h18 [2018-06-22 10:51:24,999 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:51:24,999 INFO ]: Found specification of procedure h17 [2018-06-22 10:51:24,999 INFO ]: Found implementation of procedure h17 [2018-06-22 10:51:24,999 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:51:24,999 INFO ]: Found specification of procedure h16 [2018-06-22 10:51:24,999 INFO ]: Found implementation of procedure h16 [2018-06-22 10:51:24,999 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:51:24,999 INFO ]: Found specification of procedure h13 [2018-06-22 10:51:24,999 INFO ]: Found implementation of procedure h13 [2018-06-22 10:51:24,999 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:51:24,999 INFO ]: Found specification of procedure h12 [2018-06-22 10:51:24,999 INFO ]: Found implementation of procedure h12 [2018-06-22 10:51:24,999 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:51:24,999 INFO ]: Found specification of procedure h11 [2018-06-22 10:51:24,999 INFO ]: Found implementation of procedure h11 [2018-06-22 10:51:24,999 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:51:24,999 INFO ]: Found specification of procedure h10 [2018-06-22 10:51:24,999 INFO ]: Found implementation of procedure h10 [2018-06-22 10:51:24,999 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:51:24,999 INFO ]: Found specification of procedure h9 [2018-06-22 10:51:24,999 INFO ]: Found implementation of procedure h9 [2018-06-22 10:51:24,999 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:51:24,999 INFO ]: Found specification of procedure h8 [2018-06-22 10:51:24,999 INFO ]: Found implementation of procedure h8 [2018-06-22 10:51:24,999 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:51:24,999 INFO ]: Found specification of procedure h7 [2018-06-22 10:51:24,999 INFO ]: Found implementation of procedure h7 [2018-06-22 10:51:24,999 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:51:24,999 INFO ]: Found specification of procedure h6 [2018-06-22 10:51:24,999 INFO ]: Found implementation of procedure h6 [2018-06-22 10:51:25,000 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:51:25,000 INFO ]: Found specification of procedure h5 [2018-06-22 10:51:25,000 INFO ]: Found implementation of procedure h5 [2018-06-22 10:51:25,000 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:51:25,000 INFO ]: Found specification of procedure h4 [2018-06-22 10:51:25,000 INFO ]: Found implementation of procedure h4 [2018-06-22 10:51:25,000 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:51:25,000 INFO ]: Found specification of procedure h3 [2018-06-22 10:51:25,000 INFO ]: Found implementation of procedure h3 [2018-06-22 10:51:25,000 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:51:25,000 INFO ]: Found specification of procedure h2 [2018-06-22 10:51:25,000 INFO ]: Found implementation of procedure h2 [2018-06-22 10:51:25,000 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:51:25,000 INFO ]: Found specification of procedure h1 [2018-06-22 10:51:25,000 INFO ]: Found implementation of procedure h1 [2018-06-22 10:51:25,000 INFO ]: Specification and implementation of procedure h29 given in one single declaration [2018-06-22 10:51:25,000 INFO ]: Found specification of procedure h29 [2018-06-22 10:51:25,000 INFO ]: Found implementation of procedure h29 [2018-06-22 10:51:25,000 INFO ]: Specification and implementation of procedure h30 given in one single declaration [2018-06-22 10:51:25,000 INFO ]: Found specification of procedure h30 [2018-06-22 10:51:25,000 INFO ]: Found implementation of procedure h30 [2018-06-22 10:51:25,000 INFO ]: Specification and implementation of procedure h25 given in one single declaration [2018-06-22 10:51:25,000 INFO ]: Found specification of procedure h25 [2018-06-22 10:51:25,000 INFO ]: Found implementation of procedure h25 [2018-06-22 10:51:25,000 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:51:25,000 INFO ]: Found specification of procedure h23 [2018-06-22 10:51:25,000 INFO ]: Found implementation of procedure h23 [2018-06-22 10:51:25,000 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:51:25,000 INFO ]: Found specification of procedure h24 [2018-06-22 10:51:25,000 INFO ]: Found implementation of procedure h24 [2018-06-22 10:51:25,000 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:51:25,000 INFO ]: Found specification of procedure h19 [2018-06-22 10:51:25,000 INFO ]: Found implementation of procedure h19 [2018-06-22 10:51:25,000 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:51:25,000 INFO ]: Found specification of procedure h15 [2018-06-22 10:51:25,001 INFO ]: Found implementation of procedure h15 [2018-06-22 10:51:25,001 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:51:25,001 INFO ]: Found specification of procedure h14 [2018-06-22 10:51:25,001 INFO ]: Found implementation of procedure h14 [2018-06-22 10:51:25,001 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:51:25,003 INFO ]: Found specification of procedure h22 [2018-06-22 10:51:25,003 INFO ]: Found implementation of procedure h22 [2018-06-22 10:51:25,003 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:51:25,003 INFO ]: Found specification of procedure h21 [2018-06-22 10:51:25,003 INFO ]: Found implementation of procedure h21 [2018-06-22 10:51:25,003 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:51:25,003 INFO ]: Found specification of procedure h20 [2018-06-22 10:51:25,003 INFO ]: Found implementation of procedure h20 [2018-06-22 10:51:25,003 INFO ]: Specification and implementation of procedure h28 given in one single declaration [2018-06-22 10:51:25,003 INFO ]: Found specification of procedure h28 [2018-06-22 10:51:25,003 INFO ]: Found implementation of procedure h28 [2018-06-22 10:51:25,003 INFO ]: Specification and implementation of procedure h27 given in one single declaration [2018-06-22 10:51:25,003 INFO ]: Found specification of procedure h27 [2018-06-22 10:51:25,003 INFO ]: Found implementation of procedure h27 [2018-06-22 10:51:25,004 INFO ]: Specification and implementation of procedure h26 given in one single declaration [2018-06-22 10:51:25,004 INFO ]: Found specification of procedure h26 [2018-06-22 10:51:25,004 INFO ]: Found implementation of procedure h26 [2018-06-22 10:51:25,004 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:51:25,004 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:51:25,004 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:51:25,974 INFO ]: Using library mode [2018-06-22 10:51:25,975 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:51:25 BoogieIcfgContainer [2018-06-22 10:51:25,975 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:51:25,977 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:51:25,977 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:51:25,980 INFO ]: TraceAbstraction initialized [2018-06-22 10:51:25,980 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:51:24" (1/3) ... [2018-06-22 10:51:25,981 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b41905d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:51:25, skipping insertion in model container [2018-06-22 10:51:25,981 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:24" (2/3) ... [2018-06-22 10:51:25,981 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b41905d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:51:25, skipping insertion in model container [2018-06-22 10:51:25,981 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:51:25" (3/3) ... [2018-06-22 10:51:25,983 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:51:25,990 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:51:25,997 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:51:26,039 INFO ]: Using default assertion order modulation [2018-06-22 10:51:26,040 INFO ]: Interprodecural is true [2018-06-22 10:51:26,040 INFO ]: Hoare is false [2018-06-22 10:51:26,040 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:51:26,040 INFO ]: Backedges is TWOTRACK [2018-06-22 10:51:26,040 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:51:26,040 INFO ]: Difference is false [2018-06-22 10:51:26,040 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:51:26,040 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:51:26,060 INFO ]: Start isEmpty. Operand 141 states. [2018-06-22 10:51:26,078 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:51:26,078 INFO ]: Found error trace [2018-06-22 10:51:26,079 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] [2018-06-22 10:51:26,079 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:26,085 INFO ]: Analyzing trace with hash 1270016506, now seen corresponding path program 1 times [2018-06-22 10:51:26,087 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:26,087 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:26,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:26,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:26,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:26,255 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:27,168 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:51:27,170 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:27,193 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:51:27,195 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:51:27,211 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:51:27,212 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:51:27,216 INFO ]: Start difference. First operand 141 states. Second operand 12 states. [2018-06-22 10:51:27,709 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:27,709 INFO ]: Finished difference Result 143 states and 152 transitions. [2018-06-22 10:51:27,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:51:27,711 INFO ]: Start accepts. Automaton has 12 states. Word has length 77 [2018-06-22 10:51:27,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:27,722 INFO ]: With dead ends: 143 [2018-06-22 10:51:27,722 INFO ]: Without dead ends: 143 [2018-06-22 10:51:27,724 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:51:27,738 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-22 10:51:27,774 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-06-22 10:51:27,775 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-22 10:51:27,778 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-06-22 10:51:27,779 INFO ]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 77 [2018-06-22 10:51:27,780 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:27,780 INFO ]: Abstraction has 143 states and 152 transitions. [2018-06-22 10:51:27,780 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:51:27,780 INFO ]: Start isEmpty. Operand 143 states and 152 transitions. [2018-06-22 10:51:27,786 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:51:27,786 INFO ]: Found error trace [2018-06-22 10:51:27,786 INFO ]: trace histogram [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] [2018-06-22 10:51:27,786 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:27,786 INFO ]: Analyzing trace with hash 911419306, now seen corresponding path program 1 times [2018-06-22 10:51:27,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:27,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:27,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:27,787 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:27,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:27,823 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:28,085 WARN ]: Spent 166.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:51:28,297 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:28,297 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:28,297 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 10:51:28,301 INFO ]: Interpolant automaton has 5 states [2018-06-22 10:51:28,301 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 10:51:28,301 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:51:28,301 INFO ]: Start difference. First operand 143 states and 152 transitions. Second operand 5 states. [2018-06-22 10:51:28,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:28,538 INFO ]: Finished difference Result 145 states and 155 transitions. [2018-06-22 10:51:28,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:51:28,540 INFO ]: Start accepts. Automaton has 5 states. Word has length 117 [2018-06-22 10:51:28,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:28,542 INFO ]: With dead ends: 145 [2018-06-22 10:51:28,542 INFO ]: Without dead ends: 145 [2018-06-22 10:51:28,543 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:51:28,543 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-22 10:51:28,558 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-06-22 10:51:28,558 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-22 10:51:28,560 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-06-22 10:51:28,560 INFO ]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 117 [2018-06-22 10:51:28,561 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:28,561 INFO ]: Abstraction has 145 states and 155 transitions. [2018-06-22 10:51:28,561 INFO ]: Interpolant automaton has 5 states. [2018-06-22 10:51:28,561 INFO ]: Start isEmpty. Operand 145 states and 155 transitions. [2018-06-22 10:51:28,564 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:51:28,564 INFO ]: Found error trace [2018-06-22 10:51:28,564 INFO ]: trace histogram [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] [2018-06-22 10:51:28,564 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:28,565 INFO ]: Analyzing trace with hash 1830201844, now seen corresponding path program 1 times [2018-06-22 10:51:28,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:28,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:28,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:28,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:28,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:28,628 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:29,779 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:29,779 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:29,779 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 10:51:29,795 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:51:30,005 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:30,031 INFO ]: Computing forward predicates... [2018-06-22 10:51:32,022 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:32,056 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:51:32,056 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 62 [2018-06-22 10:51:32,057 INFO ]: Interpolant automaton has 62 states [2018-06-22 10:51:32,057 INFO ]: Constructing interpolant automaton starting with 62 interpolants. [2018-06-22 10:51:32,059 INFO ]: CoverageRelationStatistics Valid=136, Invalid=3646, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 10:51:32,059 INFO ]: Start difference. First operand 145 states and 155 transitions. Second operand 62 states. [2018-06-22 10:51:34,695 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:34,696 INFO ]: Finished difference Result 173 states and 187 transitions. [2018-06-22 10:51:34,696 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 10:51:34,696 INFO ]: Start accepts. Automaton has 62 states. Word has length 117 [2018-06-22 10:51:34,697 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:34,699 INFO ]: With dead ends: 173 [2018-06-22 10:51:34,699 INFO ]: Without dead ends: 165 [2018-06-22 10:51:34,703 INFO ]: 0 DeclaredPredicates, 165 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=211, Invalid=5951, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 10:51:34,703 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-22 10:51:34,719 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-06-22 10:51:34,719 INFO ]: Start removeUnreachable. Operand 165 states. [2018-06-22 10:51:34,725 INFO ]: Finished removeUnreachable. Reduced from 165 states to 165 states and 179 transitions. [2018-06-22 10:51:34,726 INFO ]: Start accepts. Automaton has 165 states and 179 transitions. Word has length 117 [2018-06-22 10:51:34,726 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:34,726 INFO ]: Abstraction has 165 states and 179 transitions. [2018-06-22 10:51:34,726 INFO ]: Interpolant automaton has 62 states. [2018-06-22 10:51:34,726 INFO ]: Start isEmpty. Operand 165 states and 179 transitions. [2018-06-22 10:51:34,729 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:51:34,729 INFO ]: Found error trace [2018-06-22 10:51:34,729 INFO ]: trace histogram [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] [2018-06-22 10:51:34,730 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:34,730 INFO ]: Analyzing trace with hash -933165650, now seen corresponding path program 1 times [2018-06-22 10:51:34,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:34,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:34,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:34,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:34,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:34,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:34,888 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:34,888 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:34,888 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 10:51:34,889 INFO ]: Interpolant automaton has 5 states [2018-06-22 10:51:34,889 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 10:51:34,889 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:51:34,889 INFO ]: Start difference. First operand 165 states and 179 transitions. Second operand 5 states. [2018-06-22 10:51:34,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:34,913 INFO ]: Finished difference Result 163 states and 175 transitions. [2018-06-22 10:51:34,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:51:34,914 INFO ]: Start accepts. Automaton has 5 states. Word has length 117 [2018-06-22 10:51:34,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:34,916 INFO ]: With dead ends: 163 [2018-06-22 10:51:34,916 INFO ]: Without dead ends: 160 [2018-06-22 10:51:34,917 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:51:34,917 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-22 10:51:34,931 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-06-22 10:51:34,931 INFO ]: Start removeUnreachable. Operand 158 states. [2018-06-22 10:51:34,933 INFO ]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-06-22 10:51:34,933 INFO ]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 117 [2018-06-22 10:51:34,933 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:34,933 INFO ]: Abstraction has 158 states and 168 transitions. [2018-06-22 10:51:34,933 INFO ]: Interpolant automaton has 5 states. [2018-06-22 10:51:34,933 INFO ]: Start isEmpty. Operand 158 states and 168 transitions. [2018-06-22 10:51:34,935 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:51:34,935 INFO ]: Found error trace [2018-06-22 10:51:34,935 INFO ]: trace histogram [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] [2018-06-22 10:51:34,935 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:34,935 INFO ]: Analyzing trace with hash 585817549, now seen corresponding path program 1 times [2018-06-22 10:51:34,936 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:34,936 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:34,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:34,936 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:34,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:34,953 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:35,014 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:35,014 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:35,014 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 10:51:35,015 INFO ]: Interpolant automaton has 5 states [2018-06-22 10:51:35,015 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 10:51:35,015 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:51:35,015 INFO ]: Start difference. First operand 158 states and 168 transitions. Second operand 5 states. [2018-06-22 10:51:35,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:35,038 INFO ]: Finished difference Result 160 states and 169 transitions. [2018-06-22 10:51:35,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:51:35,038 INFO ]: Start accepts. Automaton has 5 states. Word has length 117 [2018-06-22 10:51:35,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:35,040 INFO ]: With dead ends: 160 [2018-06-22 10:51:35,040 INFO ]: Without dead ends: 160 [2018-06-22 10:51:35,040 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:51:35,041 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-22 10:51:35,064 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-06-22 10:51:35,064 INFO ]: Start removeUnreachable. Operand 160 states. [2018-06-22 10:51:35,066 INFO ]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-06-22 10:51:35,066 INFO ]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 117 [2018-06-22 10:51:35,066 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:35,066 INFO ]: Abstraction has 160 states and 169 transitions. [2018-06-22 10:51:35,066 INFO ]: Interpolant automaton has 5 states. [2018-06-22 10:51:35,066 INFO ]: Start isEmpty. Operand 160 states and 169 transitions. [2018-06-22 10:51:35,069 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:51:35,069 INFO ]: Found error trace [2018-06-22 10:51:35,069 INFO ]: trace histogram [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] [2018-06-22 10:51:35,069 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:35,069 INFO ]: Analyzing trace with hash -1142963759, now seen corresponding path program 1 times [2018-06-22 10:51:35,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:35,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:35,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:35,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:35,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:35,099 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:36,399 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:36,399 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:36,399 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:51:36,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:36,569 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:36,589 INFO ]: Computing forward predicates... [2018-06-22 10:51:37,960 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:37,980 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:51:37,980 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 62 [2018-06-22 10:51:37,980 INFO ]: Interpolant automaton has 62 states [2018-06-22 10:51:37,981 INFO ]: Constructing interpolant automaton starting with 62 interpolants. [2018-06-22 10:51:37,981 INFO ]: CoverageRelationStatistics Valid=136, Invalid=3646, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 10:51:37,981 INFO ]: Start difference. First operand 160 states and 169 transitions. Second operand 62 states. [2018-06-22 10:51:40,144 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:40,144 INFO ]: Finished difference Result 182 states and 191 transitions. [2018-06-22 10:51:40,145 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 10:51:40,145 INFO ]: Start accepts. Automaton has 62 states. Word has length 117 [2018-06-22 10:51:40,145 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:40,146 INFO ]: With dead ends: 182 [2018-06-22 10:51:40,146 INFO ]: Without dead ends: 174 [2018-06-22 10:51:40,148 INFO ]: 0 DeclaredPredicates, 165 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=211, Invalid=5951, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 10:51:40,148 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-22 10:51:40,162 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 162. [2018-06-22 10:51:40,162 INFO ]: Start removeUnreachable. Operand 162 states. [2018-06-22 10:51:40,163 INFO ]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2018-06-22 10:51:40,163 INFO ]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 117 [2018-06-22 10:51:40,164 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:40,164 INFO ]: Abstraction has 162 states and 171 transitions. [2018-06-22 10:51:40,164 INFO ]: Interpolant automaton has 62 states. [2018-06-22 10:51:40,164 INFO ]: Start isEmpty. Operand 162 states and 171 transitions. [2018-06-22 10:51:40,165 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:51:40,165 INFO ]: Found error trace [2018-06-22 10:51:40,165 INFO ]: trace histogram [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] [2018-06-22 10:51:40,165 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:40,165 INFO ]: Analyzing trace with hash -542763098, now seen corresponding path program 1 times [2018-06-22 10:51:40,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:40,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:40,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:40,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:40,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:40,195 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:40,798 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:40,798 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:40,798 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:51:40,807 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:40,914 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:40,924 INFO ]: Computing forward predicates... [2018-06-22 10:51:42,227 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:42,247 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:51:42,247 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 62 [2018-06-22 10:51:42,247 INFO ]: Interpolant automaton has 62 states [2018-06-22 10:51:42,248 INFO ]: Constructing interpolant automaton starting with 62 interpolants. [2018-06-22 10:51:42,249 INFO ]: CoverageRelationStatistics Valid=136, Invalid=3646, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 10:51:42,249 INFO ]: Start difference. First operand 162 states and 171 transitions. Second operand 62 states. [2018-06-22 10:51:43,928 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:43,929 INFO ]: Finished difference Result 184 states and 194 transitions. [2018-06-22 10:51:43,929 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 10:51:43,929 INFO ]: Start accepts. Automaton has 62 states. Word has length 117 [2018-06-22 10:51:43,929 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:43,930 INFO ]: With dead ends: 184 [2018-06-22 10:51:43,930 INFO ]: Without dead ends: 176 [2018-06-22 10:51:43,932 INFO ]: 0 DeclaredPredicates, 165 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=211, Invalid=5951, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 10:51:43,932 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-22 10:51:43,946 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-06-22 10:51:43,946 INFO ]: Start removeUnreachable. Operand 172 states. [2018-06-22 10:51:43,947 INFO ]: Finished removeUnreachable. Reduced from 172 states to 172 states and 182 transitions. [2018-06-22 10:51:43,947 INFO ]: Start accepts. Automaton has 172 states and 182 transitions. Word has length 117 [2018-06-22 10:51:43,948 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:43,948 INFO ]: Abstraction has 172 states and 182 transitions. [2018-06-22 10:51:43,948 INFO ]: Interpolant automaton has 62 states. [2018-06-22 10:51:43,948 INFO ]: Start isEmpty. Operand 172 states and 182 transitions. [2018-06-22 10:51:43,950 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:51:43,950 INFO ]: Found error trace [2018-06-22 10:51:43,950 INFO ]: trace histogram [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] [2018-06-22 10:51:43,950 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:43,950 INFO ]: Analyzing trace with hash 701621197, now seen corresponding path program 1 times [2018-06-22 10:51:43,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:43,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:43,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:43,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:43,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:43,968 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:44,213 WARN ]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-22 10:51:44,325 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:44,325 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:44,325 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 10:51:44,325 INFO ]: Interpolant automaton has 5 states [2018-06-22 10:51:44,325 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 10:51:44,325 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:51:44,326 INFO ]: Start difference. First operand 172 states and 182 transitions. Second operand 5 states. [2018-06-22 10:51:44,343 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:44,343 INFO ]: Finished difference Result 172 states and 180 transitions. [2018-06-22 10:51:44,343 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:51:44,343 INFO ]: Start accepts. Automaton has 5 states. Word has length 117 [2018-06-22 10:51:44,343 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:44,345 INFO ]: With dead ends: 172 [2018-06-22 10:51:44,345 INFO ]: Without dead ends: 172 [2018-06-22 10:51:44,345 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:51:44,345 INFO ]: Start minimizeSevpa. Operand 172 states. [2018-06-22 10:51:44,353 INFO ]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-06-22 10:51:44,353 INFO ]: Start removeUnreachable. Operand 172 states. [2018-06-22 10:51:44,354 INFO ]: Finished removeUnreachable. Reduced from 172 states to 172 states and 180 transitions. [2018-06-22 10:51:44,354 INFO ]: Start accepts. Automaton has 172 states and 180 transitions. Word has length 117 [2018-06-22 10:51:44,355 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:44,355 INFO ]: Abstraction has 172 states and 180 transitions. [2018-06-22 10:51:44,355 INFO ]: Interpolant automaton has 5 states. [2018-06-22 10:51:44,355 INFO ]: Start isEmpty. Operand 172 states and 180 transitions. [2018-06-22 10:51:44,359 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:51:44,359 INFO ]: Found error trace [2018-06-22 10:51:44,359 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:44,359 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:44,360 INFO ]: Analyzing trace with hash -1698295826, now seen corresponding path program 2 times [2018-06-22 10:51:44,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:44,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:44,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:44,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:44,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:44,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:45,426 INFO ]: Checked inductivity of 54 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:51:45,426 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:45,427 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:51:45,432 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:51:45,661 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:51:45,661 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:45,679 INFO ]: Computing forward predicates... [2018-06-22 10:51:47,721 INFO ]: Checked inductivity of 54 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:51:47,742 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:51:47,742 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 79 [2018-06-22 10:51:47,742 INFO ]: Interpolant automaton has 79 states [2018-06-22 10:51:47,743 INFO ]: Constructing interpolant automaton starting with 79 interpolants. [2018-06-22 10:51:47,744 INFO ]: CoverageRelationStatistics Valid=191, Invalid=5971, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 10:51:47,744 INFO ]: Start difference. First operand 172 states and 180 transitions. Second operand 79 states. [2018-06-22 10:51:50,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:50,009 INFO ]: Finished difference Result 212 states and 222 transitions. [2018-06-22 10:51:50,009 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 10:51:50,010 INFO ]: Start accepts. Automaton has 79 states. Word has length 157 [2018-06-22 10:51:50,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:50,011 INFO ]: With dead ends: 212 [2018-06-22 10:51:50,011 INFO ]: Without dead ends: 204 [2018-06-22 10:51:50,013 INFO ]: 0 DeclaredPredicates, 224 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1876 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=338, Invalid=10374, Unknown=0, NotChecked=0, Total=10712 [2018-06-22 10:51:50,013 INFO ]: Start minimizeSevpa. Operand 204 states. [2018-06-22 10:51:50,022 INFO ]: Finished minimizeSevpa. Reduced states from 204 to 190. [2018-06-22 10:51:50,022 INFO ]: Start removeUnreachable. Operand 190 states. [2018-06-22 10:51:50,023 INFO ]: Finished removeUnreachable. Reduced from 190 states to 190 states and 200 transitions. [2018-06-22 10:51:50,023 INFO ]: Start accepts. Automaton has 190 states and 200 transitions. Word has length 157 [2018-06-22 10:51:50,024 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:50,024 INFO ]: Abstraction has 190 states and 200 transitions. [2018-06-22 10:51:50,025 INFO ]: Interpolant automaton has 79 states. [2018-06-22 10:51:50,025 INFO ]: Start isEmpty. Operand 190 states and 200 transitions. [2018-06-22 10:51:50,027 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:51:50,027 INFO ]: Found error trace [2018-06-22 10:51:50,027 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:50,027 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:50,027 INFO ]: Analyzing trace with hash 1224187595, now seen corresponding path program 1 times [2018-06-22 10:51:50,027 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:50,027 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:50,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:50,028 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:51:50,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:50,054 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:50,833 INFO ]: Checked inductivity of 49 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 10:51:50,833 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:50,833 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:51:50,834 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:51:50,834 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:51:50,834 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:51:50,834 INFO ]: Start difference. First operand 190 states and 200 transitions. Second operand 13 states. [2018-06-22 10:51:50,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:50,994 INFO ]: Finished difference Result 249 states and 283 transitions. [2018-06-22 10:51:50,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:51:50,994 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:51:50,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:50,996 INFO ]: With dead ends: 249 [2018-06-22 10:51:50,996 INFO ]: Without dead ends: 243 [2018-06-22 10:51:50,996 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:51:50,996 INFO ]: Start minimizeSevpa. Operand 243 states. [2018-06-22 10:51:51,009 INFO ]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-06-22 10:51:51,009 INFO ]: Start removeUnreachable. Operand 241 states. [2018-06-22 10:51:51,011 INFO ]: Finished removeUnreachable. Reduced from 241 states to 241 states and 271 transitions. [2018-06-22 10:51:51,011 INFO ]: Start accepts. Automaton has 241 states and 271 transitions. Word has length 157 [2018-06-22 10:51:51,011 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:51,011 INFO ]: Abstraction has 241 states and 271 transitions. [2018-06-22 10:51:51,011 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:51:51,011 INFO ]: Start isEmpty. Operand 241 states and 271 transitions. [2018-06-22 10:51:51,013 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:51:51,013 INFO ]: Found error trace [2018-06-22 10:51:51,013 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:51,013 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:51,013 INFO ]: Analyzing trace with hash -145021400, now seen corresponding path program 2 times [2018-06-22 10:51:51,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:51,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:51,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:51,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:51,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:51,040 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:52,067 INFO ]: Checked inductivity of 54 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:51:52,068 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:52,068 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:51:52,082 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:51:52,238 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:51:52,238 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:52,253 INFO ]: Computing forward predicates... [2018-06-22 10:51:53,956 INFO ]: Checked inductivity of 54 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:51:53,977 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:51:53,981 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 79 [2018-06-22 10:51:53,982 INFO ]: Interpolant automaton has 79 states [2018-06-22 10:51:53,982 INFO ]: Constructing interpolant automaton starting with 79 interpolants. [2018-06-22 10:51:53,984 INFO ]: CoverageRelationStatistics Valid=191, Invalid=5971, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 10:51:53,984 INFO ]: Start difference. First operand 241 states and 271 transitions. Second operand 79 states. [2018-06-22 10:51:56,488 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:56,488 INFO ]: Finished difference Result 273 states and 304 transitions. [2018-06-22 10:51:56,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 10:51:56,489 INFO ]: Start accepts. Automaton has 79 states. Word has length 157 [2018-06-22 10:51:56,490 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:56,492 INFO ]: With dead ends: 273 [2018-06-22 10:51:56,492 INFO ]: Without dead ends: 265 [2018-06-22 10:51:56,494 INFO ]: 0 DeclaredPredicates, 224 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1876 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=338, Invalid=10374, Unknown=0, NotChecked=0, Total=10712 [2018-06-22 10:51:56,494 INFO ]: Start minimizeSevpa. Operand 265 states. [2018-06-22 10:51:56,507 INFO ]: Finished minimizeSevpa. Reduced states from 265 to 251. [2018-06-22 10:51:56,507 INFO ]: Start removeUnreachable. Operand 251 states. [2018-06-22 10:51:56,509 INFO ]: Finished removeUnreachable. Reduced from 251 states to 251 states and 282 transitions. [2018-06-22 10:51:56,509 INFO ]: Start accepts. Automaton has 251 states and 282 transitions. Word has length 157 [2018-06-22 10:51:56,510 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:56,510 INFO ]: Abstraction has 251 states and 282 transitions. [2018-06-22 10:51:56,510 INFO ]: Interpolant automaton has 79 states. [2018-06-22 10:51:56,510 INFO ]: Start isEmpty. Operand 251 states and 282 transitions. [2018-06-22 10:51:56,511 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:51:56,511 INFO ]: Found error trace [2018-06-22 10:51:56,512 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:56,512 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:56,516 INFO ]: Analyzing trace with hash -2100539139, now seen corresponding path program 1 times [2018-06-22 10:51:56,516 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:56,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:56,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:56,516 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:51:56,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:56,535 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:57,520 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 10:51:57,520 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:57,520 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:51:57,521 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:51:57,521 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:51:57,521 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:51:57,521 INFO ]: Start difference. First operand 251 states and 282 transitions. Second operand 13 states. [2018-06-22 10:51:57,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:57,689 INFO ]: Finished difference Result 338 states and 392 transitions. [2018-06-22 10:51:57,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:51:57,690 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:51:57,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:57,692 INFO ]: With dead ends: 338 [2018-06-22 10:51:57,692 INFO ]: Without dead ends: 265 [2018-06-22 10:51:57,692 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:51:57,693 INFO ]: Start minimizeSevpa. Operand 265 states. [2018-06-22 10:51:57,708 INFO ]: Finished minimizeSevpa. Reduced states from 265 to 263. [2018-06-22 10:51:57,708 INFO ]: Start removeUnreachable. Operand 263 states. [2018-06-22 10:51:57,710 INFO ]: Finished removeUnreachable. Reduced from 263 states to 263 states and 300 transitions. [2018-06-22 10:51:57,710 INFO ]: Start accepts. Automaton has 263 states and 300 transitions. Word has length 157 [2018-06-22 10:51:57,711 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:57,711 INFO ]: Abstraction has 263 states and 300 transitions. [2018-06-22 10:51:57,711 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:51:57,711 INFO ]: Start isEmpty. Operand 263 states and 300 transitions. [2018-06-22 10:51:57,714 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:51:57,714 INFO ]: Found error trace [2018-06-22 10:51:57,715 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:57,715 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:57,715 INFO ]: Analyzing trace with hash 1280993874, now seen corresponding path program 2 times [2018-06-22 10:51:57,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:57,715 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:57,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:57,715 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:57,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:57,748 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:58,676 INFO ]: Checked inductivity of 54 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 10:51:58,676 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:58,676 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:51:58,701 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:51:58,854 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:51:58,854 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:58,865 INFO ]: Computing forward predicates... [2018-06-22 10:52:00,531 INFO ]: Checked inductivity of 54 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:52:00,551 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:52:00,551 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42] total 80 [2018-06-22 10:52:00,551 INFO ]: Interpolant automaton has 80 states [2018-06-22 10:52:00,551 INFO ]: Constructing interpolant automaton starting with 80 interpolants. [2018-06-22 10:52:00,552 INFO ]: CoverageRelationStatistics Valid=194, Invalid=6126, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 10:52:00,552 INFO ]: Start difference. First operand 263 states and 300 transitions. Second operand 80 states. [2018-06-22 10:52:02,580 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:02,580 INFO ]: Finished difference Result 311 states and 350 transitions. [2018-06-22 10:52:02,582 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 10:52:02,582 INFO ]: Start accepts. Automaton has 80 states. Word has length 157 [2018-06-22 10:52:02,582 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:02,583 INFO ]: With dead ends: 311 [2018-06-22 10:52:02,583 INFO ]: Without dead ends: 303 [2018-06-22 10:52:02,585 INFO ]: 0 DeclaredPredicates, 224 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=343, Invalid=10577, Unknown=0, NotChecked=0, Total=10920 [2018-06-22 10:52:02,585 INFO ]: Start minimizeSevpa. Operand 303 states. [2018-06-22 10:52:02,598 INFO ]: Finished minimizeSevpa. Reduced states from 303 to 265. [2018-06-22 10:52:02,598 INFO ]: Start removeUnreachable. Operand 265 states. [2018-06-22 10:52:02,600 INFO ]: Finished removeUnreachable. Reduced from 265 states to 265 states and 302 transitions. [2018-06-22 10:52:02,600 INFO ]: Start accepts. Automaton has 265 states and 302 transitions. Word has length 157 [2018-06-22 10:52:02,600 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:02,600 INFO ]: Abstraction has 265 states and 302 transitions. [2018-06-22 10:52:02,600 INFO ]: Interpolant automaton has 80 states. [2018-06-22 10:52:02,600 INFO ]: Start isEmpty. Operand 265 states and 302 transitions. [2018-06-22 10:52:02,603 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:52:02,603 INFO ]: Found error trace [2018-06-22 10:52:02,603 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:02,603 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:02,603 INFO ]: Analyzing trace with hash 314028192, now seen corresponding path program 1 times [2018-06-22 10:52:02,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:02,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:02,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:02,604 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:52:02,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:02,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:02,842 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-22 10:52:03,359 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 10:52:03,359 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:03,359 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:52:03,359 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:52:03,359 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:52:03,359 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:03,359 INFO ]: Start difference. First operand 265 states and 302 transitions. Second operand 13 states. [2018-06-22 10:52:03,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:03,560 INFO ]: Finished difference Result 299 states and 338 transitions. [2018-06-22 10:52:03,560 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:52:03,561 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:52:03,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:03,562 INFO ]: With dead ends: 299 [2018-06-22 10:52:03,562 INFO ]: Without dead ends: 268 [2018-06-22 10:52:03,563 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 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:52:03,563 INFO ]: Start minimizeSevpa. Operand 268 states. [2018-06-22 10:52:03,574 INFO ]: Finished minimizeSevpa. Reduced states from 268 to 238. [2018-06-22 10:52:03,574 INFO ]: Start removeUnreachable. Operand 238 states. [2018-06-22 10:52:03,576 INFO ]: Finished removeUnreachable. Reduced from 238 states to 238 states and 264 transitions. [2018-06-22 10:52:03,576 INFO ]: Start accepts. Automaton has 238 states and 264 transitions. Word has length 157 [2018-06-22 10:52:03,576 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:03,576 INFO ]: Abstraction has 238 states and 264 transitions. [2018-06-22 10:52:03,576 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:52:03,576 INFO ]: Start isEmpty. Operand 238 states and 264 transitions. [2018-06-22 10:52:03,577 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:52:03,577 INFO ]: Found error trace [2018-06-22 10:52:03,577 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:03,578 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:03,578 INFO ]: Analyzing trace with hash -1058455683, now seen corresponding path program 2 times [2018-06-22 10:52:03,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:03,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:03,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:03,578 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:03,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:03,597 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:03,806 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:52:03,929 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 10:52:03,929 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:03,929 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:52:03,929 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:52:03,929 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:52:03,929 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:03,929 INFO ]: Start difference. First operand 238 states and 264 transitions. Second operand 13 states. [2018-06-22 10:52:04,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:04,501 INFO ]: Finished difference Result 228 states and 251 transitions. [2018-06-22 10:52:04,502 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:52:04,502 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:52:04,502 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:04,503 INFO ]: With dead ends: 228 [2018-06-22 10:52:04,503 INFO ]: Without dead ends: 175 [2018-06-22 10:52:04,503 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:04,503 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-22 10:52:04,513 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 169. [2018-06-22 10:52:04,513 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-22 10:52:04,514 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 179 transitions. [2018-06-22 10:52:04,514 INFO ]: Start accepts. Automaton has 169 states and 179 transitions. Word has length 157 [2018-06-22 10:52:04,514 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:04,514 INFO ]: Abstraction has 169 states and 179 transitions. [2018-06-22 10:52:04,514 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:52:04,514 INFO ]: Start isEmpty. Operand 169 states and 179 transitions. [2018-06-22 10:52:04,515 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:52:04,515 INFO ]: Found error trace [2018-06-22 10:52:04,516 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:04,516 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:04,516 INFO ]: Analyzing trace with hash -731330144, now seen corresponding path program 2 times [2018-06-22 10:52:04,516 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:04,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:04,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:04,516 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:52:04,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:04,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:05,911 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 10:52:05,911 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:05,911 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:52:05,911 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:52:05,911 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:52:05,911 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:05,912 INFO ]: Start difference. First operand 169 states and 179 transitions. Second operand 13 states. [2018-06-22 10:52:06,043 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:06,043 INFO ]: Finished difference Result 145 states and 152 transitions. [2018-06-22 10:52:06,045 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:52:06,045 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 10:52:06,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:06,046 INFO ]: With dead ends: 145 [2018-06-22 10:52:06,046 INFO ]: Without dead ends: 0 [2018-06-22 10:52:06,046 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:06,046 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 10:52:06,046 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 10:52:06,046 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 10:52:06,046 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 10:52:06,046 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 157 [2018-06-22 10:52:06,046 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:06,046 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 10:52:06,046 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:52:06,046 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 10:52:06,046 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 10:52:06,186 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:52:06 BoogieIcfgContainer [2018-06-22 10:52:06,186 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:52:06,187 INFO ]: Toolchain (without parser) took 41352.13 ms. Allocated memory was 306.7 MB in the beginning and 1.0 GB in the end (delta: 696.3 MB). Free memory was 230.0 MB in the beginning and 965.9 MB in the end (delta: -735.9 MB). Peak memory consumption was 554.4 MB. Max. memory is 3.6 GB. [2018-06-22 10:52:06,188 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:52:06,188 INFO ]: ChcToBoogie took 78.47 ms. Allocated memory is still 306.7 MB. Free memory was 230.0 MB in the beginning and 227.1 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:52:06,188 INFO ]: Boogie Preprocessor took 62.21 ms. Allocated memory is still 306.7 MB. Free memory was 227.1 MB in the beginning and 225.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:52:06,188 INFO ]: RCFGBuilder took 993.34 ms. Allocated memory was 306.7 MB in the beginning and 325.6 MB in the end (delta: 18.9 MB). Free memory was 225.1 MB in the beginning and 293.7 MB in the end (delta: -68.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 3.6 GB. [2018-06-22 10:52:06,189 INFO ]: TraceAbstraction took 40209.74 ms. Allocated memory was 325.6 MB in the beginning and 1.0 GB in the end (delta: 677.4 MB). Free memory was 293.7 MB in the beginning and 965.9 MB in the end (delta: -672.3 MB). Peak memory consumption was 599.2 MB. Max. memory is 3.6 GB. [2018-06-22 10:52:06,191 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 78.47 ms. Allocated memory is still 306.7 MB. Free memory was 230.0 MB in the beginning and 227.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 62.21 ms. Allocated memory is still 306.7 MB. Free memory was 227.1 MB in the beginning and 225.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 993.34 ms. Allocated memory was 306.7 MB in the beginning and 325.6 MB in the end (delta: 18.9 MB). Free memory was 225.1 MB in the beginning and 293.7 MB in the end (delta: -68.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 40209.74 ms. Allocated memory was 325.6 MB in the beginning and 1.0 GB in the end (delta: 677.4 MB). Free memory was 293.7 MB in the beginning and 965.9 MB in the end (delta: -672.3 MB). Peak memory consumption was 599.2 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 34 procedures, 141 locations, 1 error locations. SAFE Result, 40.1s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2252 SDtfs, 116 SDslu, 53830 SDs, 0 SdLazy, 13879 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1275 GetRequests, 649 SyntacticMatches, 11 SemanticMatches, 615 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7239 ImplicationChecksByTransitivity, 24.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=13, 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.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 124 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 2974 NumberOfCodeBlocks, 2974 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2952 ConstructedInterpolants, 0 QuantifiedInterpolants, 1175592 SizeOfPredicates, 33 NumberOfNonLiveVariables, 8343 ConjunctsInSsa, 474 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 503/587 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/21.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-52-06-200.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/21.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-52-06-200.csv Received shutdown request...