/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 02:24:58,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 02:24:58,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 02:24:59,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 02:24:59,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 02:24:59,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 02:24:59,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 02:24:59,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 02:24:59,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 02:24:59,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 02:24:59,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 02:24:59,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 02:24:59,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 02:24:59,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 02:24:59,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 02:24:59,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 02:24:59,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 02:24:59,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 02:24:59,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 02:24:59,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 02:24:59,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 02:24:59,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 02:24:59,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 02:24:59,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 02:24:59,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 02:24:59,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 02:24:59,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 02:24:59,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 02:24:59,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 02:24:59,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 02:24:59,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 02:24:59,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 02:24:59,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 02:24:59,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 02:24:59,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 02:24:59,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 02:24:59,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 02:24:59,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 02:24:59,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 02:24:59,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 02:24:59,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 02:24:59,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 02:24:59,101 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 02:24:59,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 02:24:59,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 02:24:59,104 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 02:24:59,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 02:24:59,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 02:24:59,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 02:24:59,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 02:24:59,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 02:24:59,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 02:24:59,108 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 02:24:59,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 02:24:59,109 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 02:24:59,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 02:24:59,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 02:24:59,110 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 02:24:59,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 02:24:59,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 02:24:59,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:24:59,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 02:24:59,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 02:24:59,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 02:24:59,111 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 02:24:59,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 02:24:59,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 02:24:59,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 02:24:59,598 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 02:24:59,598 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 02:24:59,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-10-24 02:24:59,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d9ebba1/868c469289f440669e6aa5f607361ada/FLAG4aaeb94c9 [2020-10-24 02:25:00,474 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 02:25:00,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-10-24 02:25:00,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d9ebba1/868c469289f440669e6aa5f607361ada/FLAG4aaeb94c9 [2020-10-24 02:25:00,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d9ebba1/868c469289f440669e6aa5f607361ada [2020-10-24 02:25:00,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 02:25:00,811 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 02:25:00,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 02:25:00,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 02:25:00,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 02:25:00,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:25:00" (1/1) ... [2020-10-24 02:25:00,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29676c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:25:00, skipping insertion in model container [2020-10-24 02:25:00,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:25:00" (1/1) ... [2020-10-24 02:25:00,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 02:25:00,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 02:25:01,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:25:01,058 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 02:25:01,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:25:01,115 INFO L208 MainTranslator]: Completed translation [2020-10-24 02:25:01,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:25:01 WrapperNode [2020-10-24 02:25:01,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 02:25:01,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 02:25:01,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 02:25:01,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 02:25:01,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:25:01" (1/1) ... [2020-10-24 02:25:01,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:25:01" (1/1) ... [2020-10-24 02:25:01,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:25:01" (1/1) ... [2020-10-24 02:25:01,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:25:01" (1/1) ... [2020-10-24 02:25:01,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:25:01" (1/1) ... [2020-10-24 02:25:01,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:25:01" (1/1) ... [2020-10-24 02:25:01,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:25:01" (1/1) ... [2020-10-24 02:25:01,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 02:25:01,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 02:25:01,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 02:25:01,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 02:25:01,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:25:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:25:01,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 02:25:01,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 02:25:01,264 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 02:25:01,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-24 02:25:01,264 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2020-10-24 02:25:01,264 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2020-10-24 02:25:01,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 02:25:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 02:25:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 02:25:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-24 02:25:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-24 02:25:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 02:25:01,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 02:25:01,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-24 02:25:01,266 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2020-10-24 02:25:01,266 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2020-10-24 02:25:01,267 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2020-10-24 02:25:01,267 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-10-24 02:25:01,267 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2020-10-24 02:25:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2020-10-24 02:25:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2020-10-24 02:25:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2020-10-24 02:25:01,270 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2020-10-24 02:25:01,270 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2020-10-24 02:25:01,270 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-10-24 02:25:01,270 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2020-10-24 02:25:01,270 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2020-10-24 02:25:01,270 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-10-24 02:25:01,271 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2020-10-24 02:25:01,271 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2020-10-24 02:25:01,271 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2020-10-24 02:25:01,271 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2020-10-24 02:25:01,271 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2020-10-24 02:25:01,271 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2020-10-24 02:25:01,272 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2020-10-24 02:25:01,272 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2020-10-24 02:25:01,272 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2020-10-24 02:25:01,272 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2020-10-24 02:25:01,272 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2020-10-24 02:25:01,272 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2020-10-24 02:25:01,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 02:25:01,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 02:25:01,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 02:25:01,273 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 02:25:01,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 02:25:01,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 02:25:01,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 02:25:01,884 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 02:25:01,884 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-10-24 02:25:01,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:25:01 BoogieIcfgContainer [2020-10-24 02:25:01,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 02:25:01,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 02:25:01,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 02:25:01,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 02:25:01,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:25:00" (1/3) ... [2020-10-24 02:25:01,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7843e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:25:01, skipping insertion in model container [2020-10-24 02:25:01,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:25:01" (2/3) ... [2020-10-24 02:25:01,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7843e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:25:01, skipping insertion in model container [2020-10-24 02:25:01,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:25:01" (3/3) ... [2020-10-24 02:25:01,899 INFO L111 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-10-24 02:25:01,915 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 02:25:01,921 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 02:25:01,936 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 02:25:01,966 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 02:25:01,966 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 02:25:01,966 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 02:25:01,967 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 02:25:01,967 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 02:25:01,967 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 02:25:01,967 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 02:25:01,968 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 02:25:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2020-10-24 02:25:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-24 02:25:02,003 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:02,004 INFO L422 BasicCegarLoop]: 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] [2020-10-24 02:25:02,005 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:02,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1346984002, now seen corresponding path program 1 times [2020-10-24 02:25:02,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:02,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [75100247] [2020-10-24 02:25:02,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:02,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:02,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:25:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:02,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [75100247] [2020-10-24 02:25:02,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:25:02,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-24 02:25:02,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926567070] [2020-10-24 02:25:02,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 02:25:02,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:02,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 02:25:02,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 02:25:02,337 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 3 states. [2020-10-24 02:25:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:02,689 INFO L93 Difference]: Finished difference Result 239 states and 272 transitions. [2020-10-24 02:25:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 02:25:02,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-10-24 02:25:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:02,702 INFO L225 Difference]: With dead ends: 239 [2020-10-24 02:25:02,702 INFO L226 Difference]: Without dead ends: 108 [2020-10-24 02:25:02,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 02:25:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-10-24 02:25:02,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-10-24 02:25:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-10-24 02:25:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2020-10-24 02:25:02,769 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 54 [2020-10-24 02:25:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:02,770 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2020-10-24 02:25:02,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 02:25:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2020-10-24 02:25:02,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-24 02:25:02,774 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:02,774 INFO L422 BasicCegarLoop]: 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] [2020-10-24 02:25:02,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 02:25:02,775 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash 746606165, now seen corresponding path program 1 times [2020-10-24 02:25:02,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:02,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1276006814] [2020-10-24 02:25:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:02,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:02,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-10-24 02:25:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:02,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1276006814] [2020-10-24 02:25:02,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:25:02,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 02:25:02,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177615635] [2020-10-24 02:25:02,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 02:25:02,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:02,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 02:25:02,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 02:25:02,982 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 4 states. [2020-10-24 02:25:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:03,311 INFO L93 Difference]: Finished difference Result 197 states and 216 transitions. [2020-10-24 02:25:03,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 02:25:03,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-10-24 02:25:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:03,314 INFO L225 Difference]: With dead ends: 197 [2020-10-24 02:25:03,314 INFO L226 Difference]: Without dead ends: 109 [2020-10-24 02:25:03,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 02:25:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-24 02:25:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-24 02:25:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-24 02:25:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2020-10-24 02:25:03,331 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 66 [2020-10-24 02:25:03,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:03,332 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2020-10-24 02:25:03,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 02:25:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2020-10-24 02:25:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-24 02:25:03,334 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:03,334 INFO L422 BasicCegarLoop]: 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] [2020-10-24 02:25:03,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 02:25:03,335 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:03,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1799427698, now seen corresponding path program 1 times [2020-10-24 02:25:03,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:03,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1428326252] [2020-10-24 02:25:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:03,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:03,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:25:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:03,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1428326252] [2020-10-24 02:25:03,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:25:03,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-24 02:25:03,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657642030] [2020-10-24 02:25:03,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:25:03,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:03,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:25:03,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:25:03,601 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2020-10-24 02:25:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:04,184 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2020-10-24 02:25:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:25:04,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2020-10-24 02:25:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:04,190 INFO L225 Difference]: With dead ends: 216 [2020-10-24 02:25:04,190 INFO L226 Difference]: Without dead ends: 212 [2020-10-24 02:25:04,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:25:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-10-24 02:25:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 169. [2020-10-24 02:25:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-10-24 02:25:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 189 transitions. [2020-10-24 02:25:04,230 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 189 transitions. Word has length 68 [2020-10-24 02:25:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:04,232 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 189 transitions. [2020-10-24 02:25:04,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:25:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 189 transitions. [2020-10-24 02:25:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-10-24 02:25:04,240 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:04,240 INFO L422 BasicCegarLoop]: 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] [2020-10-24 02:25:04,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 02:25:04,241 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:04,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1878630598, now seen corresponding path program 1 times [2020-10-24 02:25:04,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:04,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1674698530] [2020-10-24 02:25:04,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:04,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:04,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-10-24 02:25:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:04,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1674698530] [2020-10-24 02:25:04,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:25:04,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-24 02:25:04,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238190693] [2020-10-24 02:25:04,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:25:04,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:04,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:25:04,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:25:04,538 INFO L87 Difference]: Start difference. First operand 169 states and 189 transitions. Second operand 12 states. [2020-10-24 02:25:05,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:05,295 INFO L93 Difference]: Finished difference Result 456 states and 517 transitions. [2020-10-24 02:25:05,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 02:25:05,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2020-10-24 02:25:05,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:05,300 INFO L225 Difference]: With dead ends: 456 [2020-10-24 02:25:05,300 INFO L226 Difference]: Without dead ends: 364 [2020-10-24 02:25:05,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2020-10-24 02:25:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-10-24 02:25:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 209. [2020-10-24 02:25:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-24 02:25:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 237 transitions. [2020-10-24 02:25:05,327 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 237 transitions. Word has length 71 [2020-10-24 02:25:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:05,328 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 237 transitions. [2020-10-24 02:25:05,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:25:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 237 transitions. [2020-10-24 02:25:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-10-24 02:25:05,330 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:05,330 INFO L422 BasicCegarLoop]: 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] [2020-10-24 02:25:05,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 02:25:05,330 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:05,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1354483306, now seen corresponding path program 1 times [2020-10-24 02:25:05,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:05,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [342212526] [2020-10-24 02:25:05,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:05,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:05,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-10-24 02:25:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:05,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [342212526] [2020-10-24 02:25:05,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:25:05,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 02:25:05,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982297309] [2020-10-24 02:25:05,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 02:25:05,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:05,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 02:25:05,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 02:25:05,405 INFO L87 Difference]: Start difference. First operand 209 states and 237 transitions. Second operand 4 states. [2020-10-24 02:25:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:05,635 INFO L93 Difference]: Finished difference Result 301 states and 340 transitions. [2020-10-24 02:25:05,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 02:25:05,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-10-24 02:25:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:05,640 INFO L225 Difference]: With dead ends: 301 [2020-10-24 02:25:05,640 INFO L226 Difference]: Without dead ends: 211 [2020-10-24 02:25:05,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 02:25:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-10-24 02:25:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2020-10-24 02:25:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-10-24 02:25:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 238 transitions. [2020-10-24 02:25:05,677 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 238 transitions. Word has length 71 [2020-10-24 02:25:05,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:05,683 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 238 transitions. [2020-10-24 02:25:05,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 02:25:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 238 transitions. [2020-10-24 02:25:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-24 02:25:05,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:05,688 INFO L422 BasicCegarLoop]: 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] [2020-10-24 02:25:05,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 02:25:05,689 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:05,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:05,690 INFO L82 PathProgramCache]: Analyzing trace with hash -644302664, now seen corresponding path program 1 times [2020-10-24 02:25:05,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:05,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1001406863] [2020-10-24 02:25:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:05,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:05,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-10-24 02:25:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:05,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1001406863] [2020-10-24 02:25:05,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:25:05,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-24 02:25:05,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600313587] [2020-10-24 02:25:05,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:25:05,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:05,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:25:05,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:25:05,770 INFO L87 Difference]: Start difference. First operand 211 states and 238 transitions. Second operand 5 states. [2020-10-24 02:25:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:06,071 INFO L93 Difference]: Finished difference Result 320 states and 359 transitions. [2020-10-24 02:25:06,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:25:06,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-10-24 02:25:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:06,075 INFO L225 Difference]: With dead ends: 320 [2020-10-24 02:25:06,075 INFO L226 Difference]: Without dead ends: 221 [2020-10-24 02:25:06,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:25:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-10-24 02:25:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2020-10-24 02:25:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-24 02:25:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 242 transitions. [2020-10-24 02:25:06,107 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 242 transitions. Word has length 72 [2020-10-24 02:25:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:06,107 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 242 transitions. [2020-10-24 02:25:06,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:25:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 242 transitions. [2020-10-24 02:25:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 02:25:06,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:06,109 INFO L422 BasicCegarLoop]: 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] [2020-10-24 02:25:06,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 02:25:06,109 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:06,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:06,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1665835257, now seen corresponding path program 1 times [2020-10-24 02:25:06,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:06,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1948346491] [2020-10-24 02:25:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:06,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:06,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-10-24 02:25:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:06,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1948346491] [2020-10-24 02:25:06,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:25:06,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 02:25:06,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709677792] [2020-10-24 02:25:06,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:25:06,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:25:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:25:06,257 INFO L87 Difference]: Start difference. First operand 215 states and 242 transitions. Second operand 6 states. [2020-10-24 02:25:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:06,586 INFO L93 Difference]: Finished difference Result 390 states and 436 transitions. [2020-10-24 02:25:06,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:25:06,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2020-10-24 02:25:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:06,589 INFO L225 Difference]: With dead ends: 390 [2020-10-24 02:25:06,590 INFO L226 Difference]: Without dead ends: 276 [2020-10-24 02:25:06,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:25:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-10-24 02:25:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 219. [2020-10-24 02:25:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-10-24 02:25:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 245 transitions. [2020-10-24 02:25:06,611 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 245 transitions. Word has length 73 [2020-10-24 02:25:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:06,612 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 245 transitions. [2020-10-24 02:25:06,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:25:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 245 transitions. [2020-10-24 02:25:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-24 02:25:06,613 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:06,613 INFO L422 BasicCegarLoop]: 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] [2020-10-24 02:25:06,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 02:25:06,614 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:06,614 INFO L82 PathProgramCache]: Analyzing trace with hash -14206149, now seen corresponding path program 1 times [2020-10-24 02:25:06,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:06,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1974127308] [2020-10-24 02:25:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:06,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:06,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:25:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:06,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1974127308] [2020-10-24 02:25:06,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:25:06,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 02:25:06,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738413711] [2020-10-24 02:25:06,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:25:06,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:06,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:25:06,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:25:06,731 INFO L87 Difference]: Start difference. First operand 219 states and 245 transitions. Second operand 6 states. [2020-10-24 02:25:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:07,086 INFO L93 Difference]: Finished difference Result 362 states and 404 transitions. [2020-10-24 02:25:07,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 02:25:07,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-10-24 02:25:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:07,088 INFO L225 Difference]: With dead ends: 362 [2020-10-24 02:25:07,089 INFO L226 Difference]: Without dead ends: 263 [2020-10-24 02:25:07,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:25:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-10-24 02:25:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 219. [2020-10-24 02:25:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-10-24 02:25:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 244 transitions. [2020-10-24 02:25:07,113 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 244 transitions. Word has length 74 [2020-10-24 02:25:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:07,113 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 244 transitions. [2020-10-24 02:25:07,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:25:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 244 transitions. [2020-10-24 02:25:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-24 02:25:07,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:07,115 INFO L422 BasicCegarLoop]: 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] [2020-10-24 02:25:07,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 02:25:07,115 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:07,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:07,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1638680456, now seen corresponding path program 1 times [2020-10-24 02:25:07,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:07,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2031996497] [2020-10-24 02:25:07,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:07,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:07,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 02:25:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:07,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2031996497] [2020-10-24 02:25:07,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:25:07,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-24 02:25:07,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814821415] [2020-10-24 02:25:07,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:25:07,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:07,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:25:07,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:25:07,231 INFO L87 Difference]: Start difference. First operand 219 states and 244 transitions. Second operand 8 states. [2020-10-24 02:25:07,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:07,664 INFO L93 Difference]: Finished difference Result 464 states and 518 transitions. [2020-10-24 02:25:07,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 02:25:07,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2020-10-24 02:25:07,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:07,667 INFO L225 Difference]: With dead ends: 464 [2020-10-24 02:25:07,667 INFO L226 Difference]: Without dead ends: 305 [2020-10-24 02:25:07,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:25:07,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-10-24 02:25:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 226. [2020-10-24 02:25:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-10-24 02:25:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2020-10-24 02:25:07,691 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 76 [2020-10-24 02:25:07,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:07,692 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2020-10-24 02:25:07,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:25:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2020-10-24 02:25:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-24 02:25:07,693 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:07,693 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 02:25:07,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 02:25:07,693 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:07,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:07,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1528930525, now seen corresponding path program 1 times [2020-10-24 02:25:07,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:07,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [957346204] [2020-10-24 02:25:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:07,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:07,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:25:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:07,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [957346204] [2020-10-24 02:25:07,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:25:07,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:25:07,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734570639] [2020-10-24 02:25:07,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:25:07,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:07,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:25:07,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:25:07,814 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand 10 states. [2020-10-24 02:25:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:08,492 INFO L93 Difference]: Finished difference Result 461 states and 506 transitions. [2020-10-24 02:25:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 02:25:08,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-10-24 02:25:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:08,495 INFO L225 Difference]: With dead ends: 461 [2020-10-24 02:25:08,495 INFO L226 Difference]: Without dead ends: 347 [2020-10-24 02:25:08,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:25:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-10-24 02:25:08,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 282. [2020-10-24 02:25:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-24 02:25:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 311 transitions. [2020-10-24 02:25:08,525 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 311 transitions. Word has length 78 [2020-10-24 02:25:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:08,525 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 311 transitions. [2020-10-24 02:25:08,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:25:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 311 transitions. [2020-10-24 02:25:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-24 02:25:08,527 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:08,527 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 02:25:08,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 02:25:08,527 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:08,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:08,528 INFO L82 PathProgramCache]: Analyzing trace with hash 911510761, now seen corresponding path program 1 times [2020-10-24 02:25:08,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:08,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [180023502] [2020-10-24 02:25:08,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:08,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:08,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-24 02:25:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:08,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [180023502] [2020-10-24 02:25:08,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:25:08,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 02:25:08,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705196606] [2020-10-24 02:25:08,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 02:25:08,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:08,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 02:25:08,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-10-24 02:25:08,720 INFO L87 Difference]: Start difference. First operand 282 states and 311 transitions. Second operand 14 states. [2020-10-24 02:25:09,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:09,502 INFO L93 Difference]: Finished difference Result 460 states and 502 transitions. [2020-10-24 02:25:09,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 02:25:09,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2020-10-24 02:25:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:09,506 INFO L225 Difference]: With dead ends: 460 [2020-10-24 02:25:09,506 INFO L226 Difference]: Without dead ends: 338 [2020-10-24 02:25:09,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2020-10-24 02:25:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-10-24 02:25:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 276. [2020-10-24 02:25:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2020-10-24 02:25:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2020-10-24 02:25:09,548 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 81 [2020-10-24 02:25:09,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:09,548 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2020-10-24 02:25:09,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 02:25:09,548 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2020-10-24 02:25:09,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-10-24 02:25:09,550 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:09,550 INFO L422 BasicCegarLoop]: 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] [2020-10-24 02:25:09,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 02:25:09,550 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:09,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:09,551 INFO L82 PathProgramCache]: Analyzing trace with hash -462249594, now seen corresponding path program 1 times [2020-10-24 02:25:09,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:09,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2056137698] [2020-10-24 02:25:09,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:09,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:09,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-10-24 02:25:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-24 02:25:09,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2056137698] [2020-10-24 02:25:09,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:25:09,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-24 02:25:09,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187178931] [2020-10-24 02:25:09,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:25:09,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:09,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:25:09,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:25:09,703 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand 10 states. [2020-10-24 02:25:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:10,300 INFO L93 Difference]: Finished difference Result 453 states and 498 transitions. [2020-10-24 02:25:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 02:25:10,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2020-10-24 02:25:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:10,303 INFO L225 Difference]: With dead ends: 453 [2020-10-24 02:25:10,303 INFO L226 Difference]: Without dead ends: 343 [2020-10-24 02:25:10,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:25:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-10-24 02:25:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 280. [2020-10-24 02:25:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-24 02:25:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 308 transitions. [2020-10-24 02:25:10,332 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 308 transitions. Word has length 82 [2020-10-24 02:25:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:10,333 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 308 transitions. [2020-10-24 02:25:10,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:25:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 308 transitions. [2020-10-24 02:25:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-24 02:25:10,335 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:10,335 INFO L422 BasicCegarLoop]: 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] [2020-10-24 02:25:10,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 02:25:10,335 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:10,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:10,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1324418476, now seen corresponding path program 1 times [2020-10-24 02:25:10,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:10,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1417507739] [2020-10-24 02:25:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:10,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:10,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-24 02:25:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:10,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1417507739] [2020-10-24 02:25:10,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:25:10,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:25:10,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802954713] [2020-10-24 02:25:10,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:25:10,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:10,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:25:10,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:25:10,447 INFO L87 Difference]: Start difference. First operand 280 states and 308 transitions. Second operand 10 states. [2020-10-24 02:25:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:10,976 INFO L93 Difference]: Finished difference Result 631 states and 698 transitions. [2020-10-24 02:25:10,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 02:25:10,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2020-10-24 02:25:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:10,980 INFO L225 Difference]: With dead ends: 631 [2020-10-24 02:25:10,980 INFO L226 Difference]: Without dead ends: 470 [2020-10-24 02:25:10,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2020-10-24 02:25:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-10-24 02:25:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 391. [2020-10-24 02:25:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-10-24 02:25:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 432 transitions. [2020-10-24 02:25:11,044 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 432 transitions. Word has length 87 [2020-10-24 02:25:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:11,045 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 432 transitions. [2020-10-24 02:25:11,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:25:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 432 transitions. [2020-10-24 02:25:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-10-24 02:25:11,049 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:11,049 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-10-24 02:25:11,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 02:25:11,050 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:11,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2103361900, now seen corresponding path program 2 times [2020-10-24 02:25:11,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:11,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1202076722] [2020-10-24 02:25:11,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:11,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:11,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-10-24 02:25:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:11,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1202076722] [2020-10-24 02:25:11,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:25:11,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:25:11,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090944183] [2020-10-24 02:25:11,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:25:11,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:11,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:25:11,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:25:11,268 INFO L87 Difference]: Start difference. First operand 391 states and 432 transitions. Second operand 12 states. [2020-10-24 02:25:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:12,065 INFO L93 Difference]: Finished difference Result 734 states and 809 transitions. [2020-10-24 02:25:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 02:25:12,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2020-10-24 02:25:12,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:12,069 INFO L225 Difference]: With dead ends: 734 [2020-10-24 02:25:12,069 INFO L226 Difference]: Without dead ends: 563 [2020-10-24 02:25:12,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2020-10-24 02:25:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-10-24 02:25:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 390. [2020-10-24 02:25:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-10-24 02:25:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 430 transitions. [2020-10-24 02:25:12,113 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 430 transitions. Word has length 88 [2020-10-24 02:25:12,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:12,113 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 430 transitions. [2020-10-24 02:25:12,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:25:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 430 transitions. [2020-10-24 02:25:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-24 02:25:12,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:12,115 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-10-24 02:25:12,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 02:25:12,116 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash -823874600, now seen corresponding path program 2 times [2020-10-24 02:25:12,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:12,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [316158309] [2020-10-24 02:25:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:12,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:12,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:25:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:25:12,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [316158309] [2020-10-24 02:25:12,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:25:12,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 02:25:12,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152585471] [2020-10-24 02:25:12,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 02:25:12,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:12,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 02:25:12,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-10-24 02:25:12,328 INFO L87 Difference]: Start difference. First operand 390 states and 430 transitions. Second operand 16 states. [2020-10-24 02:25:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:13,185 INFO L93 Difference]: Finished difference Result 575 states and 630 transitions. [2020-10-24 02:25:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 02:25:13,185 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2020-10-24 02:25:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:13,188 INFO L225 Difference]: With dead ends: 575 [2020-10-24 02:25:13,188 INFO L226 Difference]: Without dead ends: 380 [2020-10-24 02:25:13,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2020-10-24 02:25:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2020-10-24 02:25:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 339. [2020-10-24 02:25:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-10-24 02:25:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 372 transitions. [2020-10-24 02:25:13,223 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 372 transitions. Word has length 91 [2020-10-24 02:25:13,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:13,223 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 372 transitions. [2020-10-24 02:25:13,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 02:25:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 372 transitions. [2020-10-24 02:25:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-24 02:25:13,225 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:13,225 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 02:25:13,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 02:25:13,227 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:13,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:13,227 INFO L82 PathProgramCache]: Analyzing trace with hash 498819125, now seen corresponding path program 1 times [2020-10-24 02:25:13,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:13,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [700248787] [2020-10-24 02:25:13,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:13,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:25:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:13,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-24 02:25:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:25:13,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-24 02:25:13,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [700248787] [2020-10-24 02:25:13,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:25:13,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:25:13,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452950117] [2020-10-24 02:25:13,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:25:13,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:25:13,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:25:13,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:25:13,401 INFO L87 Difference]: Start difference. First operand 339 states and 372 transitions. Second operand 12 states. [2020-10-24 02:25:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:25:14,174 INFO L93 Difference]: Finished difference Result 613 states and 673 transitions. [2020-10-24 02:25:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 02:25:14,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2020-10-24 02:25:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:25:14,177 INFO L225 Difference]: With dead ends: 613 [2020-10-24 02:25:14,178 INFO L226 Difference]: Without dead ends: 491 [2020-10-24 02:25:14,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2020-10-24 02:25:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2020-10-24 02:25:14,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 369. [2020-10-24 02:25:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-10-24 02:25:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 406 transitions. [2020-10-24 02:25:14,217 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 406 transitions. Word has length 92 [2020-10-24 02:25:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:25:14,219 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 406 transitions. [2020-10-24 02:25:14,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:25:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 406 transitions. [2020-10-24 02:25:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-24 02:25:14,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:25:14,222 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2020-10-24 02:25:14,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 02:25:14,222 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:25:14,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:25:14,222 INFO L82 PathProgramCache]: Analyzing trace with hash 151465976, now seen corresponding path program 2 times [2020-10-24 02:25:14,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:25:14,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [261756297] [2020-10-24 02:25:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:25:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 02:25:14,244 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 02:25:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 02:25:14,261 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 02:25:14,321 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 02:25:14,321 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 02:25:14,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 02:25:14,370 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,374 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,379 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,380 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,381 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,383 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,383 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,387 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,388 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,388 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,389 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,392 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,394 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,395 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,395 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,395 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,396 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,396 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,396 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,397 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,397 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,398 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,398 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,402 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-10-24 02:25:14,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:25:14 BoogieIcfgContainer [2020-10-24 02:25:14,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 02:25:14,435 INFO L168 Benchmark]: Toolchain (without parser) took 13627.57 ms. Allocated memory was 151.0 MB in the beginning and 320.9 MB in the end (delta: 169.9 MB). Free memory was 127.9 MB in the beginning and 163.3 MB in the end (delta: -35.4 MB). Peak memory consumption was 135.0 MB. Max. memory is 8.0 GB. [2020-10-24 02:25:14,436 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 151.0 MB. Free memory is still 125.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 02:25:14,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.25 ms. Allocated memory is still 151.0 MB. Free memory was 127.2 MB in the beginning and 115.9 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-10-24 02:25:14,440 INFO L168 Benchmark]: Boogie Preprocessor took 64.46 ms. Allocated memory is still 151.0 MB. Free memory was 115.7 MB in the beginning and 113.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 02:25:14,441 INFO L168 Benchmark]: RCFGBuilder took 704.58 ms. Allocated memory is still 151.0 MB. Free memory was 113.8 MB in the beginning and 114.0 MB in the end (delta: -175.8 kB). Peak memory consumption was 16.6 MB. Max. memory is 8.0 GB. [2020-10-24 02:25:14,444 INFO L168 Benchmark]: TraceAbstraction took 12543.01 ms. Allocated memory was 151.0 MB in the beginning and 320.9 MB in the end (delta: 169.9 MB). Free memory was 113.5 MB in the beginning and 163.3 MB in the end (delta: -49.9 MB). Peak memory consumption was 119.5 MB. Max. memory is 8.0 GB. [2020-10-24 02:25:14,448 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 151.0 MB. Free memory is still 125.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 298.25 ms. Allocated memory is still 151.0 MB. Free memory was 127.2 MB in the beginning and 115.9 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 64.46 ms. Allocated memory is still 151.0 MB. Free memory was 115.7 MB in the beginning and 113.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 704.58 ms. Allocated memory is still 151.0 MB. Free memory was 113.8 MB in the beginning and 114.0 MB in the end (delta: -175.8 kB). Peak memory consumption was 16.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12543.01 ms. Allocated memory was 151.0 MB in the beginning and 320.9 MB in the end (delta: 169.9 MB). Free memory was 113.5 MB in the beginning and 163.3 MB in the end (delta: -49.9 MB). Peak memory consumption was 119.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L85] char A [2 + 2 + 4 +1]; VAL [A={6:0}] [L86] A[2 + 2 + 4] = 0 VAL [A={6:0}] [L87] CALL parse_expression_list (A) VAL [str={6:0}] [L59] int start=0, i=-1, j=-1; VAL [i=-1, j=-1, start=0, str={6:0}, str={6:0}] [L60] char str2[2]; VAL [i=-1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}] [L61] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}] [L63] i++ VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}] [L64] str[i] VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=58] [L65] case 0: VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=58] [L80] EXPR str[i] VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=58] [L80] COND TRUE str[i] != 0 VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=58] [L63] i++ VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}] [L64] str[i] VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=52] [L65] case 0: VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=52] [L80] EXPR str[i] VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=52] [L80] COND TRUE str[i] != 0 VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=52] [L63] i++ VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}] [L64] str[i] VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L65] case 0: VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L66] EXPR str[start] VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58] [L66] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58] [L66] EXPR str[start] VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58, str[start]=58] [L66] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58, str[start]=58] [L66] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58, str[start]=58] [L67] EXPR str[start] VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58] [L67] COND FALSE !(str[start] == '"') VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58] [L68] j = i-1 VAL [i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L69] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L69] EXPR str[j] VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52] [L69] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52] [L69] EXPR str[j] VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52, str[j]=52] [L69] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52, str[j]=52] [L69] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52, str[j]=52] [L69] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52, str[j]=52] [L70] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=1, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L70] EXPR str[j] VAL [(0 < j) && (str[j] == '"')=1, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52] [L70] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52] [L70] COND FALSE !((0 < j) && (str[j] == '"')) VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52] [L71] COND TRUE start<=j VAL [i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L72] CALL r_strncpy(str2, str+start, j-start+1) VAL [\old(n)=2, dest={3:0}, src={6:0}] [L41] return strncpy(dest,src,n); VAL [\old(n)=2, \result={55:54}, dest={3:0}, dest={3:0}, n=2, src={6:0}, src={6:0}, strncpy(dest,src,n)={55:54}] [L72] RET r_strncpy(str2, str+start, j-start+1) VAL [i=2, j=1, r_strncpy(str2, str+start, j-start+1)={55:54}, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L73] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L15] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "verisec_OpenSER_cases1_stripFullBoth_arr.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 133 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.3s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2185 SDtfs, 2633 SDslu, 9240 SDs, 0 SdLazy, 5785 SolverSat, 264 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 989 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1322 NumberOfCodeBlocks, 1322 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1208 ConstructedInterpolants, 0 QuantifiedInterpolants, 258452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 22/66 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...