./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:40:36,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:40:36,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:40:36,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:40:36,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:40:36,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:40:36,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:40:36,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:40:36,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:40:36,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:40:36,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:40:36,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:40:36,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:40:36,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:40:36,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:40:36,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:40:36,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:40:36,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:40:36,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:40:36,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:40:36,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:40:36,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:40:36,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:40:36,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:40:36,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:40:36,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:40:36,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:40:36,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:40:36,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:40:36,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:40:36,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:40:36,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:40:36,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:40:36,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:40:36,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:40:36,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:40:36,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:40:36,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:40:36,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:40:36,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:40:36,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:40:36,196 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-11-20 07:40:36,220 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:40:36,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:40:36,221 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:40:36,221 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:40:36,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:40:36,222 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:40:36,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:40:36,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:40:36,224 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:40:36,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:40:36,224 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:40:36,225 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 07:40:36,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:40:36,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:40:36,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:40:36,226 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 07:40:36,226 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 07:40:36,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:40:36,227 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 07:40:36,227 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:40:36,227 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:40:36,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:40:36,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:40:36,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:40:36,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:40:36,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:40:36,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:40:36,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:40:36,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:40:36,230 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:40:36,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee [2021-11-20 07:40:36,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:40:36,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:40:36,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:40:36,522 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:40:36,523 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:40:36,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/forester-heap/dll-01-1.i [2021-11-20 07:40:36,623 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/data/bc5565ee7/c82810b64a1a4dd3b93174d2b8fec09e/FLAG5f53cc21e [2021-11-20 07:40:37,120 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:40:37,120 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i [2021-11-20 07:40:37,151 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/data/bc5565ee7/c82810b64a1a4dd3b93174d2b8fec09e/FLAG5f53cc21e [2021-11-20 07:40:37,449 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/data/bc5565ee7/c82810b64a1a4dd3b93174d2b8fec09e [2021-11-20 07:40:37,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:40:37,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:40:37,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:40:37,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:40:37,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:40:37,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:40:37" (1/1) ... [2021-11-20 07:40:37,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443a9605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37, skipping insertion in model container [2021-11-20 07:40:37,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:40:37" (1/1) ... [2021-11-20 07:40:37,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:40:37,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:40:37,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2021-11-20 07:40:37,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2021-11-20 07:40:37,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2021-11-20 07:40:37,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2021-11-20 07:40:37,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2021-11-20 07:40:37,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2021-11-20 07:40:37,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2021-11-20 07:40:37,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2021-11-20 07:40:37,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2021-11-20 07:40:37,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2021-11-20 07:40:37,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2021-11-20 07:40:37,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2021-11-20 07:40:37,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2021-11-20 07:40:37,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:40:37,849 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:40:37,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2021-11-20 07:40:37,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2021-11-20 07:40:37,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2021-11-20 07:40:37,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2021-11-20 07:40:37,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2021-11-20 07:40:37,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2021-11-20 07:40:37,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2021-11-20 07:40:37,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2021-11-20 07:40:37,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2021-11-20 07:40:37,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2021-11-20 07:40:37,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2021-11-20 07:40:37,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2021-11-20 07:40:37,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2021-11-20 07:40:37,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:40:37,966 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:40:37,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37 WrapperNode [2021-11-20 07:40:37,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:40:37,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:40:37,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:40:37,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:40:37,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37" (1/1) ... [2021-11-20 07:40:38,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37" (1/1) ... [2021-11-20 07:40:38,057 INFO L137 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2021-11-20 07:40:38,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:40:38,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:40:38,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:40:38,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:40:38,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37" (1/1) ... [2021-11-20 07:40:38,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37" (1/1) ... [2021-11-20 07:40:38,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37" (1/1) ... [2021-11-20 07:40:38,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37" (1/1) ... [2021-11-20 07:40:38,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37" (1/1) ... [2021-11-20 07:40:38,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37" (1/1) ... [2021-11-20 07:40:38,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37" (1/1) ... [2021-11-20 07:40:38,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:40:38,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:40:38,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:40:38,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:40:38,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37" (1/1) ... [2021-11-20 07:40:38,121 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:40:38,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:40:38,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:40:38,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:40:38,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 07:40:38,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:40:38,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 07:40:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 07:40:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 07:40:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:40:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:40:38,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:40:38,289 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:40:38,291 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:40:38,870 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:40:38,879 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:40:38,879 INFO L301 CfgBuilder]: Removed 30 assume(true) statements. [2021-11-20 07:40:38,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:40:38 BoogieIcfgContainer [2021-11-20 07:40:38,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:40:38,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:40:38,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:40:38,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:40:38,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:40:37" (1/3) ... [2021-11-20 07:40:38,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4729bb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:40:38, skipping insertion in model container [2021-11-20 07:40:38,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:40:37" (2/3) ... [2021-11-20 07:40:38,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4729bb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:40:38, skipping insertion in model container [2021-11-20 07:40:38,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:40:38" (3/3) ... [2021-11-20 07:40:38,900 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2021-11-20 07:40:38,911 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:40:38,911 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2021-11-20 07:40:38,957 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:40:38,963 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:40:38,963 INFO L340 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2021-11-20 07:40:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 115 states have (on average 2.1913043478260867) internal successors, (252), 199 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:38,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-20 07:40:38,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:38,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-20 07:40:38,992 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:38,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:38,998 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-11-20 07:40:39,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:39,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88193943] [2021-11-20 07:40:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:39,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:39,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:39,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88193943] [2021-11-20 07:40:39,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88193943] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:39,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:39,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:40:39,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421596786] [2021-11-20 07:40:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:39,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:40:39,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:39,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:40:39,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:39,236 INFO L87 Difference]: Start difference. First operand has 200 states, 115 states have (on average 2.1913043478260867) internal successors, (252), 199 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:39,503 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2021-11-20 07:40:39,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:40:39,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-20 07:40:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:39,520 INFO L225 Difference]: With dead ends: 201 [2021-11-20 07:40:39,520 INFO L226 Difference]: Without dead ends: 197 [2021-11-20 07:40:39,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:39,529 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 191 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:39,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 122 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:40:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-20 07:40:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2021-11-20 07:40:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 191 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2021-11-20 07:40:39,606 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 3 [2021-11-20 07:40:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:39,607 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2021-11-20 07:40:39,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2021-11-20 07:40:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-20 07:40:39,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:39,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-20 07:40:39,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:40:39,609 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:39,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:39,610 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-11-20 07:40:39,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:39,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627382302] [2021-11-20 07:40:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:39,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:39,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:39,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627382302] [2021-11-20 07:40:39,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627382302] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:39,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:39,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:40:39,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144869084] [2021-11-20 07:40:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:39,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:40:39,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:39,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:40:39,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:39,682 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:39,812 INFO L93 Difference]: Finished difference Result 221 states and 232 transitions. [2021-11-20 07:40:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:40:39,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-20 07:40:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:39,815 INFO L225 Difference]: With dead ends: 221 [2021-11-20 07:40:39,815 INFO L226 Difference]: Without dead ends: 221 [2021-11-20 07:40:39,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:39,817 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 180 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:39,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 148 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:40:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-20 07:40:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2021-11-20 07:40:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 134 states have (on average 1.671641791044776) internal successors, (224), 200 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 224 transitions. [2021-11-20 07:40:39,832 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 224 transitions. Word has length 3 [2021-11-20 07:40:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:39,833 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 224 transitions. [2021-11-20 07:40:39,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 224 transitions. [2021-11-20 07:40:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-20 07:40:39,834 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:39,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-20 07:40:39,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:40:39,834 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:39,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:39,835 INFO L85 PathProgramCache]: Analyzing trace with hash 889446311, now seen corresponding path program 1 times [2021-11-20 07:40:39,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:39,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094537564] [2021-11-20 07:40:39,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:39,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:39,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:39,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094537564] [2021-11-20 07:40:39,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094537564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:39,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:39,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:40:39,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261747877] [2021-11-20 07:40:39,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:39,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:40:39,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:39,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:40:39,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:39,878 INFO L87 Difference]: Start difference. First operand 201 states and 224 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:39,915 INFO L93 Difference]: Finished difference Result 216 states and 227 transitions. [2021-11-20 07:40:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:40:39,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-20 07:40:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:39,917 INFO L225 Difference]: With dead ends: 216 [2021-11-20 07:40:39,918 INFO L226 Difference]: Without dead ends: 216 [2021-11-20 07:40:39,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:39,920 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 176 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:39,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 203 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:40:39,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-20 07:40:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2021-11-20 07:40:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 198 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 221 transitions. [2021-11-20 07:40:39,932 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 221 transitions. Word has length 6 [2021-11-20 07:40:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:39,933 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 221 transitions. [2021-11-20 07:40:39,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 221 transitions. [2021-11-20 07:40:39,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 07:40:39,934 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:39,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:40:39,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 07:40:39,935 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:39,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:39,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777177, now seen corresponding path program 1 times [2021-11-20 07:40:39,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:39,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113312204] [2021-11-20 07:40:39,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:39,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:40,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:40,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113312204] [2021-11-20 07:40:40,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113312204] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:40,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:40,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:40:40,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950415708] [2021-11-20 07:40:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:40,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:40:40,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:40,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:40:40,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:40:40,011 INFO L87 Difference]: Start difference. First operand 199 states and 221 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:40,224 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2021-11-20 07:40:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:40:40,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-20 07:40:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:40,226 INFO L225 Difference]: With dead ends: 198 [2021-11-20 07:40:40,226 INFO L226 Difference]: Without dead ends: 198 [2021-11-20 07:40:40,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:40:40,229 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 4 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:40,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 535 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:40:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-20 07:40:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-20 07:40:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 197 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2021-11-20 07:40:40,254 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 12 [2021-11-20 07:40:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:40,256 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2021-11-20 07:40:40,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2021-11-20 07:40:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 07:40:40,257 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:40,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:40:40,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 07:40:40,258 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:40,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:40,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777178, now seen corresponding path program 1 times [2021-11-20 07:40:40,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:40,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633614398] [2021-11-20 07:40:40,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:40,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:40,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:40,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633614398] [2021-11-20 07:40:40,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633614398] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:40,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:40,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:40:40,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851672508] [2021-11-20 07:40:40,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:40,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:40:40,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:40,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:40:40,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:40:40,408 INFO L87 Difference]: Start difference. First operand 198 states and 220 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:40,608 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2021-11-20 07:40:40,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:40:40,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-20 07:40:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:40,610 INFO L225 Difference]: With dead ends: 197 [2021-11-20 07:40:40,611 INFO L226 Difference]: Without dead ends: 197 [2021-11-20 07:40:40,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:40:40,612 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 2 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:40,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 546 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:40:40,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-20 07:40:40,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-11-20 07:40:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 196 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2021-11-20 07:40:40,618 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 12 [2021-11-20 07:40:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:40,618 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2021-11-20 07:40:40,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2021-11-20 07:40:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-20 07:40:40,620 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:40,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:40:40,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 07:40:40,620 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash 373192235, now seen corresponding path program 1 times [2021-11-20 07:40:40,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:40,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474294228] [2021-11-20 07:40:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:40,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:40,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:40,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474294228] [2021-11-20 07:40:40,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474294228] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:40,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:40,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:40:40,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510098900] [2021-11-20 07:40:40,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:40,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:40:40,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:40,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:40:40,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:40,658 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:40,668 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2021-11-20 07:40:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:40:40,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-20 07:40:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:40,670 INFO L225 Difference]: With dead ends: 198 [2021-11-20 07:40:40,670 INFO L226 Difference]: Without dead ends: 198 [2021-11-20 07:40:40,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:40,671 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:40,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:40:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-20 07:40:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-20 07:40:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 197 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2021-11-20 07:40:40,678 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 14 [2021-11-20 07:40:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:40,678 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2021-11-20 07:40:40,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2021-11-20 07:40:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-20 07:40:40,679 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:40,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:40:40,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 07:40:40,680 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:40,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:40,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692102, now seen corresponding path program 1 times [2021-11-20 07:40:40,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:40,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997637350] [2021-11-20 07:40:40,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:40,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:40,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:40,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997637350] [2021-11-20 07:40:40,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997637350] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:40,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:40,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:40:40,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216154337] [2021-11-20 07:40:40,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:40,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:40:40,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:40,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:40:40,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:40:40,842 INFO L87 Difference]: Start difference. First operand 198 states and 220 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:41,245 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2021-11-20 07:40:41,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:40:41,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-20 07:40:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:41,248 INFO L225 Difference]: With dead ends: 198 [2021-11-20 07:40:41,248 INFO L226 Difference]: Without dead ends: 198 [2021-11-20 07:40:41,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-11-20 07:40:41,249 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:41,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 669 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 07:40:41,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-20 07:40:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-11-20 07:40:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 196 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2021-11-20 07:40:41,256 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 15 [2021-11-20 07:40:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:41,257 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2021-11-20 07:40:41,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2021-11-20 07:40:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-20 07:40:41,259 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:41,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:40:41,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 07:40:41,259 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:41,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:41,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692101, now seen corresponding path program 1 times [2021-11-20 07:40:41,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:41,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709452588] [2021-11-20 07:40:41,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:41,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:41,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:41,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709452588] [2021-11-20 07:40:41,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709452588] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:41,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:41,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:40:41,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772988393] [2021-11-20 07:40:41,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:41,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:40:41,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:41,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:40:41,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:40:41,420 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:41,751 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2021-11-20 07:40:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:40:41,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-20 07:40:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:41,753 INFO L225 Difference]: With dead ends: 197 [2021-11-20 07:40:41,753 INFO L226 Difference]: Without dead ends: 197 [2021-11-20 07:40:41,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-11-20 07:40:41,754 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 171 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:41,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 397 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:40:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-20 07:40:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2021-11-20 07:40:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 134 states have (on average 1.626865671641791) internal successors, (218), 195 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2021-11-20 07:40:41,760 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 15 [2021-11-20 07:40:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:41,760 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2021-11-20 07:40:41,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2021-11-20 07:40:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-20 07:40:41,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:41,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:40:41,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 07:40:41,762 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2137878992, now seen corresponding path program 1 times [2021-11-20 07:40:41,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:41,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747037051] [2021-11-20 07:40:41,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:41,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:41,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:41,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747037051] [2021-11-20 07:40:41,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747037051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:41,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:41,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:40:41,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906730965] [2021-11-20 07:40:41,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:41,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:40:41,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:41,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:40:41,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:40:41,874 INFO L87 Difference]: Start difference. First operand 196 states and 218 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:42,103 INFO L93 Difference]: Finished difference Result 283 states and 311 transitions. [2021-11-20 07:40:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 07:40:42,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-20 07:40:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:42,105 INFO L225 Difference]: With dead ends: 283 [2021-11-20 07:40:42,105 INFO L226 Difference]: Without dead ends: 283 [2021-11-20 07:40:42,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-11-20 07:40:42,106 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 195 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:42,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 649 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:40:42,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-11-20 07:40:42,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 193. [2021-11-20 07:40:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 132 states have (on average 1.628787878787879) internal successors, (215), 192 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2021-11-20 07:40:42,113 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 16 [2021-11-20 07:40:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:42,113 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2021-11-20 07:40:42,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2021-11-20 07:40:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-20 07:40:42,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:42,114 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:40:42,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 07:40:42,114 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:42,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:42,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1339025717, now seen corresponding path program 1 times [2021-11-20 07:40:42,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:42,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759072778] [2021-11-20 07:40:42,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:42,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:42,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:42,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759072778] [2021-11-20 07:40:42,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759072778] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:42,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:42,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:40:42,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298448125] [2021-11-20 07:40:42,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:42,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:40:42,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:42,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:40:42,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:40:42,159 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:42,292 INFO L93 Difference]: Finished difference Result 284 states and 311 transitions. [2021-11-20 07:40:42,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 07:40:42,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-20 07:40:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:42,295 INFO L225 Difference]: With dead ends: 284 [2021-11-20 07:40:42,295 INFO L226 Difference]: Without dead ends: 284 [2021-11-20 07:40:42,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:40:42,296 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 100 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:42,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 611 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:40:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-20 07:40:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 196. [2021-11-20 07:40:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 135 states have (on average 1.614814814814815) internal successors, (218), 195 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2021-11-20 07:40:42,306 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 18 [2021-11-20 07:40:42,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:42,306 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2021-11-20 07:40:42,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2021-11-20 07:40:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 07:40:42,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:42,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:40:42,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 07:40:42,309 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:42,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802310, now seen corresponding path program 1 times [2021-11-20 07:40:42,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:42,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670223003] [2021-11-20 07:40:42,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:42,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:42,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:42,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670223003] [2021-11-20 07:40:42,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670223003] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:42,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:42,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:40:42,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189103158] [2021-11-20 07:40:42,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:42,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:40:42,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:42,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:40:42,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:40:42,386 INFO L87 Difference]: Start difference. First operand 196 states and 218 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:42,523 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2021-11-20 07:40:42,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:40:42,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-20 07:40:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:42,524 INFO L225 Difference]: With dead ends: 191 [2021-11-20 07:40:42,524 INFO L226 Difference]: Without dead ends: 191 [2021-11-20 07:40:42,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:40:42,525 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 257 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:42,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 115 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:40:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-20 07:40:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 186. [2021-11-20 07:40:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2021-11-20 07:40:42,530 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 20 [2021-11-20 07:40:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:42,531 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2021-11-20 07:40:42,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2021-11-20 07:40:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 07:40:42,532 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:42,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:40:42,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 07:40:42,532 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:42,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802309, now seen corresponding path program 1 times [2021-11-20 07:40:42,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:42,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890485172] [2021-11-20 07:40:42,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:42,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:42,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:42,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890485172] [2021-11-20 07:40:42,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890485172] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:42,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:42,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:40:42,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775954234] [2021-11-20 07:40:42,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:42,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:40:42,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:42,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:40:42,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:40:42,607 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:42,798 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2021-11-20 07:40:42,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:40:42,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-20 07:40:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:42,801 INFO L225 Difference]: With dead ends: 247 [2021-11-20 07:40:42,801 INFO L226 Difference]: Without dead ends: 247 [2021-11-20 07:40:42,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:40:42,802 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 243 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:42,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 202 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:40:42,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-11-20 07:40:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 210. [2021-11-20 07:40:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 209 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 246 transitions. [2021-11-20 07:40:42,808 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 246 transitions. Word has length 20 [2021-11-20 07:40:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:42,809 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 246 transitions. [2021-11-20 07:40:42,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 246 transitions. [2021-11-20 07:40:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 07:40:42,810 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:42,810 INFO L514 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] [2021-11-20 07:40:42,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 07:40:42,810 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:42,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1797484881, now seen corresponding path program 1 times [2021-11-20 07:40:42,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:42,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563045202] [2021-11-20 07:40:42,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:42,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:42,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:42,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:42,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563045202] [2021-11-20 07:40:42,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563045202] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:42,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:42,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:40:42,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495165465] [2021-11-20 07:40:42,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:42,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:40:42,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:42,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:40:42,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:40:42,840 INFO L87 Difference]: Start difference. First operand 210 states and 246 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:42,955 INFO L93 Difference]: Finished difference Result 242 states and 256 transitions. [2021-11-20 07:40:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:40:42,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-20 07:40:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:42,957 INFO L225 Difference]: With dead ends: 242 [2021-11-20 07:40:42,958 INFO L226 Difference]: Without dead ends: 242 [2021-11-20 07:40:42,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:40:42,959 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 233 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:42,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 271 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:40:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-20 07:40:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 208. [2021-11-20 07:40:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.51875) internal successors, (243), 207 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 243 transitions. [2021-11-20 07:40:42,965 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 243 transitions. Word has length 22 [2021-11-20 07:40:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:42,965 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 243 transitions. [2021-11-20 07:40:42,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 243 transitions. [2021-11-20 07:40:42,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-20 07:40:42,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:42,966 INFO L514 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] [2021-11-20 07:40:42,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-20 07:40:42,967 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:42,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:42,967 INFO L85 PathProgramCache]: Analyzing trace with hash 110847663, now seen corresponding path program 1 times [2021-11-20 07:40:42,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:42,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516889001] [2021-11-20 07:40:42,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:42,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:43,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:43,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516889001] [2021-11-20 07:40:43,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516889001] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:43,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:43,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:40:43,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539789001] [2021-11-20 07:40:43,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:43,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:40:43,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:43,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:40:43,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:40:43,003 INFO L87 Difference]: Start difference. First operand 208 states and 243 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:43,160 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2021-11-20 07:40:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 07:40:43,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-20 07:40:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:43,162 INFO L225 Difference]: With dead ends: 207 [2021-11-20 07:40:43,163 INFO L226 Difference]: Without dead ends: 207 [2021-11-20 07:40:43,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:40:43,163 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 9 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:43,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 464 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:40:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-20 07:40:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-11-20 07:40:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.50625) internal successors, (241), 206 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2021-11-20 07:40:43,169 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 23 [2021-11-20 07:40:43,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:43,170 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2021-11-20 07:40:43,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2021-11-20 07:40:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-20 07:40:43,171 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:43,171 INFO L514 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] [2021-11-20 07:40:43,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-20 07:40:43,171 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:43,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:43,171 INFO L85 PathProgramCache]: Analyzing trace with hash 110847664, now seen corresponding path program 1 times [2021-11-20 07:40:43,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:43,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784055862] [2021-11-20 07:40:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:43,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:43,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:43,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784055862] [2021-11-20 07:40:43,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784055862] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:43,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:43,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:40:43,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430414959] [2021-11-20 07:40:43,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:43,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:40:43,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:43,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:40:43,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:40:43,239 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:43,419 INFO L93 Difference]: Finished difference Result 206 states and 239 transitions. [2021-11-20 07:40:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:40:43,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-20 07:40:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:43,421 INFO L225 Difference]: With dead ends: 206 [2021-11-20 07:40:43,422 INFO L226 Difference]: Without dead ends: 206 [2021-11-20 07:40:43,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:40:43,426 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:43,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 456 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:40:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-11-20 07:40:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-11-20 07:40:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.49375) internal successors, (239), 205 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 239 transitions. [2021-11-20 07:40:43,433 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 239 transitions. Word has length 23 [2021-11-20 07:40:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:43,433 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 239 transitions. [2021-11-20 07:40:43,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 239 transitions. [2021-11-20 07:40:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 07:40:43,437 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:43,438 INFO L514 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] [2021-11-20 07:40:43,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-20 07:40:43,438 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:43,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash -398547279, now seen corresponding path program 1 times [2021-11-20 07:40:43,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:43,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337142649] [2021-11-20 07:40:43,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:43,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:43,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:43,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337142649] [2021-11-20 07:40:43,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337142649] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:43,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:43,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 07:40:43,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514391150] [2021-11-20 07:40:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:43,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:40:43,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:43,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:40:43,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:40:43,545 INFO L87 Difference]: Start difference. First operand 206 states and 239 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:43,919 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2021-11-20 07:40:43,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:40:43,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 07:40:43,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:43,920 INFO L225 Difference]: With dead ends: 206 [2021-11-20 07:40:43,921 INFO L226 Difference]: Without dead ends: 206 [2021-11-20 07:40:43,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-11-20 07:40:43,922 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 246 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:43,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 427 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 07:40:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-11-20 07:40:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2021-11-20 07:40:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 160 states have (on average 1.4875) internal successors, (238), 204 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 238 transitions. [2021-11-20 07:40:43,928 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 238 transitions. Word has length 27 [2021-11-20 07:40:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:43,928 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 238 transitions. [2021-11-20 07:40:43,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 238 transitions. [2021-11-20 07:40:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 07:40:43,929 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:43,929 INFO L514 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] [2021-11-20 07:40:43,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-20 07:40:43,929 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash -398547278, now seen corresponding path program 1 times [2021-11-20 07:40:43,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:43,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630777500] [2021-11-20 07:40:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:43,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:44,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:44,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630777500] [2021-11-20 07:40:44,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630777500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:44,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:44,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 07:40:44,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595453540] [2021-11-20 07:40:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:44,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 07:40:44,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 07:40:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:40:44,089 INFO L87 Difference]: Start difference. First operand 205 states and 238 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:44,658 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2021-11-20 07:40:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 07:40:44,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 07:40:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:44,660 INFO L225 Difference]: With dead ends: 198 [2021-11-20 07:40:44,660 INFO L226 Difference]: Without dead ends: 198 [2021-11-20 07:40:44,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-11-20 07:40:44,662 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 263 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:44,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 483 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 07:40:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-20 07:40:44,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2021-11-20 07:40:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 186 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 219 transitions. [2021-11-20 07:40:44,667 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 219 transitions. Word has length 27 [2021-11-20 07:40:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:44,668 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 219 transitions. [2021-11-20 07:40:44,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 219 transitions. [2021-11-20 07:40:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 07:40:44,669 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:44,669 INFO L514 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] [2021-11-20 07:40:44,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-20 07:40:44,669 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:44,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash 329779259, now seen corresponding path program 1 times [2021-11-20 07:40:44,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:44,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490840741] [2021-11-20 07:40:44,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:44,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:44,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:44,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490840741] [2021-11-20 07:40:44,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490840741] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:44,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:44,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:40:44,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759075124] [2021-11-20 07:40:44,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:44,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:40:44,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:44,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:40:44,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:44,697 INFO L87 Difference]: Start difference. First operand 187 states and 219 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:44,707 INFO L93 Difference]: Finished difference Result 260 states and 307 transitions. [2021-11-20 07:40:44,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:40:44,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 07:40:44,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:44,709 INFO L225 Difference]: With dead ends: 260 [2021-11-20 07:40:44,709 INFO L226 Difference]: Without dead ends: 260 [2021-11-20 07:40:44,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:44,710 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 50 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:44,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 299 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:40:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-11-20 07:40:44,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 193. [2021-11-20 07:40:44,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 192 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 227 transitions. [2021-11-20 07:40:44,717 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 227 transitions. Word has length 28 [2021-11-20 07:40:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:44,717 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 227 transitions. [2021-11-20 07:40:44,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 227 transitions. [2021-11-20 07:40:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-20 07:40:44,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:44,718 INFO L514 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] [2021-11-20 07:40:44,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-20 07:40:44,718 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:44,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:44,719 INFO L85 PathProgramCache]: Analyzing trace with hash -751842895, now seen corresponding path program 1 times [2021-11-20 07:40:44,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:44,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387225522] [2021-11-20 07:40:44,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:44,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:44,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:44,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387225522] [2021-11-20 07:40:44,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387225522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:44,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:44,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:40:44,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254689230] [2021-11-20 07:40:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:44,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:40:44,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:44,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:40:44,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:40:44,772 INFO L87 Difference]: Start difference. First operand 193 states and 227 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:44,922 INFO L93 Difference]: Finished difference Result 193 states and 228 transitions. [2021-11-20 07:40:44,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 07:40:44,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-20 07:40:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:44,924 INFO L225 Difference]: With dead ends: 193 [2021-11-20 07:40:44,924 INFO L226 Difference]: Without dead ends: 193 [2021-11-20 07:40:44,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:40:44,925 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 222 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:44,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 226 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:40:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-20 07:40:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2021-11-20 07:40:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 188 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 223 transitions. [2021-11-20 07:40:44,931 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 223 transitions. Word has length 29 [2021-11-20 07:40:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:44,931 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 223 transitions. [2021-11-20 07:40:44,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 223 transitions. [2021-11-20 07:40:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-20 07:40:44,932 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:44,932 INFO L514 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] [2021-11-20 07:40:44,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-20 07:40:44,932 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1633211075, now seen corresponding path program 1 times [2021-11-20 07:40:44,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:44,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530345078] [2021-11-20 07:40:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:44,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:44,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:44,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530345078] [2021-11-20 07:40:44,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530345078] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:44,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:44,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:40:44,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436918191] [2021-11-20 07:40:44,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:44,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:40:44,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:44,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:40:44,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:44,966 INFO L87 Difference]: Start difference. First operand 189 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:44,983 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2021-11-20 07:40:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:40:44,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-20 07:40:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:44,985 INFO L225 Difference]: With dead ends: 187 [2021-11-20 07:40:44,985 INFO L226 Difference]: Without dead ends: 187 [2021-11-20 07:40:44,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:44,986 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 20 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:44,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 262 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:40:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-11-20 07:40:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2021-11-20 07:40:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 186 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 220 transitions. [2021-11-20 07:40:44,992 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 220 transitions. Word has length 29 [2021-11-20 07:40:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:44,992 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 220 transitions. [2021-11-20 07:40:44,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2021-11-20 07:40:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 07:40:44,993 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:44,993 INFO L514 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] [2021-11-20 07:40:44,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-20 07:40:44,993 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash -910059888, now seen corresponding path program 1 times [2021-11-20 07:40:44,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:44,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180955531] [2021-11-20 07:40:44,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:44,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:45,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:45,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180955531] [2021-11-20 07:40:45,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180955531] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:45,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:45,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 07:40:45,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183625662] [2021-11-20 07:40:45,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:45,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:40:45,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:45,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:40:45,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:40:45,130 INFO L87 Difference]: Start difference. First operand 187 states and 220 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:45,512 INFO L93 Difference]: Finished difference Result 290 states and 320 transitions. [2021-11-20 07:40:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 07:40:45,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-20 07:40:45,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:45,515 INFO L225 Difference]: With dead ends: 290 [2021-11-20 07:40:45,515 INFO L226 Difference]: Without dead ends: 290 [2021-11-20 07:40:45,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-11-20 07:40:45,516 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 511 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:45,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 705 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 07:40:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-11-20 07:40:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 199. [2021-11-20 07:40:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 198 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2021-11-20 07:40:45,523 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 30 [2021-11-20 07:40:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:45,523 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2021-11-20 07:40:45,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2021-11-20 07:40:45,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-20 07:40:45,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:45,524 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-20 07:40:45,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-20 07:40:45,524 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:45,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:45,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2071508259, now seen corresponding path program 1 times [2021-11-20 07:40:45,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:45,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760427111] [2021-11-20 07:40:45,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:45,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:45,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:45,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760427111] [2021-11-20 07:40:45,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760427111] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:40:45,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218228861] [2021-11-20 07:40:45,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:45,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:40:45,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:40:45,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:40:45,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 07:40:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:45,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-20 07:40:45,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:40:45,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 07:40:45,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 07:40:45,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:40:45,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-20 07:40:45,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:40:45,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-20 07:40:46,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:40:46,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:40:46,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:40:46,055 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 07:40:46,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 07:40:46,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:40:46,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:40:46,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:40:46,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 07:40:46,650 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-11-20 07:40:46,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 50 [2021-11-20 07:40:46,671 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-11-20 07:40:46,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 25 [2021-11-20 07:40:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:46,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:40:50,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2021-11-20 07:40:50,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2021-11-20 07:40:50,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2021-11-20 07:40:50,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2021-11-20 07:40:50,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:50,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218228861] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:40:50,997 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:40:50,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 16 [2021-11-20 07:40:50,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651944365] [2021-11-20 07:40:50,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:40:50,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 07:40:50,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:50,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 07:40:50,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=181, Unknown=4, NotChecked=0, Total=240 [2021-11-20 07:40:50,999 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:51,597 INFO L93 Difference]: Finished difference Result 340 states and 372 transitions. [2021-11-20 07:40:51,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 07:40:51,599 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-20 07:40:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:51,601 INFO L225 Difference]: With dead ends: 340 [2021-11-20 07:40:51,601 INFO L226 Difference]: Without dead ends: 340 [2021-11-20 07:40:51,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=155, Invalid=393, Unknown=4, NotChecked=0, Total=552 [2021-11-20 07:40:51,602 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 680 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:51,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [680 Valid, 896 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 390 Invalid, 0 Unknown, 119 Unchecked, 0.4s Time] [2021-11-20 07:40:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-20 07:40:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 227. [2021-11-20 07:40:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 195 states have (on average 1.405128205128205) internal successors, (274), 226 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 274 transitions. [2021-11-20 07:40:51,610 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 274 transitions. Word has length 32 [2021-11-20 07:40:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:51,611 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 274 transitions. [2021-11-20 07:40:51,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 274 transitions. [2021-11-20 07:40:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-20 07:40:51,612 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:51,612 INFO L514 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] [2021-11-20 07:40:51,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 07:40:51,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-20 07:40:51,827 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:51,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921825, now seen corresponding path program 1 times [2021-11-20 07:40:51,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:51,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724014510] [2021-11-20 07:40:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:51,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:51,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:51,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724014510] [2021-11-20 07:40:51,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724014510] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:51,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:51,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-20 07:40:52,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192139074] [2021-11-20 07:40:52,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:52,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 07:40:52,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 07:40:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:40:52,001 INFO L87 Difference]: Start difference. First operand 227 states and 274 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:52,602 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2021-11-20 07:40:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 07:40:52,603 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-20 07:40:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:52,605 INFO L225 Difference]: With dead ends: 334 [2021-11-20 07:40:52,605 INFO L226 Difference]: Without dead ends: 334 [2021-11-20 07:40:52,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-11-20 07:40:52,606 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 499 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:52,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 833 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 07:40:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-20 07:40:52,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 228. [2021-11-20 07:40:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 227 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 272 transitions. [2021-11-20 07:40:52,613 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 272 transitions. Word has length 35 [2021-11-20 07:40:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:52,614 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 272 transitions. [2021-11-20 07:40:52,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 272 transitions. [2021-11-20 07:40:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-20 07:40:52,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:52,615 INFO L514 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] [2021-11-20 07:40:52,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-20 07:40:52,615 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:52,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:52,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921826, now seen corresponding path program 1 times [2021-11-20 07:40:52,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:52,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409604687] [2021-11-20 07:40:52,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:52,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:52,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:52,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409604687] [2021-11-20 07:40:52,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409604687] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:52,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:52,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 07:40:52,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316488601] [2021-11-20 07:40:52,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:52,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 07:40:52,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:52,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 07:40:52,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-11-20 07:40:52,837 INFO L87 Difference]: Start difference. First operand 228 states and 272 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:53,581 INFO L93 Difference]: Finished difference Result 400 states and 432 transitions. [2021-11-20 07:40:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 07:40:53,581 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-20 07:40:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:53,584 INFO L225 Difference]: With dead ends: 400 [2021-11-20 07:40:53,584 INFO L226 Difference]: Without dead ends: 400 [2021-11-20 07:40:53,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2021-11-20 07:40:53,585 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 745 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:53,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [745 Valid, 798 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 07:40:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-11-20 07:40:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 234. [2021-11-20 07:40:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 233 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2021-11-20 07:40:53,595 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 35 [2021-11-20 07:40:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:53,595 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2021-11-20 07:40:53,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2021-11-20 07:40:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 07:40:53,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:53,596 INFO L514 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] [2021-11-20 07:40:53,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-20 07:40:53,597 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash -470914463, now seen corresponding path program 1 times [2021-11-20 07:40:53,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:53,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446653500] [2021-11-20 07:40:53,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:53,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:53,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:53,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446653500] [2021-11-20 07:40:53,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446653500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:53,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:53,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 07:40:53,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384729954] [2021-11-20 07:40:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:53,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 07:40:53,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:53,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 07:40:53,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-20 07:40:53,891 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:54,877 INFO L93 Difference]: Finished difference Result 395 states and 427 transitions. [2021-11-20 07:40:54,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 07:40:54,878 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-20 07:40:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:54,880 INFO L225 Difference]: With dead ends: 395 [2021-11-20 07:40:54,880 INFO L226 Difference]: Without dead ends: 395 [2021-11-20 07:40:54,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2021-11-20 07:40:54,881 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 681 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:54,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [681 Valid, 1208 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-20 07:40:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-11-20 07:40:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 234. [2021-11-20 07:40:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 233 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 278 transitions. [2021-11-20 07:40:54,889 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 278 transitions. Word has length 37 [2021-11-20 07:40:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:54,890 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 278 transitions. [2021-11-20 07:40:54,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 278 transitions. [2021-11-20 07:40:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 07:40:54,891 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:54,891 INFO L514 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] [2021-11-20 07:40:54,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-20 07:40:54,891 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362969, now seen corresponding path program 1 times [2021-11-20 07:40:54,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:54,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688296784] [2021-11-20 07:40:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:54,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:54,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:54,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688296784] [2021-11-20 07:40:54,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688296784] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:54,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:54,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:40:54,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733431987] [2021-11-20 07:40:54,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:54,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:40:54,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:54,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:40:54,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:40:54,933 INFO L87 Difference]: Start difference. First operand 234 states and 278 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:55,073 INFO L93 Difference]: Finished difference Result 233 states and 277 transitions. [2021-11-20 07:40:55,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:40:55,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-20 07:40:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:55,076 INFO L225 Difference]: With dead ends: 233 [2021-11-20 07:40:55,077 INFO L226 Difference]: Without dead ends: 233 [2021-11-20 07:40:55,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:40:55,078 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:55,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 413 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:40:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-20 07:40:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-11-20 07:40:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.357843137254902) internal successors, (277), 232 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2021-11-20 07:40:55,086 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 37 [2021-11-20 07:40:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:55,086 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2021-11-20 07:40:55,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2021-11-20 07:40:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 07:40:55,087 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:55,087 INFO L514 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] [2021-11-20 07:40:55,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-20 07:40:55,088 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:55,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:55,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362968, now seen corresponding path program 1 times [2021-11-20 07:40:55,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:55,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692077614] [2021-11-20 07:40:55,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:55,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:55,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:55,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692077614] [2021-11-20 07:40:55,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692077614] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:55,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:55,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:40:55,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811789332] [2021-11-20 07:40:55,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:55,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:40:55,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:55,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:40:55,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:40:55,142 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:55,299 INFO L93 Difference]: Finished difference Result 232 states and 276 transitions. [2021-11-20 07:40:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:40:55,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-20 07:40:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:55,301 INFO L225 Difference]: With dead ends: 232 [2021-11-20 07:40:55,301 INFO L226 Difference]: Without dead ends: 232 [2021-11-20 07:40:55,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:40:55,302 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 2 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:55,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 410 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:40:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-11-20 07:40:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2021-11-20 07:40:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 231 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 276 transitions. [2021-11-20 07:40:55,309 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 276 transitions. Word has length 37 [2021-11-20 07:40:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:55,309 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 276 transitions. [2021-11-20 07:40:55,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 276 transitions. [2021-11-20 07:40:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 07:40:55,310 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:55,310 INFO L514 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] [2021-11-20 07:40:55,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-20 07:40:55,311 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1939172976, now seen corresponding path program 1 times [2021-11-20 07:40:55,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:55,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554792422] [2021-11-20 07:40:55,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:55,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:40:55,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:55,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554792422] [2021-11-20 07:40:55,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554792422] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:55,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:55,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:40:55,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929724424] [2021-11-20 07:40:55,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:55,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:40:55,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:55,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:40:55,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:40:55,414 INFO L87 Difference]: Start difference. First operand 232 states and 276 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:55,613 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2021-11-20 07:40:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:40:55,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-20 07:40:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:55,616 INFO L225 Difference]: With dead ends: 248 [2021-11-20 07:40:55,616 INFO L226 Difference]: Without dead ends: 248 [2021-11-20 07:40:55,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:40:55,617 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 58 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:55,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 528 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:40:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-11-20 07:40:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 241. [2021-11-20 07:40:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 240 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2021-11-20 07:40:55,623 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 37 [2021-11-20 07:40:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:55,624 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2021-11-20 07:40:55,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2021-11-20 07:40:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-20 07:40:55,625 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:55,625 INFO L514 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] [2021-11-20 07:40:55,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-20 07:40:55,626 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:55,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1413983143, now seen corresponding path program 1 times [2021-11-20 07:40:55,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:55,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400388207] [2021-11-20 07:40:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:55,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:40:55,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:55,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400388207] [2021-11-20 07:40:55,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400388207] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:55,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:55,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:40:55,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906401283] [2021-11-20 07:40:55,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:55,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:40:55,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:55,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:40:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:55,652 INFO L87 Difference]: Start difference. First operand 241 states and 285 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:55,660 INFO L93 Difference]: Finished difference Result 242 states and 286 transitions. [2021-11-20 07:40:55,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:40:55,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-20 07:40:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:55,662 INFO L225 Difference]: With dead ends: 242 [2021-11-20 07:40:55,662 INFO L226 Difference]: Without dead ends: 242 [2021-11-20 07:40:55,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:55,663 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:55,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:40:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-20 07:40:55,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-11-20 07:40:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 241 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 286 transitions. [2021-11-20 07:40:55,670 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 286 transitions. Word has length 39 [2021-11-20 07:40:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:55,670 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 286 transitions. [2021-11-20 07:40:55,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 286 transitions. [2021-11-20 07:40:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-20 07:40:55,671 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:55,671 INFO L514 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] [2021-11-20 07:40:55,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-20 07:40:55,672 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:55,673 INFO L85 PathProgramCache]: Analyzing trace with hash -407701739, now seen corresponding path program 1 times [2021-11-20 07:40:55,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:55,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581148317] [2021-11-20 07:40:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:55,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:40:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:40:55,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:40:55,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581148317] [2021-11-20 07:40:55,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581148317] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:40:55,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:40:55,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:40:55,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757028804] [2021-11-20 07:40:55,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:40:55,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:40:55,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:40:55,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:40:55,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:55,711 INFO L87 Difference]: Start difference. First operand 242 states and 286 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:40:55,750 INFO L93 Difference]: Finished difference Result 255 states and 290 transitions. [2021-11-20 07:40:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:40:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-20 07:40:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:40:55,752 INFO L225 Difference]: With dead ends: 255 [2021-11-20 07:40:55,752 INFO L226 Difference]: Without dead ends: 255 [2021-11-20 07:40:55,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:40:55,759 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 98 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:40:55,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 151 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:40:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-20 07:40:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 243. [2021-11-20 07:40:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 242 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 287 transitions. [2021-11-20 07:40:55,773 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 287 transitions. Word has length 39 [2021-11-20 07:40:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:40:55,774 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 287 transitions. [2021-11-20 07:40:55,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:40:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 287 transitions. [2021-11-20 07:40:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-20 07:40:55,775 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:40:55,775 INFO L514 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] [2021-11-20 07:40:55,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-20 07:40:55,776 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-11-20 07:40:55,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:40:55,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1645380794, now seen corresponding path program 1 times [2021-11-20 07:40:55,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:40:55,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101349318] [2021-11-20 07:40:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:40:55,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:40:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:40:55,796 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 07:40:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:40:55,848 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 07:40:55,848 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 07:40:55,850 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK (83 of 84 remaining) [2021-11-20 07:40:55,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (82 of 84 remaining) [2021-11-20 07:40:55,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (81 of 84 remaining) [2021-11-20 07:40:55,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (80 of 84 remaining) [2021-11-20 07:40:55,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (79 of 84 remaining) [2021-11-20 07:40:55,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (78 of 84 remaining) [2021-11-20 07:40:55,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (77 of 84 remaining) [2021-11-20 07:40:55,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (76 of 84 remaining) [2021-11-20 07:40:55,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (75 of 84 remaining) [2021-11-20 07:40:55,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (74 of 84 remaining) [2021-11-20 07:40:55,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (73 of 84 remaining) [2021-11-20 07:40:55,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (72 of 84 remaining) [2021-11-20 07:40:55,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (71 of 84 remaining) [2021-11-20 07:40:55,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (70 of 84 remaining) [2021-11-20 07:40:55,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (69 of 84 remaining) [2021-11-20 07:40:55,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (68 of 84 remaining) [2021-11-20 07:40:55,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (67 of 84 remaining) [2021-11-20 07:40:55,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (66 of 84 remaining) [2021-11-20 07:40:55,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (65 of 84 remaining) [2021-11-20 07:40:55,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (64 of 84 remaining) [2021-11-20 07:40:55,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (63 of 84 remaining) [2021-11-20 07:40:55,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (62 of 84 remaining) [2021-11-20 07:40:55,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (61 of 84 remaining) [2021-11-20 07:40:55,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (60 of 84 remaining) [2021-11-20 07:40:55,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (59 of 84 remaining) [2021-11-20 07:40:55,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (58 of 84 remaining) [2021-11-20 07:40:55,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (57 of 84 remaining) [2021-11-20 07:40:55,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (56 of 84 remaining) [2021-11-20 07:40:55,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (55 of 84 remaining) [2021-11-20 07:40:55,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (54 of 84 remaining) [2021-11-20 07:40:55,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (53 of 84 remaining) [2021-11-20 07:40:55,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (52 of 84 remaining) [2021-11-20 07:40:55,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (51 of 84 remaining) [2021-11-20 07:40:55,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (50 of 84 remaining) [2021-11-20 07:40:55,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (49 of 84 remaining) [2021-11-20 07:40:55,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (48 of 84 remaining) [2021-11-20 07:40:55,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (47 of 84 remaining) [2021-11-20 07:40:55,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (46 of 84 remaining) [2021-11-20 07:40:55,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (45 of 84 remaining) [2021-11-20 07:40:55,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (44 of 84 remaining) [2021-11-20 07:40:55,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (43 of 84 remaining) [2021-11-20 07:40:55,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (42 of 84 remaining) [2021-11-20 07:40:55,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (41 of 84 remaining) [2021-11-20 07:40:55,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (40 of 84 remaining) [2021-11-20 07:40:55,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (39 of 84 remaining) [2021-11-20 07:40:55,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (38 of 84 remaining) [2021-11-20 07:40:55,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (37 of 84 remaining) [2021-11-20 07:40:55,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (36 of 84 remaining) [2021-11-20 07:40:55,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (35 of 84 remaining) [2021-11-20 07:40:55,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (34 of 84 remaining) [2021-11-20 07:40:55,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (33 of 84 remaining) [2021-11-20 07:40:55,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK (32 of 84 remaining) [2021-11-20 07:40:55,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (31 of 84 remaining) [2021-11-20 07:40:55,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (30 of 84 remaining) [2021-11-20 07:40:55,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (29 of 84 remaining) [2021-11-20 07:40:55,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (28 of 84 remaining) [2021-11-20 07:40:55,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (27 of 84 remaining) [2021-11-20 07:40:55,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (26 of 84 remaining) [2021-11-20 07:40:55,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK (25 of 84 remaining) [2021-11-20 07:40:55,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (24 of 84 remaining) [2021-11-20 07:40:55,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (23 of 84 remaining) [2021-11-20 07:40:55,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (22 of 84 remaining) [2021-11-20 07:40:55,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (21 of 84 remaining) [2021-11-20 07:40:55,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK (20 of 84 remaining) [2021-11-20 07:40:55,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION (19 of 84 remaining) [2021-11-20 07:40:55,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION (18 of 84 remaining) [2021-11-20 07:40:55,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION (17 of 84 remaining) [2021-11-20 07:40:55,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (16 of 84 remaining) [2021-11-20 07:40:55,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK (15 of 84 remaining) [2021-11-20 07:40:55,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION (14 of 84 remaining) [2021-11-20 07:40:55,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION (13 of 84 remaining) [2021-11-20 07:40:55,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK (12 of 84 remaining) [2021-11-20 07:40:55,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION (11 of 84 remaining) [2021-11-20 07:40:55,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION (10 of 84 remaining) [2021-11-20 07:40:55,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK (9 of 84 remaining) [2021-11-20 07:40:55,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (8 of 84 remaining) [2021-11-20 07:40:55,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE (7 of 84 remaining) [2021-11-20 07:40:55,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE (6 of 84 remaining) [2021-11-20 07:40:55,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION (5 of 84 remaining) [2021-11-20 07:40:55,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION (4 of 84 remaining) [2021-11-20 07:40:55,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_FREE (3 of 84 remaining) [2021-11-20 07:40:55,870 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (2 of 84 remaining) [2021-11-20 07:40:55,870 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (1 of 84 remaining) [2021-11-20 07:40:55,870 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (0 of 84 remaining) [2021-11-20 07:40:55,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-20 07:40:55,874 INFO L732 BasicCegarLoop]: Path program 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] [2021-11-20 07:40:55,880 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 07:40:55,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:40:55 BoogieIcfgContainer [2021-11-20 07:40:55,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 07:40:55,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 07:40:55,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 07:40:55,949 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 07:40:55,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:40:38" (3/4) ... [2021-11-20 07:40:55,951 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-20 07:40:56,011 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 07:40:56,011 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 07:40:56,012 INFO L158 Benchmark]: Toolchain (without parser) took 18558.59ms. Allocated memory was 92.3MB in the beginning and 172.0MB in the end (delta: 79.7MB). Free memory was 56.4MB in the beginning and 131.4MB in the end (delta: -75.0MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2021-11-20 07:40:56,012 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 92.3MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:40:56,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.35ms. Allocated memory is still 92.3MB. Free memory was 56.4MB in the beginning and 57.3MB in the end (delta: -873.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 07:40:56,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.62ms. Allocated memory is still 92.3MB. Free memory was 57.3MB in the beginning and 55.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:40:56,013 INFO L158 Benchmark]: Boogie Preprocessor took 40.83ms. Allocated memory is still 92.3MB. Free memory was 55.2MB in the beginning and 53.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:40:56,014 INFO L158 Benchmark]: RCFGBuilder took 781.42ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 52.7MB in the beginning and 78.9MB in the end (delta: -26.2MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2021-11-20 07:40:56,019 INFO L158 Benchmark]: TraceAbstraction took 17058.58ms. Allocated memory was 111.1MB in the beginning and 172.0MB in the end (delta: 60.8MB). Free memory was 78.3MB in the beginning and 133.5MB in the end (delta: -55.2MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. [2021-11-20 07:40:56,019 INFO L158 Benchmark]: Witness Printer took 62.61ms. Allocated memory is still 172.0MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:40:56,023 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.27ms. Allocated memory is still 92.3MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.35ms. Allocated memory is still 92.3MB. Free memory was 56.4MB in the beginning and 57.3MB in the end (delta: -873.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.62ms. Allocated memory is still 92.3MB. Free memory was 57.3MB in the beginning and 55.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.83ms. Allocated memory is still 92.3MB. Free memory was 55.2MB in the beginning and 53.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 781.42ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 52.7MB in the beginning and 78.9MB in the end (delta: -26.2MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17058.58ms. Allocated memory was 111.1MB in the beginning and 172.0MB in the end (delta: 60.8MB). Free memory was 78.3MB in the beginning and 133.5MB in the end (delta: -55.2MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. * Witness Printer took 62.61ms. Allocated memory is still 172.0MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) VAL [list={-1:0}] [L1005] list->prev = ((void*)0) VAL [list={-1:0}] [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1031] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1039] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 200 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 31, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6016 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6016 mSDsluCounter, 13673 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 119 IncrementalHoareTripleChecker+Unchecked, 9590 mSDsCounter, 357 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6866 IncrementalHoareTripleChecker+Invalid, 7342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 357 mSolverCounterUnsat, 4083 mSDtfsCounter, 6866 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 348 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=30, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 1037 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 752 ConstructedInterpolants, 17 QuantifiedInterpolants, 7151 SizeOfPredicates, 9 NumberOfNonLiveVariables, 128 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 32 InterpolantComputations, 29 PerfectInterpolantSequences, 5/8 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! [2021-11-20 07:40:56,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da46d7-f49b-4558-90e6-774ccf2a22dc/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)