./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg --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 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:44:02,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:44:02,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:44:02,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:44:02,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:44:02,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:44:02,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:44:02,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:44:02,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:44:02,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:44:02,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:44:02,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:44:02,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:44:02,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:44:02,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:44:02,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:44:02,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:44:02,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:44:02,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:44:02,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:44:02,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:44:02,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:44:02,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:44:02,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:44:02,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:44:02,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:44:02,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:44:02,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:44:02,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:44:02,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:44:02,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:44:02,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:44:02,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:44:02,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:44:02,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:44:02,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:44:02,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:44:02,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:44:02,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:44:02,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:44:02,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:44:02,284 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-10-28 09:44:02,334 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:44:02,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:44:02,335 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:44:02,335 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:44:02,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:44:02,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:44:02,337 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:44:02,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:44:02,340 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:44:02,340 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 09:44:02,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:44:02,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:44:02,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:44:02,342 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-28 09:44:02,343 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-28 09:44:02,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:44:02,343 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-28 09:44:02,343 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:44:02,344 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:44:02,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:44:02,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:44:02,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:44:02,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:44:02,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:44:02,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:44:02,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:44:02,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:44:02,347 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:44:02,347 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_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/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_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg 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-10-28 09:44:02,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:44:02,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:44:02,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:44:02,742 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:44:02,743 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:44:02,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/forester-heap/dll-01-1.i [2021-10-28 09:44:02,844 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/data/edae48435/a1c72f5649084cdd9b280ae7c205e7c1/FLAGfbfdc50dd [2021-10-28 09:44:03,426 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:44:03,427 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i [2021-10-28 09:44:03,443 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/data/edae48435/a1c72f5649084cdd9b280ae7c205e7c1/FLAGfbfdc50dd [2021-10-28 09:44:03,714 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/data/edae48435/a1c72f5649084cdd9b280ae7c205e7c1 [2021-10-28 09:44:03,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:44:03,718 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-28 09:44:03,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:44:03,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:44:03,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:44:03,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:44:03" (1/1) ... [2021-10-28 09:44:03,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79da930c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:44:03, skipping insertion in model container [2021-10-28 09:44:03,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:44:03" (1/1) ... [2021-10-28 09:44:03,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:44:03,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:44:04,148 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2021-10-28 09:44:04,155 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2021-10-28 09:44:04,161 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2021-10-28 09:44:04,165 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2021-10-28 09:44:04,173 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2021-10-28 09:44:04,176 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2021-10-28 09:44:04,181 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2021-10-28 09:44:04,185 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2021-10-28 09:44:04,188 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2021-10-28 09:44:04,192 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2021-10-28 09:44:04,196 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2021-10-28 09:44:04,198 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2021-10-28 09:44:04,200 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2021-10-28 09:44:04,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:44:04,231 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:44:04,285 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2021-10-28 09:44:04,298 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2021-10-28 09:44:04,301 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2021-10-28 09:44:04,302 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2021-10-28 09:44:04,304 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2021-10-28 09:44:04,318 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2021-10-28 09:44:04,320 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2021-10-28 09:44:04,322 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2021-10-28 09:44:04,323 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2021-10-28 09:44:04,324 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2021-10-28 09:44:04,326 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2021-10-28 09:44:04,328 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2021-10-28 09:44:04,334 WARN L228 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_03843644-0293-477f-8a9b-d346750f778c/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2021-10-28 09:44:04,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:44:04,371 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:44:04,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:44:04 WrapperNode [2021-10-28 09:44:04,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:44:04,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:44:04,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:44:04,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:44:04,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:44:04" (1/1) ... [2021-10-28 09:44:04,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:44:04" (1/1) ... [2021-10-28 09:44:04,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:44:04" (1/1) ... [2021-10-28 09:44:04,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:44:04" (1/1) ... [2021-10-28 09:44:04,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:44:04" (1/1) ... [2021-10-28 09:44:04,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:44:04" (1/1) ... [2021-10-28 09:44:04,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:44:04" (1/1) ... [2021-10-28 09:44:04,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:44:04,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:44:04,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:44:04,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:44:04,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:44:04" (1/1) ... [2021-10-28 09:44:04,477 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:44:04,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:44:04,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:44:04,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:44:04,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-28 09:44:04,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:44:04,550 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-28 09:44:04,550 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-28 09:44:04,550 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-10-28 09:44:04,551 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-10-28 09:44:04,551 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-10-28 09:44:04,551 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-10-28 09:44:04,551 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-10-28 09:44:04,551 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-10-28 09:44:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-10-28 09:44:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-10-28 09:44:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-10-28 09:44:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-10-28 09:44:04,553 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-10-28 09:44:04,553 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-10-28 09:44:04,553 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-10-28 09:44:04,553 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-10-28 09:44:04,553 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-10-28 09:44:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-10-28 09:44:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-10-28 09:44:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-10-28 09:44:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-10-28 09:44:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-10-28 09:44:04,555 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-10-28 09:44:04,555 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-10-28 09:44:04,555 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-10-28 09:44:04,555 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-10-28 09:44:04,555 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-10-28 09:44:04,556 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-10-28 09:44:04,556 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-10-28 09:44:04,556 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-10-28 09:44:04,556 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-10-28 09:44:04,557 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-10-28 09:44:04,557 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-10-28 09:44:04,557 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-10-28 09:44:04,557 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-10-28 09:44:04,557 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-10-28 09:44:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-10-28 09:44:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-10-28 09:44:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-10-28 09:44:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-10-28 09:44:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-10-28 09:44:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-10-28 09:44:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-10-28 09:44:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-10-28 09:44:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-10-28 09:44:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-10-28 09:44:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-10-28 09:44:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-10-28 09:44:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-10-28 09:44:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-10-28 09:44:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-10-28 09:44:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-10-28 09:44:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-10-28 09:44:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-10-28 09:44:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-10-28 09:44:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-10-28 09:44:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-10-28 09:44:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-10-28 09:44:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-10-28 09:44:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-10-28 09:44:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-10-28 09:44:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-28 09:44:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-10-28 09:44:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-10-28 09:44:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-10-28 09:44:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-10-28 09:44:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-10-28 09:44:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-10-28 09:44:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-10-28 09:44:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-10-28 09:44:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-10-28 09:44:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-10-28 09:44:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-10-28 09:44:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-10-28 09:44:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-10-28 09:44:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-10-28 09:44:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-10-28 09:44:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-10-28 09:44:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-10-28 09:44:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-10-28 09:44:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-10-28 09:44:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-10-28 09:44:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-10-28 09:44:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-10-28 09:44:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-10-28 09:44:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-10-28 09:44:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-10-28 09:44:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-10-28 09:44:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-10-28 09:44:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-10-28 09:44:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-10-28 09:44:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-10-28 09:44:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-10-28 09:44:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-10-28 09:44:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-10-28 09:44:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-10-28 09:44:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-10-28 09:44:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-10-28 09:44:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-10-28 09:44:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-10-28 09:44:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-10-28 09:44:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-10-28 09:44:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-10-28 09:44:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-10-28 09:44:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-10-28 09:44:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-28 09:44:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-28 09:44:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-10-28 09:44:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-10-28 09:44:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-28 09:44:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:44:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-28 09:44:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-28 09:44:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-28 09:44:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-28 09:44:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 09:44:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-28 09:44:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:44:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:44:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 09:44:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 09:44:05,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:44:05,534 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-10-28 09:44:05,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:44:05 BoogieIcfgContainer [2021-10-28 09:44:05,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:44:05,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:44:05,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:44:05,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:44:05,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:44:03" (1/3) ... [2021-10-28 09:44:05,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6785f3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:44:05, skipping insertion in model container [2021-10-28 09:44:05,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:44:04" (2/3) ... [2021-10-28 09:44:05,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6785f3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:44:05, skipping insertion in model container [2021-10-28 09:44:05,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:44:05" (3/3) ... [2021-10-28 09:44:05,551 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2021-10-28 09:44:05,561 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:44:05,562 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2021-10-28 09:44:05,626 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:44:05,631 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-10-28 09:44:05,632 INFO L340 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2021-10-28 09:44:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 116 states have (on average 2.1810344827586206) internal successors, (253), 200 states have internal predecessors, (253), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-28 09:44:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 09:44:05,675 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:05,676 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:05,676 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1164341321, now seen corresponding path program 1 times [2021-10-28 09:44:05,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:05,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248476475] [2021-10-28 09:44:05,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:05,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:05,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:05,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:05,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248476475] [2021-10-28 09:44:05,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248476475] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:05,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:05,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:44:05,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61949863] [2021-10-28 09:44:05,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:44:05,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:05,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:44:05,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:05,977 INFO L87 Difference]: Start difference. First operand has 205 states, 116 states have (on average 2.1810344827586206) internal successors, (253), 200 states have internal predecessors, (253), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:06,571 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2021-10-28 09:44:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:44:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-10-28 09:44:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:06,591 INFO L225 Difference]: With dead ends: 205 [2021-10-28 09:44:06,592 INFO L226 Difference]: Without dead ends: 201 [2021-10-28 09:44:06,594 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-28 09:44:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2021-10-28 09:44:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 118 states have (on average 1.7372881355932204) internal successors, (205), 192 states have internal predecessors, (205), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2021-10-28 09:44:06,680 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 7 [2021-10-28 09:44:06,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:06,681 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2021-10-28 09:44:06,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2021-10-28 09:44:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 09:44:06,682 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:06,682 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:06,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:44:06,683 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:06,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1164341322, now seen corresponding path program 1 times [2021-10-28 09:44:06,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:06,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008032376] [2021-10-28 09:44:06,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:06,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:06,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:06,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:06,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008032376] [2021-10-28 09:44:06,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008032376] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:06,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:06,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:44:06,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898439974] [2021-10-28 09:44:06,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:44:06,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:06,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:44:06,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:06,835 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:07,261 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2021-10-28 09:44:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:44:07,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-10-28 09:44:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:07,264 INFO L225 Difference]: With dead ends: 225 [2021-10-28 09:44:07,265 INFO L226 Difference]: Without dead ends: 225 [2021-10-28 09:44:07,265 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-10-28 09:44:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 205. [2021-10-28 09:44:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 135 states have (on average 1.6666666666666667) internal successors, (225), 201 states have internal predecessors, (225), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 228 transitions. [2021-10-28 09:44:07,284 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 228 transitions. Word has length 7 [2021-10-28 09:44:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:07,285 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 228 transitions. [2021-10-28 09:44:07,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 228 transitions. [2021-10-28 09:44:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-28 09:44:07,286 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:07,286 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:07,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:44:07,287 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr4ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:07,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash 736394790, now seen corresponding path program 1 times [2021-10-28 09:44:07,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:07,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716992156] [2021-10-28 09:44:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:07,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:07,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:07,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:07,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716992156] [2021-10-28 09:44:07,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716992156] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:07,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:07,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:44:07,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056365002] [2021-10-28 09:44:07,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:44:07,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:44:07,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:07,378 INFO L87 Difference]: Start difference. First operand 205 states and 228 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:07,724 INFO L93 Difference]: Finished difference Result 220 states and 231 transitions. [2021-10-28 09:44:07,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:44:07,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-10-28 09:44:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:07,727 INFO L225 Difference]: With dead ends: 220 [2021-10-28 09:44:07,727 INFO L226 Difference]: Without dead ends: 220 [2021-10-28 09:44:07,728 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-10-28 09:44:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2021-10-28 09:44:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 134 states have (on average 1.6567164179104477) internal successors, (222), 199 states have internal predecessors, (222), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2021-10-28 09:44:07,743 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 10 [2021-10-28 09:44:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:07,744 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2021-10-28 09:44:07,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2021-10-28 09:44:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 09:44:07,745 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:07,745 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:07,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:44:07,746 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:07,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash 712243896, now seen corresponding path program 1 times [2021-10-28 09:44:07,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:07,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117362605] [2021-10-28 09:44:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:07,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:07,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:07,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:07,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117362605] [2021-10-28 09:44:07,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117362605] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:07,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:07,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:44:07,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860189663] [2021-10-28 09:44:07,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:44:07,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:07,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:44:07,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:44:07,894 INFO L87 Difference]: Start difference. First operand 203 states and 225 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:08,310 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2021-10-28 09:44:08,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:44:08,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-10-28 09:44:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:08,312 INFO L225 Difference]: With dead ends: 202 [2021-10-28 09:44:08,312 INFO L226 Difference]: Without dead ends: 202 [2021-10-28 09:44:08,313 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:44:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-28 09:44:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-10-28 09:44:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 198 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2021-10-28 09:44:08,325 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 16 [2021-10-28 09:44:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:08,325 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2021-10-28 09:44:08,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2021-10-28 09:44:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 09:44:08,326 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:08,327 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:08,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:44:08,327 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr12REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash 712243897, now seen corresponding path program 1 times [2021-10-28 09:44:08,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:08,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002928909] [2021-10-28 09:44:08,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:08,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:08,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:08,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:08,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002928909] [2021-10-28 09:44:08,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002928909] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:08,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:08,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:44:08,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295279084] [2021-10-28 09:44:08,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:44:08,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:08,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:44:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:44:08,498 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:08,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:08,932 INFO L93 Difference]: Finished difference Result 201 states and 223 transitions. [2021-10-28 09:44:08,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:44:08,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-10-28 09:44:08,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:08,935 INFO L225 Difference]: With dead ends: 201 [2021-10-28 09:44:08,936 INFO L226 Difference]: Without dead ends: 201 [2021-10-28 09:44:08,936 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:44:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-28 09:44:08,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-10-28 09:44:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 197 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2021-10-28 09:44:08,947 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 16 [2021-10-28 09:44:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:08,948 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2021-10-28 09:44:08,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2021-10-28 09:44:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 09:44:08,949 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:08,950 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:08,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:44:08,950 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr21ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1298127146, now seen corresponding path program 1 times [2021-10-28 09:44:08,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:08,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486856434] [2021-10-28 09:44:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:08,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:09,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:09,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486856434] [2021-10-28 09:44:09,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486856434] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:09,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:09,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:44:09,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123718881] [2021-10-28 09:44:09,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:44:09,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:09,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:44:09,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:09,016 INFO L87 Difference]: Start difference. First operand 201 states and 223 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:09,263 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2021-10-28 09:44:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:44:09,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-10-28 09:44:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:09,266 INFO L225 Difference]: With dead ends: 202 [2021-10-28 09:44:09,266 INFO L226 Difference]: Without dead ends: 202 [2021-10-28 09:44:09,266 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-28 09:44:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-10-28 09:44:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 135 states have (on average 1.637037037037037) internal successors, (221), 198 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2021-10-28 09:44:09,274 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 18 [2021-10-28 09:44:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:09,275 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2021-10-28 09:44:09,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2021-10-28 09:44:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 09:44:09,276 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:09,277 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:09,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:44:09,277 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1319486370, now seen corresponding path program 1 times [2021-10-28 09:44:09,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:09,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234503981] [2021-10-28 09:44:09,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:09,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:09,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:09,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:09,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234503981] [2021-10-28 09:44:09,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234503981] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:09,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:09,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:44:09,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474666321] [2021-10-28 09:44:09,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:44:09,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:09,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:44:09,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:44:09,462 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:10,001 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2021-10-28 09:44:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:44:10,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-10-28 09:44:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:10,004 INFO L225 Difference]: With dead ends: 202 [2021-10-28 09:44:10,004 INFO L226 Difference]: Without dead ends: 202 [2021-10-28 09:44:10,005 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:44:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-28 09:44:10,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2021-10-28 09:44:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 135 states have (on average 1.6296296296296295) internal successors, (220), 197 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2021-10-28 09:44:10,014 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 19 [2021-10-28 09:44:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:10,015 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2021-10-28 09:44:10,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2021-10-28 09:44:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 09:44:10,017 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:10,017 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:10,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:44:10,017 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1319486371, now seen corresponding path program 1 times [2021-10-28 09:44:10,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:10,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366942861] [2021-10-28 09:44:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:10,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:10,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:10,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366942861] [2021-10-28 09:44:10,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366942861] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:10,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:10,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:44:10,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570874663] [2021-10-28 09:44:10,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:44:10,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:10,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:44:10,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:44:10,314 INFO L87 Difference]: Start difference. First operand 201 states and 223 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:11,031 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2021-10-28 09:44:11,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:44:11,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-10-28 09:44:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:11,033 INFO L225 Difference]: With dead ends: 201 [2021-10-28 09:44:11,033 INFO L226 Difference]: Without dead ends: 201 [2021-10-28 09:44:11,034 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:44:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-28 09:44:11,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2021-10-28 09:44:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 135 states have (on average 1.6222222222222222) internal successors, (219), 196 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2021-10-28 09:44:11,042 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 19 [2021-10-28 09:44:11,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:11,042 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2021-10-28 09:44:11,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2021-10-28 09:44:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 09:44:11,044 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:11,044 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:11,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:44:11,044 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr21ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:11,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:11,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1961307727, now seen corresponding path program 1 times [2021-10-28 09:44:11,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:11,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800219990] [2021-10-28 09:44:11,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:11,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:11,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:11,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:11,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800219990] [2021-10-28 09:44:11,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800219990] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:11,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:11,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:44:11,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602568532] [2021-10-28 09:44:11,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:44:11,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:11,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:44:11,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:44:11,180 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:11,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:11,704 INFO L93 Difference]: Finished difference Result 287 states and 315 transitions. [2021-10-28 09:44:11,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 09:44:11,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-10-28 09:44:11,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:11,707 INFO L225 Difference]: With dead ends: 287 [2021-10-28 09:44:11,707 INFO L226 Difference]: Without dead ends: 287 [2021-10-28 09:44:11,708 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:44:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-10-28 09:44:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 197. [2021-10-28 09:44:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 193 states have internal predecessors, (216), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2021-10-28 09:44:11,716 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 20 [2021-10-28 09:44:11,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:11,717 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2021-10-28 09:44:11,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:11,717 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2021-10-28 09:44:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 09:44:11,718 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:11,719 INFO L513 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-10-28 09:44:11,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:44:11,719 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2122514828, now seen corresponding path program 1 times [2021-10-28 09:44:11,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:11,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834010019] [2021-10-28 09:44:11,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:11,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:11,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:11,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:11,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834010019] [2021-10-28 09:44:11,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834010019] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:11,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:11,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:44:11,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974447149] [2021-10-28 09:44:11,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:44:11,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:11,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:44:11,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:44:11,819 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:12,208 INFO L93 Difference]: Finished difference Result 288 states and 315 transitions. [2021-10-28 09:44:12,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:44:12,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-10-28 09:44:12,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:12,211 INFO L225 Difference]: With dead ends: 288 [2021-10-28 09:44:12,212 INFO L226 Difference]: Without dead ends: 288 [2021-10-28 09:44:12,212 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:44:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-10-28 09:44:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 200. [2021-10-28 09:44:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 196 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2021-10-28 09:44:12,220 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 22 [2021-10-28 09:44:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:12,221 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2021-10-28 09:44:12,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2021-10-28 09:44:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-28 09:44:12,223 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:12,223 INFO L513 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] [2021-10-28 09:44:12,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:44:12,224 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:12,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:12,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1029388569, now seen corresponding path program 1 times [2021-10-28 09:44:12,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:12,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276716430] [2021-10-28 09:44:12,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:12,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:12,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:12,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:12,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276716430] [2021-10-28 09:44:12,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276716430] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:12,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:12,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:44:12,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951810288] [2021-10-28 09:44:12,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:44:12,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:12,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:44:12,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:44:12,296 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:12,669 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2021-10-28 09:44:12,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:44:12,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-10-28 09:44:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:12,671 INFO L225 Difference]: With dead ends: 195 [2021-10-28 09:44:12,671 INFO L226 Difference]: Without dead ends: 195 [2021-10-28 09:44:12,672 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:44:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-10-28 09:44:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2021-10-28 09:44:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 138 states have (on average 1.5144927536231885) internal successors, (209), 186 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2021-10-28 09:44:12,679 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 24 [2021-10-28 09:44:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:12,679 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2021-10-28 09:44:12,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2021-10-28 09:44:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-28 09:44:12,681 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:12,681 INFO L513 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] [2021-10-28 09:44:12,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:44:12,682 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr23REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:12,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1029388570, now seen corresponding path program 1 times [2021-10-28 09:44:12,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:12,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528043916] [2021-10-28 09:44:12,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:12,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:12,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:12,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:12,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528043916] [2021-10-28 09:44:12,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528043916] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:12,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:12,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:44:12,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283919994] [2021-10-28 09:44:12,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:44:12,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:12,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:44:12,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:44:12,777 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:13,193 INFO L93 Difference]: Finished difference Result 251 states and 266 transitions. [2021-10-28 09:44:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:44:13,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-10-28 09:44:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:13,196 INFO L225 Difference]: With dead ends: 251 [2021-10-28 09:44:13,196 INFO L226 Difference]: Without dead ends: 251 [2021-10-28 09:44:13,197 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:44:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-10-28 09:44:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 214. [2021-10-28 09:44:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 210 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2021-10-28 09:44:13,208 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 24 [2021-10-28 09:44:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:13,209 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2021-10-28 09:44:13,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2021-10-28 09:44:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-28 09:44:13,215 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:13,215 INFO L513 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] [2021-10-28 09:44:13,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:44:13,216 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr51ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:13,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:13,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1399993902, now seen corresponding path program 1 times [2021-10-28 09:44:13,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:13,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855088026] [2021-10-28 09:44:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:13,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:13,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:13,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:13,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855088026] [2021-10-28 09:44:13,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855088026] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:13,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:13,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:44:13,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556107852] [2021-10-28 09:44:13,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:44:13,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:13,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:44:13,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:44:13,306 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:13,628 INFO L93 Difference]: Finished difference Result 246 states and 260 transitions. [2021-10-28 09:44:13,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:44:13,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-10-28 09:44:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:13,630 INFO L225 Difference]: With dead ends: 246 [2021-10-28 09:44:13,630 INFO L226 Difference]: Without dead ends: 246 [2021-10-28 09:44:13,631 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:44:13,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-28 09:44:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 212. [2021-10-28 09:44:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.515527950310559) internal successors, (244), 208 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 247 transitions. [2021-10-28 09:44:13,640 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 247 transitions. Word has length 26 [2021-10-28 09:44:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:13,640 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 247 transitions. [2021-10-28 09:44:13,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 247 transitions. [2021-10-28 09:44:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 09:44:13,645 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:13,645 INFO L513 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-10-28 09:44:13,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:44:13,646 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr26REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:13,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash 448442135, now seen corresponding path program 1 times [2021-10-28 09:44:13,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:13,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533852807] [2021-10-28 09:44:13,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:13,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:13,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:13,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:13,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533852807] [2021-10-28 09:44:13,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533852807] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:13,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:13,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:44:13,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709229149] [2021-10-28 09:44:13,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:44:13,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:44:13,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:44:13,737 INFO L87 Difference]: Start difference. First operand 212 states and 247 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:14,032 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2021-10-28 09:44:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:44:14,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-10-28 09:44:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:14,035 INFO L225 Difference]: With dead ends: 211 [2021-10-28 09:44:14,035 INFO L226 Difference]: Without dead ends: 211 [2021-10-28 09:44:14,036 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:44:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-10-28 09:44:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2021-10-28 09:44:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.5031055900621118) internal successors, (242), 207 states have internal predecessors, (242), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 245 transitions. [2021-10-28 09:44:14,043 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 245 transitions. Word has length 27 [2021-10-28 09:44:14,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:14,043 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 245 transitions. [2021-10-28 09:44:14,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 245 transitions. [2021-10-28 09:44:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 09:44:14,044 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:14,044 INFO L513 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-10-28 09:44:14,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:44:14,044 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr27REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:14,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:14,045 INFO L85 PathProgramCache]: Analyzing trace with hash 448442136, now seen corresponding path program 1 times [2021-10-28 09:44:14,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:14,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167953468] [2021-10-28 09:44:14,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:14,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:14,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:14,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167953468] [2021-10-28 09:44:14,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167953468] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:14,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:14,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:44:14,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509484791] [2021-10-28 09:44:14,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:44:14,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:14,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:44:14,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:44:14,142 INFO L87 Difference]: Start difference. First operand 211 states and 245 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:14,430 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2021-10-28 09:44:14,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:44:14,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-10-28 09:44:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:14,432 INFO L225 Difference]: With dead ends: 210 [2021-10-28 09:44:14,432 INFO L226 Difference]: Without dead ends: 210 [2021-10-28 09:44:14,432 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:44:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-28 09:44:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-10-28 09:44:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 206 states have internal predecessors, (240), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 243 transitions. [2021-10-28 09:44:14,439 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 243 transitions. Word has length 27 [2021-10-28 09:44:14,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:14,440 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 243 transitions. [2021-10-28 09:44:14,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 243 transitions. [2021-10-28 09:44:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 09:44:14,451 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:14,451 INFO L513 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] [2021-10-28 09:44:14,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:44:14,452 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr30REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash -784939815, now seen corresponding path program 1 times [2021-10-28 09:44:14,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:14,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402094295] [2021-10-28 09:44:14,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:14,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:14,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:14,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:14,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402094295] [2021-10-28 09:44:14,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402094295] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:14,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:14,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:44:14,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611401847] [2021-10-28 09:44:14,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:44:14,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:14,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:44:14,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:44:14,570 INFO L87 Difference]: Start difference. First operand 210 states and 243 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:15,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:15,151 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2021-10-28 09:44:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:44:15,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-10-28 09:44:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:15,153 INFO L225 Difference]: With dead ends: 210 [2021-10-28 09:44:15,153 INFO L226 Difference]: Without dead ends: 210 [2021-10-28 09:44:15,154 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-10-28 09:44:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-28 09:44:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2021-10-28 09:44:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 161 states have (on average 1.484472049689441) internal successors, (239), 205 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 242 transitions. [2021-10-28 09:44:15,161 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 242 transitions. Word has length 31 [2021-10-28 09:44:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:15,161 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 242 transitions. [2021-10-28 09:44:15,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 242 transitions. [2021-10-28 09:44:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 09:44:15,162 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:15,163 INFO L513 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] [2021-10-28 09:44:15,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:44:15,163 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr31REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:15,165 INFO L85 PathProgramCache]: Analyzing trace with hash -784939814, now seen corresponding path program 1 times [2021-10-28 09:44:15,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:15,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969343194] [2021-10-28 09:44:15,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:15,166 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:15,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:15,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:15,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969343194] [2021-10-28 09:44:15,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969343194] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:15,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:15,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:44:15,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078521990] [2021-10-28 09:44:15,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 09:44:15,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:15,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 09:44:15,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-28 09:44:15,370 INFO L87 Difference]: Start difference. First operand 209 states and 242 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:16,216 INFO L93 Difference]: Finished difference Result 202 states and 234 transitions. [2021-10-28 09:44:16,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-28 09:44:16,217 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-10-28 09:44:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:16,218 INFO L225 Difference]: With dead ends: 202 [2021-10-28 09:44:16,218 INFO L226 Difference]: Without dead ends: 202 [2021-10-28 09:44:16,219 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-10-28 09:44:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-28 09:44:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2021-10-28 09:44:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 187 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 223 transitions. [2021-10-28 09:44:16,226 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 223 transitions. Word has length 31 [2021-10-28 09:44:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:16,227 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 223 transitions. [2021-10-28 09:44:16,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 223 transitions. [2021-10-28 09:44:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 09:44:16,228 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:16,228 INFO L513 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] [2021-10-28 09:44:16,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:44:16,228 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr63ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:16,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:16,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1236512538, now seen corresponding path program 1 times [2021-10-28 09:44:16,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:16,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801142742] [2021-10-28 09:44:16,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:16,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:16,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:16,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:16,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801142742] [2021-10-28 09:44:16,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801142742] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:16,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:16,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:44:16,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964816300] [2021-10-28 09:44:16,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:44:16,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:16,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:44:16,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:16,282 INFO L87 Difference]: Start difference. First operand 191 states and 223 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:16,510 INFO L93 Difference]: Finished difference Result 264 states and 311 transitions. [2021-10-28 09:44:16,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:44:16,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-10-28 09:44:16,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:16,519 INFO L225 Difference]: With dead ends: 264 [2021-10-28 09:44:16,519 INFO L226 Difference]: Without dead ends: 264 [2021-10-28 09:44:16,520 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-28 09:44:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 197. [2021-10-28 09:44:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.4339622641509433) internal successors, (228), 193 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 231 transitions. [2021-10-28 09:44:16,530 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 231 transitions. Word has length 32 [2021-10-28 09:44:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:16,530 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 231 transitions. [2021-10-28 09:44:16,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 231 transitions. [2021-10-28 09:44:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 09:44:16,532 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:16,532 INFO L513 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] [2021-10-28 09:44:16,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 09:44:16,533 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr54ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:16,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:16,533 INFO L85 PathProgramCache]: Analyzing trace with hash -322828341, now seen corresponding path program 1 times [2021-10-28 09:44:16,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:16,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877349827] [2021-10-28 09:44:16,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:16,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:16,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:16,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:16,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877349827] [2021-10-28 09:44:16,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877349827] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:16,608 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:16,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:44:16,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048504641] [2021-10-28 09:44:16,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:44:16,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:16,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:44:16,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:16,611 INFO L87 Difference]: Start difference. First operand 197 states and 231 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:16,820 INFO L93 Difference]: Finished difference Result 195 states and 228 transitions. [2021-10-28 09:44:16,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:44:16,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-10-28 09:44:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:16,822 INFO L225 Difference]: With dead ends: 195 [2021-10-28 09:44:16,822 INFO L226 Difference]: Without dead ends: 195 [2021-10-28 09:44:16,823 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-10-28 09:44:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-10-28 09:44:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 158 states have (on average 1.4240506329113924) internal successors, (225), 191 states have internal predecessors, (225), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 228 transitions. [2021-10-28 09:44:16,830 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 228 transitions. Word has length 33 [2021-10-28 09:44:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:16,831 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 228 transitions. [2021-10-28 09:44:16,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 228 transitions. [2021-10-28 09:44:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 09:44:16,832 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:16,832 INFO L513 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] [2021-10-28 09:44:16,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 09:44:16,833 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr32ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:16,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1587084985, now seen corresponding path program 1 times [2021-10-28 09:44:16,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:16,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65759239] [2021-10-28 09:44:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:16,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:17,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:17,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65759239] [2021-10-28 09:44:17,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65759239] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:17,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:17,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 09:44:17,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815378922] [2021-10-28 09:44:17,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 09:44:17,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:17,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 09:44:17,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-28 09:44:17,020 INFO L87 Difference]: Start difference. First operand 195 states and 228 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:17,643 INFO L93 Difference]: Finished difference Result 202 states and 235 transitions. [2021-10-28 09:44:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-28 09:44:17,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-10-28 09:44:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:17,645 INFO L225 Difference]: With dead ends: 202 [2021-10-28 09:44:17,645 INFO L226 Difference]: Without dead ends: 202 [2021-10-28 09:44:17,645 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-10-28 09:44:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-28 09:44:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2021-10-28 09:44:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.4166666666666667) internal successors, (221), 187 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 224 transitions. [2021-10-28 09:44:17,651 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 224 transitions. Word has length 33 [2021-10-28 09:44:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:17,652 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 224 transitions. [2021-10-28 09:44:17,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 224 transitions. [2021-10-28 09:44:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 09:44:17,653 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:17,653 INFO L513 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] [2021-10-28 09:44:17,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 09:44:17,653 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr55REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:17,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:17,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1417739633, now seen corresponding path program 1 times [2021-10-28 09:44:17,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:17,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511616754] [2021-10-28 09:44:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:17,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:17,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:17,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:17,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511616754] [2021-10-28 09:44:17,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511616754] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:17,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:17,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:44:17,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989835917] [2021-10-28 09:44:17,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:44:17,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:17,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:44:17,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:44:17,780 INFO L87 Difference]: Start difference. First operand 191 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:18,279 INFO L93 Difference]: Finished difference Result 295 states and 336 transitions. [2021-10-28 09:44:18,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:44:18,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-10-28 09:44:18,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:18,281 INFO L225 Difference]: With dead ends: 295 [2021-10-28 09:44:18,281 INFO L226 Difference]: Without dead ends: 295 [2021-10-28 09:44:18,282 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:44:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-10-28 09:44:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 203. [2021-10-28 09:44:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 168 states have (on average 1.3928571428571428) internal successors, (234), 199 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 237 transitions. [2021-10-28 09:44:18,290 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 237 transitions. Word has length 34 [2021-10-28 09:44:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:18,290 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 237 transitions. [2021-10-28 09:44:18,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 237 transitions. [2021-10-28 09:44:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 09:44:18,291 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:18,292 INFO L513 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, 1, 1, 1, 1] [2021-10-28 09:44:18,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 09:44:18,292 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:18,293 INFO L85 PathProgramCache]: Analyzing trace with hash -477422014, now seen corresponding path program 1 times [2021-10-28 09:44:18,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:18,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628365350] [2021-10-28 09:44:18,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:18,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:18,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:18,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:18,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628365350] [2021-10-28 09:44:18,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628365350] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:44:18,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124504653] [2021-10-28 09:44:18,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:18,424 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:44:18,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:44:18,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:44:18,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 09:44:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:18,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 21 conjunts are in the unsatisfiable core [2021-10-28 09:44:18,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:44:18,703 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-10-28 09:44:18,708 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-10-28 09:44:18,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 09:44:18,749 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-10-28 09:44:18,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 09:44:18,759 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-10-28 09:44:18,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 09:44:18,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 09:44:18,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 09:44:18,971 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-28 09:44:18,974 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-10-28 09:44:18,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 09:44:18,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 09:44:18,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 09:44:18,989 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-10-28 09:44:19,603 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-10-28 09:44:19,604 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-10-28 09:44:19,628 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-10-28 09:44:19,628 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-10-28 09:44:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:19,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124504653] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:44:19,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:44:19,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2021-10-28 09:44:19,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92293476] [2021-10-28 09:44:19,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:44:19,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:19,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:44:19,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:44:19,652 INFO L87 Difference]: Start difference. First operand 203 states and 237 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:20,331 INFO L93 Difference]: Finished difference Result 344 states and 376 transitions. [2021-10-28 09:44:20,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:44:20,332 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-10-28 09:44:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:20,334 INFO L225 Difference]: With dead ends: 344 [2021-10-28 09:44:20,334 INFO L226 Difference]: Without dead ends: 344 [2021-10-28 09:44:20,335 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2021-10-28 09:44:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-10-28 09:44:20,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 231. [2021-10-28 09:44:20,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 196 states have (on average 1.403061224489796) internal successors, (275), 227 states have internal predecessors, (275), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2021-10-28 09:44:20,342 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 36 [2021-10-28 09:44:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:20,342 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2021-10-28 09:44:20,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2021-10-28 09:44:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:44:20,343 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:20,343 INFO L513 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-10-28 09:44:20,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-28 09:44:20,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-10-28 09:44:20,544 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr55REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:20,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:20,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1233959113, now seen corresponding path program 1 times [2021-10-28 09:44:20,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:20,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887270714] [2021-10-28 09:44:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:20,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:20,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:20,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:20,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887270714] [2021-10-28 09:44:20,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887270714] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:20,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:20,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 09:44:20,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251034187] [2021-10-28 09:44:20,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:44:20,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:20,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:44:20,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:44:20,696 INFO L87 Difference]: Start difference. First operand 231 states and 278 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:21,350 INFO L93 Difference]: Finished difference Result 338 states and 376 transitions. [2021-10-28 09:44:21,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:44:21,350 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-10-28 09:44:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:21,352 INFO L225 Difference]: With dead ends: 338 [2021-10-28 09:44:21,352 INFO L226 Difference]: Without dead ends: 338 [2021-10-28 09:44:21,352 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-28 09:44:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-28 09:44:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 232. [2021-10-28 09:44:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 199 states have (on average 1.3718592964824121) internal successors, (273), 228 states have internal predecessors, (273), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 276 transitions. [2021-10-28 09:44:21,359 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 276 transitions. Word has length 39 [2021-10-28 09:44:21,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:21,360 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 276 transitions. [2021-10-28 09:44:21,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 276 transitions. [2021-10-28 09:44:21,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:44:21,361 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:21,361 INFO L513 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-10-28 09:44:21,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 09:44:21,361 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr56REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1233959114, now seen corresponding path program 1 times [2021-10-28 09:44:21,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:21,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956542087] [2021-10-28 09:44:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:21,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:21,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:21,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:21,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956542087] [2021-10-28 09:44:21,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956542087] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:21,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:21,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 09:44:21,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653669273] [2021-10-28 09:44:21,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:44:21,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:21,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:44:21,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:44:21,630 INFO L87 Difference]: Start difference. First operand 232 states and 276 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:22,710 INFO L93 Difference]: Finished difference Result 404 states and 436 transitions. [2021-10-28 09:44:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 09:44:22,710 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-10-28 09:44:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:22,713 INFO L225 Difference]: With dead ends: 404 [2021-10-28 09:44:22,713 INFO L226 Difference]: Without dead ends: 404 [2021-10-28 09:44:22,714 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2021-10-28 09:44:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-10-28 09:44:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 238. [2021-10-28 09:44:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 205 states have (on average 1.3658536585365855) internal successors, (280), 234 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 283 transitions. [2021-10-28 09:44:22,722 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 283 transitions. Word has length 39 [2021-10-28 09:44:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:22,723 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 283 transitions. [2021-10-28 09:44:22,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 283 transitions. [2021-10-28 09:44:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 09:44:22,724 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:22,724 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:22,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 09:44:22,724 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr68ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:22,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:22,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1461137672, now seen corresponding path program 1 times [2021-10-28 09:44:22,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:22,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862039518] [2021-10-28 09:44:22,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:22,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:22,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 09:44:22,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:22,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862039518] [2021-10-28 09:44:22,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862039518] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:22,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:22,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:44:22,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752986221] [2021-10-28 09:44:22,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:44:22,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:44:22,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:44:22,829 INFO L87 Difference]: Start difference. First operand 238 states and 283 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:23,169 INFO L93 Difference]: Finished difference Result 254 states and 299 transitions. [2021-10-28 09:44:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:44:23,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-10-28 09:44:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:23,173 INFO L225 Difference]: With dead ends: 254 [2021-10-28 09:44:23,173 INFO L226 Difference]: Without dead ends: 254 [2021-10-28 09:44:23,173 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:44:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-28 09:44:23,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 247. [2021-10-28 09:44:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 214 states have (on average 1.3504672897196262) internal successors, (289), 243 states have internal predecessors, (289), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 292 transitions. [2021-10-28 09:44:23,182 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 292 transitions. Word has length 41 [2021-10-28 09:44:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:23,183 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 292 transitions. [2021-10-28 09:44:23,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 292 transitions. [2021-10-28 09:44:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 09:44:23,184 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:23,184 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:23,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 09:44:23,185 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr40REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:23,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:23,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1117706321, now seen corresponding path program 1 times [2021-10-28 09:44:23,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:23,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426607832] [2021-10-28 09:44:23,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:23,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:23,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:23,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:23,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426607832] [2021-10-28 09:44:23,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426607832] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:23,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:23,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:44:23,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387911158] [2021-10-28 09:44:23,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:44:23,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:23,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:44:23,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:44:23,246 INFO L87 Difference]: Start difference. First operand 247 states and 292 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:23,482 INFO L93 Difference]: Finished difference Result 246 states and 291 transitions. [2021-10-28 09:44:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:44:23,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-10-28 09:44:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:23,484 INFO L225 Difference]: With dead ends: 246 [2021-10-28 09:44:23,484 INFO L226 Difference]: Without dead ends: 246 [2021-10-28 09:44:23,484 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:44:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-28 09:44:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2021-10-28 09:44:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 214 states have (on average 1.3457943925233644) internal successors, (288), 242 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 291 transitions. [2021-10-28 09:44:23,492 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 291 transitions. Word has length 41 [2021-10-28 09:44:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:23,492 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 291 transitions. [2021-10-28 09:44:23,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 291 transitions. [2021-10-28 09:44:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 09:44:23,493 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:23,494 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:23,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-28 09:44:23,494 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr41REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1117706320, now seen corresponding path program 1 times [2021-10-28 09:44:23,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:23,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045106851] [2021-10-28 09:44:23,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:23,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:23,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:23,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:23,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045106851] [2021-10-28 09:44:23,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045106851] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:23,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:23,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:44:23,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688547307] [2021-10-28 09:44:23,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:44:23,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:23,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:44:23,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:44:23,583 INFO L87 Difference]: Start difference. First operand 246 states and 291 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:23,827 INFO L93 Difference]: Finished difference Result 245 states and 290 transitions. [2021-10-28 09:44:23,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:44:23,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-10-28 09:44:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:23,829 INFO L225 Difference]: With dead ends: 245 [2021-10-28 09:44:23,829 INFO L226 Difference]: Without dead ends: 245 [2021-10-28 09:44:23,829 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:44:23,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-28 09:44:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-10-28 09:44:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 214 states have (on average 1.341121495327103) internal successors, (287), 241 states have internal predecessors, (287), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 290 transitions. [2021-10-28 09:44:23,838 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 290 transitions. Word has length 41 [2021-10-28 09:44:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:23,838 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 290 transitions. [2021-10-28 09:44:23,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 290 transitions. [2021-10-28 09:44:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 09:44:23,840 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:23,840 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:23,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-28 09:44:23,841 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr57ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:23,841 INFO L85 PathProgramCache]: Analyzing trace with hash 423742185, now seen corresponding path program 1 times [2021-10-28 09:44:23,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:23,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685382037] [2021-10-28 09:44:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:23,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:24,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-10-28 09:44:24,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:24,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685382037] [2021-10-28 09:44:24,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685382037] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:24,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:24,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 09:44:24,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616742678] [2021-10-28 09:44:24,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 09:44:24,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:24,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 09:44:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:44:24,189 INFO L87 Difference]: Start difference. First operand 245 states and 290 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:25,361 INFO L93 Difference]: Finished difference Result 413 states and 445 transitions. [2021-10-28 09:44:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-28 09:44:25,362 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-10-28 09:44:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:25,364 INFO L225 Difference]: With dead ends: 413 [2021-10-28 09:44:25,364 INFO L226 Difference]: Without dead ends: 413 [2021-10-28 09:44:25,364 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2021-10-28 09:44:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-10-28 09:44:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 245. [2021-10-28 09:44:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 241 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 289 transitions. [2021-10-28 09:44:25,381 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 289 transitions. Word has length 41 [2021-10-28 09:44:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:25,382 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 289 transitions. [2021-10-28 09:44:25,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 289 transitions. [2021-10-28 09:44:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-28 09:44:25,384 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:25,384 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:25,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-28 09:44:25,385 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr81ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:25,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:25,385 INFO L85 PathProgramCache]: Analyzing trace with hash 363878013, now seen corresponding path program 1 times [2021-10-28 09:44:25,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:25,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177956671] [2021-10-28 09:44:25,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:25,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 09:44:25,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:25,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177956671] [2021-10-28 09:44:25,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177956671] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:25,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:25,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:44:25,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393648757] [2021-10-28 09:44:25,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:44:25,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:25,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:44:25,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:25,437 INFO L87 Difference]: Start difference. First operand 245 states and 289 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:25,649 INFO L93 Difference]: Finished difference Result 258 states and 293 transitions. [2021-10-28 09:44:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:44:25,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-10-28 09:44:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:25,652 INFO L225 Difference]: With dead ends: 258 [2021-10-28 09:44:25,652 INFO L226 Difference]: Without dead ends: 258 [2021-10-28 09:44:25,652 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-28 09:44:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2021-10-28 09:44:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 242 states have internal predecessors, (287), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 290 transitions. [2021-10-28 09:44:25,659 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 290 transitions. Word has length 43 [2021-10-28 09:44:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:25,660 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 290 transitions. [2021-10-28 09:44:25,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 290 transitions. [2021-10-28 09:44:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-28 09:44:25,661 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:25,661 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:25,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-28 09:44:25,662 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr50ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:25,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:25,662 INFO L85 PathProgramCache]: Analyzing trace with hash -642403391, now seen corresponding path program 1 times [2021-10-28 09:44:25,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:25,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775362167] [2021-10-28 09:44:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:25,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:25,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:25,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:25,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775362167] [2021-10-28 09:44:25,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775362167] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:25,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:25,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:44:25,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948613710] [2021-10-28 09:44:25,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:44:25,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:25,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:44:25,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:25,714 INFO L87 Difference]: Start difference. First operand 246 states and 290 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:25,901 INFO L93 Difference]: Finished difference Result 247 states and 291 transitions. [2021-10-28 09:44:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:44:25,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-10-28 09:44:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:25,903 INFO L225 Difference]: With dead ends: 247 [2021-10-28 09:44:25,903 INFO L226 Difference]: Without dead ends: 247 [2021-10-28 09:44:25,904 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:44:25,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-28 09:44:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2021-10-28 09:44:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 243 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 291 transitions. [2021-10-28 09:44:25,911 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 291 transitions. Word has length 43 [2021-10-28 09:44:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:25,911 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 291 transitions. [2021-10-28 09:44:25,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 291 transitions. [2021-10-28 09:44:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 09:44:25,913 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:25,913 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:25,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-28 09:44:25,913 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr44REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:25,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1292581990, now seen corresponding path program 1 times [2021-10-28 09:44:25,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:25,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254265999] [2021-10-28 09:44:25,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:25,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:26,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:26,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254265999] [2021-10-28 09:44:26,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254265999] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:26,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:26,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:44:26,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688885471] [2021-10-28 09:44:26,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:44:26,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:26,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:44:26,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:44:26,032 INFO L87 Difference]: Start difference. First operand 247 states and 291 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:26,412 INFO L93 Difference]: Finished difference Result 247 states and 291 transitions. [2021-10-28 09:44:26,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:44:26,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-10-28 09:44:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:26,414 INFO L225 Difference]: With dead ends: 247 [2021-10-28 09:44:26,414 INFO L226 Difference]: Without dead ends: 247 [2021-10-28 09:44:26,415 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:44:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-28 09:44:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2021-10-28 09:44:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 216 states have (on average 1.3287037037037037) internal successors, (287), 242 states have internal predecessors, (287), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 290 transitions. [2021-10-28 09:44:26,422 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 290 transitions. Word has length 44 [2021-10-28 09:44:26,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:26,422 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 290 transitions. [2021-10-28 09:44:26,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 290 transitions. [2021-10-28 09:44:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 09:44:26,424 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:26,424 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:26,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-28 09:44:26,425 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr45REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:26,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:26,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1292581991, now seen corresponding path program 1 times [2021-10-28 09:44:26,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:26,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598015661] [2021-10-28 09:44:26,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:26,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:44:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:44:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:44:26,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:44:26,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598015661] [2021-10-28 09:44:26,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598015661] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:44:26,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:44:26,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:44:26,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217958793] [2021-10-28 09:44:26,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:44:26,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:44:26,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:44:26,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:44:26,576 INFO L87 Difference]: Start difference. First operand 246 states and 290 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:44:27,027 INFO L93 Difference]: Finished difference Result 246 states and 290 transitions. [2021-10-28 09:44:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:44:27,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-10-28 09:44:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:44:27,029 INFO L225 Difference]: With dead ends: 246 [2021-10-28 09:44:27,029 INFO L226 Difference]: Without dead ends: 246 [2021-10-28 09:44:27,030 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:44:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-28 09:44:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2021-10-28 09:44:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 216 states have (on average 1.3240740740740742) internal successors, (286), 241 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 289 transitions. [2021-10-28 09:44:27,036 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 289 transitions. Word has length 44 [2021-10-28 09:44:27,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:44:27,037 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 289 transitions. [2021-10-28 09:44:27,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 09:44:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 289 transitions. [2021-10-28 09:44:27,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 09:44:27,038 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:44:27,038 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:44:27,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-28 09:44:27,039 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr60ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-28 09:44:27,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:44:27,039 INFO L85 PathProgramCache]: Analyzing trace with hash 798755045, now seen corresponding path program 1 times [2021-10-28 09:44:27,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:44:27,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348141480] [2021-10-28 09:44:27,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:44:27,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:44:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:44:27,059 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:44:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:44:27,107 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:44:27,107 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 09:44:27,109 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr60ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-10-28 09:44:27,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-10-28 09:44:27,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-10-28 09:44:27,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-10-28 09:44:27,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-10-28 09:44:27,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-10-28 09:44:27,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-10-28 09:44:27,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-10-28 09:44:27,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-10-28 09:44:27,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-10-28 09:44:27,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-10-28 09:44:27,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-10-28 09:44:27,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-10-28 09:44:27,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-10-28 09:44:27,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-10-28 09:44:27,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-10-28 09:44:27,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-10-28 09:44:27,115 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-10-28 09:44:27,115 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-10-28 09:44:27,115 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-10-28 09:44:27,115 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,115 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-10-28 09:44:27,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-10-28 09:44:27,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-10-28 09:44:27,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-10-28 09:44:27,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-10-28 09:44:27,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-10-28 09:44:27,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-10-28 09:44:27,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-10-28 09:44:27,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-10-28 09:44:27,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-10-28 09:44:27,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-10-28 09:44:27,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-10-28 09:44:27,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-10-28 09:44:27,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-10-28 09:44:27,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-10-28 09:44:27,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-10-28 09:44:27,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-10-28 09:44:27,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-10-28 09:44:27,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-10-28 09:44:27,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-10-28 09:44:27,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION [2021-10-28 09:44:27,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-10-28 09:44:27,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-10-28 09:44:27,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-10-28 09:44:27,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-10-28 09:44:27,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-10-28 09:44:27,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-10-28 09:44:27,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-10-28 09:44:27,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-10-28 09:44:27,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-10-28 09:44:27,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-10-28 09:44:27,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-10-28 09:44:27,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-10-28 09:44:27,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-10-28 09:44:27,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64REQUIRES_VIOLATION [2021-10-28 09:44:27,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-10-28 09:44:27,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-10-28 09:44:27,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67REQUIRES_VIOLATION [2021-10-28 09:44:27,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-10-28 09:44:27,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70REQUIRES_VIOLATION [2021-10-28 09:44:27,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72REQUIRES_VIOLATION [2021-10-28 09:44:27,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73REQUIRES_VIOLATION [2021-10-28 09:44:27,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 09:44:27,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 09:44:27,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 09:44:27,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78REQUIRES_VIOLATION [2021-10-28 09:44:27,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79REQUIRES_VIOLATION [2021-10-28 09:44:27,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr80ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 09:44:27,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr81ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 09:44:27,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr82ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 09:44:27,129 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr83ENSURES_VIOLATIONMEMORY_LEAK [2021-10-28 09:44:27,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-28 09:44:27,133 INFO L731 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, 1, 1] [2021-10-28 09:44:27,138 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:44:27,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:44:27 BoogieIcfgContainer [2021-10-28 09:44:27,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:44:27,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:44:27,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:44:27,177 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:44:27,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:44:05" (3/4) ... [2021-10-28 09:44:27,180 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 09:44:27,227 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:44:27,227 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:44:27,228 INFO L168 Benchmark]: Toolchain (without parser) took 23509.43 ms. Allocated memory was 83.9 MB in the beginning and 188.7 MB in the end (delta: 104.9 MB). Free memory was 48.5 MB in the beginning and 82.3 MB in the end (delta: -33.8 MB). Peak memory consumption was 69.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:44:27,229 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 83.9 MB. Free memory was 56.6 MB in the beginning and 56.5 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:44:27,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 651.86 ms. Allocated memory was 83.9 MB in the beginning and 107.0 MB in the end (delta: 23.1 MB). Free memory was 48.5 MB in the beginning and 72.4 MB in the end (delta: -23.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-28 09:44:27,230 INFO L168 Benchmark]: Boogie Preprocessor took 92.56 ms. Allocated memory is still 107.0 MB. Free memory was 72.4 MB in the beginning and 68.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:44:27,230 INFO L168 Benchmark]: RCFGBuilder took 1071.32 ms. Allocated memory is still 107.0 MB. Free memory was 68.8 MB in the beginning and 80.8 MB in the end (delta: -12.0 MB). Peak memory consumption was 38.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:44:27,231 INFO L168 Benchmark]: TraceAbstraction took 21634.54 ms. Allocated memory was 107.0 MB in the beginning and 188.7 MB in the end (delta: 81.8 MB). Free memory was 80.8 MB in the beginning and 84.4 MB in the end (delta: -3.6 MB). Peak memory consumption was 77.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:44:27,231 INFO L168 Benchmark]: Witness Printer took 50.48 ms. Allocated memory is still 188.7 MB. Free memory was 84.4 MB in the beginning and 82.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:44:27,234 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.31 ms. Allocated memory is still 83.9 MB. Free memory was 56.6 MB in the beginning and 56.5 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 651.86 ms. Allocated memory was 83.9 MB in the beginning and 107.0 MB in the end (delta: 23.1 MB). Free memory was 48.5 MB in the beginning and 72.4 MB in the end (delta: -23.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 92.56 ms. Allocated memory is still 107.0 MB. Free memory was 72.4 MB in the beginning and 68.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1071.32 ms. Allocated memory is still 107.0 MB. Free memory was 68.8 MB in the beginning and 80.8 MB in the end (delta: -12.0 MB). Peak memory consumption was 38.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 21634.54 ms. Allocated memory was 107.0 MB in the beginning and 188.7 MB in the end (delta: 81.8 MB). Free memory was 80.8 MB in the beginning and 84.4 MB in the end (delta: -3.6 MB). Peak memory consumption was 77.5 MB. Max. memory is 16.1 GB. * Witness Printer took 50.48 ms. Allocated memory is still 188.7 MB. Free memory was 84.4 MB in the beginning and 82.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * 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 4 procedures, 208 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4372 SDtfs, 5643 SDslu, 11318 SDs, 0 SdLazy, 13858 SolverSat, 405 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=25, InterpolantAutomatonStates: 293, 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, 32 MinimizatonAttempts, 1054 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1008 NumberOfCodeBlocks, 1008 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 7749 SizeOfPredicates, 6 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 33 InterpolantComputations, 31 PerfectInterpolantSequences, 4/6 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-10-28 09:44:27,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03843644-0293-477f-8a9b-d346750f778c/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...