./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ea18b6ba0d977117db11fbdff34c486def646c3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:18:09,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:18:09,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:18:09,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:18:09,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:18:09,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:18:09,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:18:09,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:18:09,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:18:09,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:18:09,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:18:09,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:18:09,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:18:09,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:18:09,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:18:09,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:18:09,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:18:09,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:18:09,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:18:09,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:18:10,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:18:10,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:18:10,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:18:10,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:18:10,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:18:10,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:18:10,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:18:10,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:18:10,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:18:10,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:18:10,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:18:10,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:18:10,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:18:10,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:18:10,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:18:10,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:18:10,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:18:10,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:18:10,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:18:10,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:18:10,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:18:10,036 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-10-13 00:18:10,088 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:18:10,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:18:10,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:18:10,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:18:10,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:18:10,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:18:10,106 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:18:10,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:18:10,107 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:18:10,107 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 00:18:10,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:18:10,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:18:10,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:18:10,109 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 00:18:10,109 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 00:18:10,109 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 00:18:10,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:18:10,110 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 00:18:10,110 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:18:10,110 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:18:10,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:18:10,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:18:10,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:18:10,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:18:10,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:18:10,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:18:10,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:18:10,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:18:10,113 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:18:10,114 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_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/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_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 2ea18b6ba0d977117db11fbdff34c486def646c3 [2021-10-13 00:18:10,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:18:10,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:18:10,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:18:10,526 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:18:10,528 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:18:10,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2021-10-13 00:18:10,641 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/data/d9b77fa29/2cc8a6d2991b4d8eb7af3f8a4e749ddb/FLAG90c3a7a32 [2021-10-13 00:18:11,362 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:18:11,363 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-10-13 00:18:11,381 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/data/d9b77fa29/2cc8a6d2991b4d8eb7af3f8a4e749ddb/FLAG90c3a7a32 [2021-10-13 00:18:11,566 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/data/d9b77fa29/2cc8a6d2991b4d8eb7af3f8a4e749ddb [2021-10-13 00:18:11,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:18:11,571 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-13 00:18:11,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:18:11,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:18:11,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:18:11,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:18:11" (1/1) ... [2021-10-13 00:18:11,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@437e235f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:11, skipping insertion in model container [2021-10-13 00:18:11,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:18:11" (1/1) ... [2021-10-13 00:18:11,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:18:11,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:18:12,162 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-10-13 00:18:12,175 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-10-13 00:18:12,178 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-10-13 00:18:12,179 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-10-13 00:18:12,182 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-10-13 00:18:12,184 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-10-13 00:18:12,187 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-10-13 00:18:12,190 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-10-13 00:18:12,191 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-10-13 00:18:12,194 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-10-13 00:18:12,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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-10-13 00:18:12,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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-10-13 00:18:12,199 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-10-13 00:18:12,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:18:12,228 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:18:12,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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-10-13 00:18:12,289 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-10-13 00:18:12,291 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-10-13 00:18:12,292 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-10-13 00:18:12,296 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-10-13 00:18:12,297 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-10-13 00:18:12,300 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-10-13 00:18:12,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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-10-13 00:18:12,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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-10-13 00:18:12,305 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-10-13 00:18:12,307 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-10-13 00:18:12,308 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-10-13 00:18:12,309 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_faa01548-49db-4b42-afe8-cd499febd8f1/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-10-13 00:18:12,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:18:12,361 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:18:12,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:12 WrapperNode [2021-10-13 00:18:12,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:18:12,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:18:12,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:18:12,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:18:12,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:12" (1/1) ... [2021-10-13 00:18:12,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:12" (1/1) ... [2021-10-13 00:18:12,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:12" (1/1) ... [2021-10-13 00:18:12,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:12" (1/1) ... [2021-10-13 00:18:12,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:12" (1/1) ... [2021-10-13 00:18:12,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:12" (1/1) ... [2021-10-13 00:18:12,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:12" (1/1) ... [2021-10-13 00:18:12,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:18:12,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:18:12,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:18:12,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:18:12,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:12" (1/1) ... [2021-10-13 00:18:12,485 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:18:12,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:18:12,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:18:12,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:18:12,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-13 00:18:12,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:18:12,561 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-13 00:18:12,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-13 00:18:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-10-13 00:18:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-10-13 00:18:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-10-13 00:18:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-10-13 00:18:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-10-13 00:18:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-10-13 00:18:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-10-13 00:18:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-10-13 00:18:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-10-13 00:18:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-10-13 00:18:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-10-13 00:18:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-10-13 00:18:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-10-13 00:18:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-10-13 00:18:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-10-13 00:18:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-10-13 00:18:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-10-13 00:18:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-10-13 00:18:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-10-13 00:18:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-10-13 00:18:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-10-13 00:18:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-10-13 00:18:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-10-13 00:18:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-10-13 00:18:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-10-13 00:18:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-10-13 00:18:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-10-13 00:18:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-10-13 00:18:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-10-13 00:18:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-10-13 00:18:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-10-13 00:18:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-10-13 00:18:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-10-13 00:18:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-10-13 00:18:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-10-13 00:18:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-10-13 00:18:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-10-13 00:18:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-10-13 00:18:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-10-13 00:18:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-10-13 00:18:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-10-13 00:18:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-10-13 00:18:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-10-13 00:18:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-10-13 00:18:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-10-13 00:18:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-10-13 00:18:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-10-13 00:18:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-10-13 00:18:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-10-13 00:18:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-10-13 00:18:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-10-13 00:18:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-10-13 00:18:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-10-13 00:18:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-10-13 00:18:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-10-13 00:18:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-10-13 00:18:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-10-13 00:18:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-10-13 00:18:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-10-13 00:18:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-13 00:18:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-10-13 00:18:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-10-13 00:18:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-10-13 00:18:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-10-13 00:18:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-10-13 00:18:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-10-13 00:18:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-10-13 00:18:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-10-13 00:18:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-10-13 00:18:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-10-13 00:18:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-10-13 00:18:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-10-13 00:18:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-10-13 00:18:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-10-13 00:18:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-10-13 00:18:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-10-13 00:18:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-10-13 00:18:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-10-13 00:18:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-10-13 00:18:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-10-13 00:18:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-10-13 00:18:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-10-13 00:18:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-10-13 00:18:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-10-13 00:18:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-10-13 00:18:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-10-13 00:18:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-10-13 00:18:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-10-13 00:18:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-10-13 00:18:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-10-13 00:18:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-10-13 00:18:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-10-13 00:18:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-10-13 00:18:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-10-13 00:18:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-10-13 00:18:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-10-13 00:18:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-10-13 00:18:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-10-13 00:18:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-10-13 00:18:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-10-13 00:18:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-10-13 00:18:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-10-13 00:18:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-10-13 00:18:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-13 00:18:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-13 00:18:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-10-13 00:18:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-10-13 00:18:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-13 00:18:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:18:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-13 00:18:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 00:18:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 00:18:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 00:18:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 00:18:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-13 00:18:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:18:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:18:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 00:18:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 00:18:13,714 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:18:13,714 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-10-13 00:18:13,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:18:13 BoogieIcfgContainer [2021-10-13 00:18:13,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:18:13,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:18:13,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:18:13,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:18:13,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:18:11" (1/3) ... [2021-10-13 00:18:13,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1631d6fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:18:13, skipping insertion in model container [2021-10-13 00:18:13,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:12" (2/3) ... [2021-10-13 00:18:13,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1631d6fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:18:13, skipping insertion in model container [2021-10-13 00:18:13,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:18:13" (3/3) ... [2021-10-13 00:18:13,738 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-10-13 00:18:13,754 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:18:13,754 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-10-13 00:18:13,813 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:18:13,822 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, mConcurrency=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-13 00:18:13,822 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-10-13 00:18:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 115 states have (on average 2.1652173913043478) internal successors, (249), 195 states have internal predecessors, (249), 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-13 00:18:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 00:18:13,863 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:13,864 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:13,865 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:13,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:13,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1164341321, now seen corresponding path program 1 times [2021-10-13 00:18:13,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:13,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017556169] [2021-10-13 00:18:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:13,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:14,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:14,130 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-13 00:18:14,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:14,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017556169] [2021-10-13 00:18:14,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017556169] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:14,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:14,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:18:14,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131809528] [2021-10-13 00:18:14,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:18:14,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:14,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:18:14,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:14,163 INFO L87 Difference]: Start difference. First operand has 200 states, 115 states have (on average 2.1652173913043478) internal successors, (249), 195 states have internal predecessors, (249), 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-13 00:18:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:14,621 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2021-10-13 00:18:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:18:14,623 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-13 00:18:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:14,635 INFO L225 Difference]: With dead ends: 201 [2021-10-13 00:18:14,635 INFO L226 Difference]: Without dead ends: 197 [2021-10-13 00:18:14,637 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-10-13 00:18:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2021-10-13 00:18:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.7264957264957266) internal successors, (202), 188 states have internal predecessors, (202), 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-13 00:18:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2021-10-13 00:18:14,726 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 7 [2021-10-13 00:18:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:14,726 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2021-10-13 00:18:14,727 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-13 00:18:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2021-10-13 00:18:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 00:18:14,727 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:14,728 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:14,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:18:14,728 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:14,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1164341322, now seen corresponding path program 1 times [2021-10-13 00:18:14,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:14,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856953319] [2021-10-13 00:18:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:14,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:14,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:14,828 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-13 00:18:14,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:14,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856953319] [2021-10-13 00:18:14,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856953319] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:14,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:14,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:18:14,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764542292] [2021-10-13 00:18:14,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:18:14,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:14,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:18:14,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:14,833 INFO L87 Difference]: Start difference. First operand 192 states and 205 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-13 00:18:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:15,285 INFO L93 Difference]: Finished difference Result 222 states and 234 transitions. [2021-10-13 00:18:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:18:15,286 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-13 00:18:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:15,289 INFO L225 Difference]: With dead ends: 222 [2021-10-13 00:18:15,289 INFO L226 Difference]: Without dead ends: 222 [2021-10-13 00:18:15,290 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-13 00:18:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2021-10-13 00:18:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.664179104477612) internal successors, (223), 198 states have internal predecessors, (223), 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-13 00:18:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2021-10-13 00:18:15,309 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 7 [2021-10-13 00:18:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:15,310 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2021-10-13 00:18:15,310 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-13 00:18:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2021-10-13 00:18:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 00:18:15,311 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:15,311 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:15,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:18:15,312 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:15,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2054455159, now seen corresponding path program 1 times [2021-10-13 00:18:15,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:15,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677538613] [2021-10-13 00:18:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:15,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:15,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:15,433 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-13 00:18:15,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:15,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677538613] [2021-10-13 00:18:15,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677538613] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:15,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:15,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:18:15,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649958949] [2021-10-13 00:18:15,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:18:15,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:15,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:18:15,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:15,437 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-13 00:18:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:15,811 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2021-10-13 00:18:15,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:18:15,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 9 [2021-10-13 00:18:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:15,814 INFO L225 Difference]: With dead ends: 217 [2021-10-13 00:18:15,815 INFO L226 Difference]: Without dead ends: 217 [2021-10-13 00:18:15,815 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-10-13 00:18:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-10-13 00:18:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 196 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-13 00:18:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2021-10-13 00:18:15,839 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 9 [2021-10-13 00:18:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:15,840 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2021-10-13 00:18:15,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-13 00:18:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2021-10-13 00:18:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 00:18:15,841 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:15,841 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:15,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:18:15,842 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:15,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:15,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1492111941, now seen corresponding path program 1 times [2021-10-13 00:18:15,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:15,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399458684] [2021-10-13 00:18:15,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:15,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:15,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:16,006 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-13 00:18:16,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:16,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399458684] [2021-10-13 00:18:16,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399458684] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:16,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:16,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:18:16,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969439969] [2021-10-13 00:18:16,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:18:16,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:16,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:18:16,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:18:16,012 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-13 00:18:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:16,464 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-10-13 00:18:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:18:16,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2021-10-13 00:18:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:16,467 INFO L225 Difference]: With dead ends: 199 [2021-10-13 00:18:16,467 INFO L226 Difference]: Without dead ends: 199 [2021-10-13 00:18:16,468 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 55.6ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:18:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-13 00:18:16,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-10-13 00:18:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 195 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-13 00:18:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-10-13 00:18:16,479 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 15 [2021-10-13 00:18:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:16,480 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-10-13 00:18:16,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-13 00:18:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-10-13 00:18:16,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 00:18:16,482 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:16,483 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:16,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:18:16,483 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:16,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:16,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1492111940, now seen corresponding path program 1 times [2021-10-13 00:18:16,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:16,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028228352] [2021-10-13 00:18:16,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:16,485 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:16,658 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-13 00:18:16,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:16,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028228352] [2021-10-13 00:18:16,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028228352] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:16,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:16,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:18:16,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821403465] [2021-10-13 00:18:16,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:18:16,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:16,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:18:16,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:18:16,662 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-13 00:18:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:17,086 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2021-10-13 00:18:17,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:18:17,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2021-10-13 00:18:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:17,089 INFO L225 Difference]: With dead ends: 198 [2021-10-13 00:18:17,089 INFO L226 Difference]: Without dead ends: 198 [2021-10-13 00:18:17,090 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 79.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:18:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-13 00:18:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-10-13 00:18:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 194 states have internal predecessors, (218), 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-13 00:18:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-10-13 00:18:17,100 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 15 [2021-10-13 00:18:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:17,117 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-10-13 00:18:17,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-13 00:18:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-10-13 00:18:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 00:18:17,119 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:17,119 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:17,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:18:17,125 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:17,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash 331044621, now seen corresponding path program 1 times [2021-10-13 00:18:17,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:17,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551995522] [2021-10-13 00:18:17,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:17,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:17,190 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-13 00:18:17,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:17,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551995522] [2021-10-13 00:18:17,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551995522] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:17,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:17,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:18:17,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354745051] [2021-10-13 00:18:17,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:18:17,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:17,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:18:17,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:17,193 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-13 00:18:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:17,511 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-10-13 00:18:17,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:18:17,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2021-10-13 00:18:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:17,513 INFO L225 Difference]: With dead ends: 199 [2021-10-13 00:18:17,513 INFO L226 Difference]: Without dead ends: 199 [2021-10-13 00:18:17,513 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-13 00:18:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-10-13 00:18:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 195 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-13 00:18:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-10-13 00:18:17,523 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 17 [2021-10-13 00:18:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:17,523 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-10-13 00:18:17,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-13 00:18:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-10-13 00:18:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 00:18:17,525 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:17,525 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:17,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:18:17,526 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:17,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:17,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1404699164, now seen corresponding path program 1 times [2021-10-13 00:18:17,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:17,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960567266] [2021-10-13 00:18:17,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:17,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:17,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:17,723 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-13 00:18:17,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:17,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960567266] [2021-10-13 00:18:17,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960567266] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:17,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:17,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:18:17,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024940568] [2021-10-13 00:18:17,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:18:17,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:17,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:18:17,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:18:17,727 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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-13 00:18:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:18,421 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2021-10-13 00:18:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:18:18,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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-13 00:18:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:18,424 INFO L225 Difference]: With dead ends: 199 [2021-10-13 00:18:18,424 INFO L226 Difference]: Without dead ends: 199 [2021-10-13 00:18:18,425 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 181.8ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:18:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-13 00:18:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2021-10-13 00:18:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.626865671641791) internal successors, (218), 194 states have internal predecessors, (218), 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-13 00:18:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-10-13 00:18:18,434 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 18 [2021-10-13 00:18:18,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:18,435 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-10-13 00:18:18,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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-13 00:18:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-10-13 00:18:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 00:18:18,436 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:18,437 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:18,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:18:18,437 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:18,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:18,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1404699165, now seen corresponding path program 1 times [2021-10-13 00:18:18,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:18,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927403280] [2021-10-13 00:18:18,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:18,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:18,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:18,668 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-13 00:18:18,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:18,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927403280] [2021-10-13 00:18:18,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927403280] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:18,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:18,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:18:18,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926572897] [2021-10-13 00:18:18,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:18:18,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:18,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:18:18,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:18:18,672 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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-13 00:18:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:19,479 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2021-10-13 00:18:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:18:19,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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-13 00:18:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:19,482 INFO L225 Difference]: With dead ends: 198 [2021-10-13 00:18:19,482 INFO L226 Difference]: Without dead ends: 198 [2021-10-13 00:18:19,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 200.6ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:18:19,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-13 00:18:19,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-10-13 00:18:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.6194029850746268) internal successors, (217), 193 states have internal predecessors, (217), 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-13 00:18:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-10-13 00:18:19,491 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 18 [2021-10-13 00:18:19,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:19,492 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-10-13 00:18:19,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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-13 00:18:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-10-13 00:18:19,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 00:18:19,493 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:19,494 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:19,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:18:19,494 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:19,495 INFO L82 PathProgramCache]: Analyzing trace with hash 307937042, now seen corresponding path program 1 times [2021-10-13 00:18:19,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:19,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476322070] [2021-10-13 00:18:19,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:19,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:19,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:19,668 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-13 00:18:19,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:19,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476322070] [2021-10-13 00:18:19,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476322070] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:19,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:19,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:18:19,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286260598] [2021-10-13 00:18:19,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:18:19,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:19,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:18:19,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:18:19,672 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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-13 00:18:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:20,257 INFO L93 Difference]: Finished difference Result 289 states and 319 transitions. [2021-10-13 00:18:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 00:18:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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-13 00:18:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:20,260 INFO L225 Difference]: With dead ends: 289 [2021-10-13 00:18:20,261 INFO L226 Difference]: Without dead ends: 289 [2021-10-13 00:18:20,261 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 168.7ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-13 00:18:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-13 00:18:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2021-10-13 00:18:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.621212121212121) internal successors, (214), 190 states have internal predecessors, (214), 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-13 00:18:20,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2021-10-13 00:18:20,270 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 19 [2021-10-13 00:18:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:20,271 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2021-10-13 00:18:20,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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-13 00:18:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2021-10-13 00:18:20,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:18:20,272 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:20,272 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:20,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:18:20,273 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:20,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1873843689, now seen corresponding path program 1 times [2021-10-13 00:18:20,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:20,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876624660] [2021-10-13 00:18:20,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:20,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:20,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:20,400 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-13 00:18:20,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:20,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876624660] [2021-10-13 00:18:20,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876624660] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:20,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:20,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:18:20,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451332045] [2021-10-13 00:18:20,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:18:20,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:20,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:18:20,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:18:20,404 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-13 00:18:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:20,833 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2021-10-13 00:18:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:18:20,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 21 [2021-10-13 00:18:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:20,837 INFO L225 Difference]: With dead ends: 290 [2021-10-13 00:18:20,837 INFO L226 Difference]: Without dead ends: 290 [2021-10-13 00:18:20,837 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.9ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:18:20,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-13 00:18:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2021-10-13 00:18:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.6074074074074074) internal successors, (217), 193 states have internal predecessors, (217), 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-13 00:18:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-10-13 00:18:20,847 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 21 [2021-10-13 00:18:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:20,847 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-10-13 00:18:20,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-13 00:18:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-10-13 00:18:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 00:18:20,849 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:20,849 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:20,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:18:20,850 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:20,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash -515815524, now seen corresponding path program 1 times [2021-10-13 00:18:20,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:20,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539434533] [2021-10-13 00:18:20,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:20,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:20,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:20,922 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-13 00:18:20,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:20,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539434533] [2021-10-13 00:18:20,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539434533] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:20,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:20,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:18:20,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847434851] [2021-10-13 00:18:20,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:18:20,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:20,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:18:20,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:18:20,926 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-13 00:18:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:21,301 INFO L93 Difference]: Finished difference Result 193 states and 214 transitions. [2021-10-13 00:18:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:18:21,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 23 [2021-10-13 00:18:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:21,304 INFO L225 Difference]: With dead ends: 193 [2021-10-13 00:18:21,304 INFO L226 Difference]: Without dead ends: 193 [2021-10-13 00:18:21,305 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:18:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-10-13 00:18:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2021-10-13 00:18:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 184 states have internal predecessors, (208), 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-13 00:18:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2021-10-13 00:18:21,313 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 23 [2021-10-13 00:18:21,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:21,313 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2021-10-13 00:18:21,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-13 00:18:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2021-10-13 00:18:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 00:18:21,314 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:21,314 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:21,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:18:21,315 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash -515815523, now seen corresponding path program 1 times [2021-10-13 00:18:21,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:21,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287917090] [2021-10-13 00:18:21,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:21,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:21,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:21,454 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-13 00:18:21,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:21,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287917090] [2021-10-13 00:18:21,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287917090] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:21,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:21,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:18:21,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606210286] [2021-10-13 00:18:21,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:18:21,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:18:21,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:18:21,457 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-13 00:18:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:21,994 INFO L93 Difference]: Finished difference Result 249 states and 266 transitions. [2021-10-13 00:18:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:18:21,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 23 [2021-10-13 00:18:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:21,996 INFO L225 Difference]: With dead ends: 249 [2021-10-13 00:18:21,996 INFO L226 Difference]: Without dead ends: 249 [2021-10-13 00:18:21,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 66.3ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:18:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-10-13 00:18:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 212. [2021-10-13 00:18:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 208 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-13 00:18:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2021-10-13 00:18:22,006 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 23 [2021-10-13 00:18:22,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:22,006 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2021-10-13 00:18:22,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-13 00:18:22,007 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2021-10-13 00:18:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:18:22,008 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:22,009 INFO L512 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] [2021-10-13 00:18:22,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:18:22,009 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:22,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1777429398, now seen corresponding path program 1 times [2021-10-13 00:18:22,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:22,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357952042] [2021-10-13 00:18:22,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:22,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:22,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:22,083 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-13 00:18:22,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:22,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357952042] [2021-10-13 00:18:22,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357952042] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:22,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:22,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:18:22,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699170584] [2021-10-13 00:18:22,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:18:22,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:22,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:18:22,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:18:22,088 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-13 00:18:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:22,421 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2021-10-13 00:18:22,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:18:22,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 25 [2021-10-13 00:18:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:22,424 INFO L225 Difference]: With dead ends: 244 [2021-10-13 00:18:22,425 INFO L226 Difference]: Without dead ends: 244 [2021-10-13 00:18:22,425 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:18:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-13 00:18:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2021-10-13 00:18:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 160 states have (on average 1.525) internal successors, (244), 206 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-13 00:18:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2021-10-13 00:18:22,435 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 25 [2021-10-13 00:18:22,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:22,435 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2021-10-13 00:18:22,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-13 00:18:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2021-10-13 00:18:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 00:18:22,437 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:22,437 INFO L512 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-13 00:18:22,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:18:22,438 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:22,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:22,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1241440350, now seen corresponding path program 1 times [2021-10-13 00:18:22,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:22,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326923630] [2021-10-13 00:18:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:22,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:22,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:22,519 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-13 00:18:22,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:22,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326923630] [2021-10-13 00:18:22,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326923630] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:22,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:22,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:18:22,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663589106] [2021-10-13 00:18:22,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:18:22,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:22,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:18:22,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:18:22,523 INFO L87 Difference]: Start difference. First operand 210 states and 247 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 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-13 00:18:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:22,994 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-10-13 00:18:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:18:22,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 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-13 00:18:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:22,996 INFO L225 Difference]: With dead ends: 210 [2021-10-13 00:18:22,996 INFO L226 Difference]: Without dead ends: 210 [2021-10-13 00:18:22,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 83.2ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:18:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-13 00:18:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2021-10-13 00:18:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.51875) internal successors, (243), 205 states have internal predecessors, (243), 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-13 00:18:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 246 transitions. [2021-10-13 00:18:23,003 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 246 transitions. Word has length 27 [2021-10-13 00:18:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:23,003 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 246 transitions. [2021-10-13 00:18:23,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 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-13 00:18:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 246 transitions. [2021-10-13 00:18:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 00:18:23,005 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:23,005 INFO L512 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-13 00:18:23,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:18:23,005 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:23,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:23,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1241440351, now seen corresponding path program 1 times [2021-10-13 00:18:23,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:23,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120567971] [2021-10-13 00:18:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:23,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:23,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:23,168 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-13 00:18:23,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:23,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120567971] [2021-10-13 00:18:23,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120567971] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:23,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:23,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:18:23,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412827126] [2021-10-13 00:18:23,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:18:23,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:23,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:18:23,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:18:23,173 INFO L87 Difference]: Start difference. First operand 209 states and 246 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 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-13 00:18:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:23,653 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2021-10-13 00:18:23,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:18:23,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 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-13 00:18:23,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:23,655 INFO L225 Difference]: With dead ends: 202 [2021-10-13 00:18:23,656 INFO L226 Difference]: Without dead ends: 202 [2021-10-13 00:18:23,656 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 139.3ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:18:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-13 00:18:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2021-10-13 00:18:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 191 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-13 00:18:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2021-10-13 00:18:23,664 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 27 [2021-10-13 00:18:23,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:23,665 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2021-10-13 00:18:23,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 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-13 00:18:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2021-10-13 00:18:23,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 00:18:23,666 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:23,666 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:23,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:18:23,667 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr26ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:23,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:23,668 INFO L82 PathProgramCache]: Analyzing trace with hash -976729154, now seen corresponding path program 1 times [2021-10-13 00:18:23,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:23,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912425129] [2021-10-13 00:18:23,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:23,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:23,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:23,749 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-13 00:18:23,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:23,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912425129] [2021-10-13 00:18:23,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912425129] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:23,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:23,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:18:23,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163240482] [2021-10-13 00:18:23,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:18:23,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:18:23,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:18:23,753 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-13 00:18:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:24,124 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2021-10-13 00:18:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:18:24,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 29 [2021-10-13 00:18:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:24,126 INFO L225 Difference]: With dead ends: 198 [2021-10-13 00:18:24,126 INFO L226 Difference]: Without dead ends: 198 [2021-10-13 00:18:24,127 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 99.3ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:18:24,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-13 00:18:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2021-10-13 00:18:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 187 states have internal predecessors, (224), 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-13 00:18:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2021-10-13 00:18:24,134 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 29 [2021-10-13 00:18:24,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:24,135 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2021-10-13 00:18:24,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-13 00:18:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2021-10-13 00:18:24,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 00:18:24,136 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:24,136 INFO L512 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-13 00:18:24,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:18:24,137 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr59ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:24,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:24,137 INFO L82 PathProgramCache]: Analyzing trace with hash 90529238, now seen corresponding path program 1 times [2021-10-13 00:18:24,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:24,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281373735] [2021-10-13 00:18:24,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:24,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:24,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:24,193 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-13 00:18:24,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:24,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281373735] [2021-10-13 00:18:24,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281373735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:24,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:24,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:18:24,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869316013] [2021-10-13 00:18:24,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:18:24,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:24,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:18:24,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:24,197 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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-13 00:18:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:24,430 INFO L93 Difference]: Finished difference Result 264 states and 315 transitions. [2021-10-13 00:18:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:18:24,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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-13 00:18:24,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:24,432 INFO L225 Difference]: With dead ends: 264 [2021-10-13 00:18:24,432 INFO L226 Difference]: Without dead ends: 264 [2021-10-13 00:18:24,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-13 00:18:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 197. [2021-10-13 00:18:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.4591194968553458) internal successors, (232), 193 states have internal predecessors, (232), 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-13 00:18:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2021-10-13 00:18:24,440 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 31 [2021-10-13 00:18:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:24,440 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2021-10-13 00:18:24,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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-13 00:18:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2021-10-13 00:18:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 00:18:24,441 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:24,442 INFO L512 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-13 00:18:24,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:18:24,442 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:24,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:24,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1488582203, now seen corresponding path program 1 times [2021-10-13 00:18:24,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:24,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130619791] [2021-10-13 00:18:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:24,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:24,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:24,525 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-13 00:18:24,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:24,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130619791] [2021-10-13 00:18:24,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130619791] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:24,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:24,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:18:24,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001912826] [2021-10-13 00:18:24,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:18:24,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:24,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:18:24,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:24,527 INFO L87 Difference]: Start difference. First operand 197 states and 235 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-13 00:18:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:24,742 INFO L93 Difference]: Finished difference Result 195 states and 232 transitions. [2021-10-13 00:18:24,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:18:24,743 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-13 00:18:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:24,745 INFO L225 Difference]: With dead ends: 195 [2021-10-13 00:18:24,745 INFO L226 Difference]: Without dead ends: 195 [2021-10-13 00:18:24,746 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-10-13 00:18:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-10-13 00:18:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 158 states have (on average 1.4493670886075949) internal successors, (229), 191 states have internal predecessors, (229), 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-13 00:18:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2021-10-13 00:18:24,754 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 32 [2021-10-13 00:18:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:24,755 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2021-10-13 00:18:24,755 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-13 00:18:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2021-10-13 00:18:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 00:18:24,757 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:24,758 INFO L512 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-13 00:18:24,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:18:24,758 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:24,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1098596299, now seen corresponding path program 1 times [2021-10-13 00:18:24,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:24,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454571424] [2021-10-13 00:18:24,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:24,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:24,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:24,999 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-13 00:18:24,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:24,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454571424] [2021-10-13 00:18:25,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454571424] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:25,000 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:25,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:18:25,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288240759] [2021-10-13 00:18:25,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 00:18:25,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 00:18:25,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:18:25,005 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 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-13 00:18:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:25,741 INFO L93 Difference]: Finished difference Result 325 states and 363 transitions. [2021-10-13 00:18:25,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 00:18:25,742 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 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-13 00:18:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:25,744 INFO L225 Difference]: With dead ends: 325 [2021-10-13 00:18:25,744 INFO L226 Difference]: Without dead ends: 325 [2021-10-13 00:18:25,745 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 264.3ms TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-10-13 00:18:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-10-13 00:18:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 228. [2021-10-13 00:18:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 191 states have (on average 1.3979057591623036) internal successors, (267), 224 states have internal predecessors, (267), 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-13 00:18:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2021-10-13 00:18:25,755 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 33 [2021-10-13 00:18:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:25,756 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2021-10-13 00:18:25,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 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-13 00:18:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2021-10-13 00:18:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 00:18:25,757 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:25,757 INFO L512 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] [2021-10-13 00:18:25,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:18:25,758 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr46REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:25,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:25,759 INFO L82 PathProgramCache]: Analyzing trace with hash -49345090, now seen corresponding path program 1 times [2021-10-13 00:18:25,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:25,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377315194] [2021-10-13 00:18:25,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:25,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:25,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:25,892 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-13 00:18:25,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:25,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377315194] [2021-10-13 00:18:25,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377315194] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:18:25,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369453670] [2021-10-13 00:18:25,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:25,894 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:18:25,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:18:25,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:18:25,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 00:18:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:26,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-13 00:18:26,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:18:26,247 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-13 00:18:26,276 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-13 00:18:26,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 00:18:26,472 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-13 00:18:26,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 00:18:26,484 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-13 00:18:27,064 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-10-13 00:18:27,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 40 [2021-10-13 00:18:27,089 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-10-13 00:18:27,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 22 [2021-10-13 00:18:27,111 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-13 00:18:27,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369453670] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:18:27,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:18:27,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2021-10-13 00:18:27,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326513562] [2021-10-13 00:18:27,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 00:18:27,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:27,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 00:18:27,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:18:27,114 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 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-13 00:18:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:27,934 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-10-13 00:18:27,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 00:18:27,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 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 35 [2021-10-13 00:18:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:27,938 INFO L225 Difference]: With dead ends: 381 [2021-10-13 00:18:27,938 INFO L226 Difference]: Without dead ends: 381 [2021-10-13 00:18:27,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 306.4ms TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-10-13 00:18:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-10-13 00:18:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 266. [2021-10-13 00:18:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 229 states have (on average 1.4017467248908297) internal successors, (321), 262 states have internal predecessors, (321), 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-13 00:18:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2021-10-13 00:18:27,951 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 35 [2021-10-13 00:18:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:27,952 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2021-10-13 00:18:27,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 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-13 00:18:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2021-10-13 00:18:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 00:18:27,954 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:27,954 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:28,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 00:18:28,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:18:28,169 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:28,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:28,170 INFO L82 PathProgramCache]: Analyzing trace with hash -824345932, now seen corresponding path program 1 times [2021-10-13 00:18:28,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:28,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755217554] [2021-10-13 00:18:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:28,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:28,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:28,259 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-13 00:18:28,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:28,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755217554] [2021-10-13 00:18:28,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755217554] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:28,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:28,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:18:28,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057694209] [2021-10-13 00:18:28,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:18:28,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:28,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:18:28,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:18:28,265 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-13 00:18:28,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:28,569 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2021-10-13 00:18:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:18:28,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 37 [2021-10-13 00:18:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:28,578 INFO L225 Difference]: With dead ends: 265 [2021-10-13 00:18:28,578 INFO L226 Difference]: Without dead ends: 265 [2021-10-13 00:18:28,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 46.4ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:18:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-10-13 00:18:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-10-13 00:18:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 229 states have (on average 1.3973799126637554) internal successors, (320), 261 states have internal predecessors, (320), 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-13 00:18:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 323 transitions. [2021-10-13 00:18:28,588 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 323 transitions. Word has length 37 [2021-10-13 00:18:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:28,589 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 323 transitions. [2021-10-13 00:18:28,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-13 00:18:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 323 transitions. [2021-10-13 00:18:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 00:18:28,590 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:28,590 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:28,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 00:18:28,591 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:28,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash -824345931, now seen corresponding path program 1 times [2021-10-13 00:18:28,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:28,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802012909] [2021-10-13 00:18:28,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:28,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:28,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:28,689 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-13 00:18:28,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:28,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802012909] [2021-10-13 00:18:28,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802012909] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:28,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:28,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:18:28,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338380633] [2021-10-13 00:18:28,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:18:28,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:28,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:18:28,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:18:28,692 INFO L87 Difference]: Start difference. First operand 265 states and 323 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-13 00:18:28,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:28,987 INFO L93 Difference]: Finished difference Result 264 states and 322 transitions. [2021-10-13 00:18:28,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:18:28,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 37 [2021-10-13 00:18:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:28,992 INFO L225 Difference]: With dead ends: 264 [2021-10-13 00:18:28,992 INFO L226 Difference]: Without dead ends: 264 [2021-10-13 00:18:28,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 59.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:18:28,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-13 00:18:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2021-10-13 00:18:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 260 states have internal predecessors, (319), 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-13 00:18:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 322 transitions. [2021-10-13 00:18:29,002 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 322 transitions. Word has length 37 [2021-10-13 00:18:29,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:29,002 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 322 transitions. [2021-10-13 00:18:29,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-13 00:18:29,003 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 322 transitions. [2021-10-13 00:18:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 00:18:29,004 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:29,004 INFO L512 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] [2021-10-13 00:18:29,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 00:18:29,005 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:29,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:29,005 INFO L82 PathProgramCache]: Analyzing trace with hash 385741532, now seen corresponding path program 1 times [2021-10-13 00:18:29,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:29,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153968316] [2021-10-13 00:18:29,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:29,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:29,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:29,254 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-13 00:18:29,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:29,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153968316] [2021-10-13 00:18:29,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153968316] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:29,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:29,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:18:29,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059497060] [2021-10-13 00:18:29,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 00:18:29,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:29,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:18:29,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:18:29,257 INFO L87 Difference]: Start difference. First operand 264 states and 322 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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-13 00:18:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:30,192 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2021-10-13 00:18:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 00:18:30,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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 38 [2021-10-13 00:18:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:30,195 INFO L225 Difference]: With dead ends: 374 [2021-10-13 00:18:30,195 INFO L226 Difference]: Without dead ends: 374 [2021-10-13 00:18:30,196 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 280.4ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-13 00:18:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-10-13 00:18:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 265. [2021-10-13 00:18:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 261 states have internal predecessors, (317), 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-13 00:18:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 320 transitions. [2021-10-13 00:18:30,207 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 320 transitions. Word has length 38 [2021-10-13 00:18:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:30,207 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 320 transitions. [2021-10-13 00:18:30,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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-13 00:18:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 320 transitions. [2021-10-13 00:18:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 00:18:30,208 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:30,209 INFO L512 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] [2021-10-13 00:18:30,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:18:30,209 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr50REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:30,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash 385741533, now seen corresponding path program 1 times [2021-10-13 00:18:30,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:30,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033122256] [2021-10-13 00:18:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:30,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:30,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:30,497 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-13 00:18:30,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:30,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033122256] [2021-10-13 00:18:30,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033122256] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:30,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:30,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-13 00:18:30,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277275156] [2021-10-13 00:18:30,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:18:30,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:30,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:18:30,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:18:30,500 INFO L87 Difference]: Start difference. First operand 265 states and 320 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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-13 00:18:31,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:31,554 INFO L93 Difference]: Finished difference Result 430 states and 478 transitions. [2021-10-13 00:18:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-13 00:18:31,554 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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 38 [2021-10-13 00:18:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:31,558 INFO L225 Difference]: With dead ends: 430 [2021-10-13 00:18:31,558 INFO L226 Difference]: Without dead ends: 430 [2021-10-13 00:18:31,559 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 377.6ms TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2021-10-13 00:18:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-10-13 00:18:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 271. [2021-10-13 00:18:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 238 states have (on average 1.361344537815126) internal successors, (324), 267 states have internal predecessors, (324), 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-13 00:18:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 327 transitions. [2021-10-13 00:18:31,570 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 327 transitions. Word has length 38 [2021-10-13 00:18:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:31,571 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 327 transitions. [2021-10-13 00:18:31,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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-13 00:18:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 327 transitions. [2021-10-13 00:18:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 00:18:31,572 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:31,572 INFO L512 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-13 00:18:31,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 00:18:31,573 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:31,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2104055878, now seen corresponding path program 1 times [2021-10-13 00:18:31,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:31,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776566784] [2021-10-13 00:18:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:31,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:31,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:31,629 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-13 00:18:31,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:31,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776566784] [2021-10-13 00:18:31,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776566784] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:31,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:31,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:18:31,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307782553] [2021-10-13 00:18:31,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:18:31,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:18:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:31,632 INFO L87 Difference]: Start difference. First operand 271 states and 327 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 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-13 00:18:31,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:31,860 INFO L93 Difference]: Finished difference Result 273 states and 329 transitions. [2021-10-13 00:18:31,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:18:31,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 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-13 00:18:31,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:31,864 INFO L225 Difference]: With dead ends: 273 [2021-10-13 00:18:31,865 INFO L226 Difference]: Without dead ends: 273 [2021-10-13 00:18:31,865 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-13 00:18:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-10-13 00:18:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 240 states have (on average 1.3583333333333334) internal successors, (326), 269 states have internal predecessors, (326), 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-13 00:18:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2021-10-13 00:18:31,882 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 39 [2021-10-13 00:18:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:31,883 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2021-10-13 00:18:31,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 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-13 00:18:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2021-10-13 00:18:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 00:18:31,885 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:31,885 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:31,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 00:18:31,886 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1003773134, now seen corresponding path program 1 times [2021-10-13 00:18:31,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:31,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506125233] [2021-10-13 00:18:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:31,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:32,052 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-13 00:18:32,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:32,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506125233] [2021-10-13 00:18:32,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506125233] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:32,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:32,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:18:32,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967156001] [2021-10-13 00:18:32,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:18:32,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:32,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:18:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:18:32,057 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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-13 00:18:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:32,559 INFO L93 Difference]: Finished difference Result 288 states and 344 transitions. [2021-10-13 00:18:32,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:18:32,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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 40 [2021-10-13 00:18:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:32,562 INFO L225 Difference]: With dead ends: 288 [2021-10-13 00:18:32,562 INFO L226 Difference]: Without dead ends: 288 [2021-10-13 00:18:32,563 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 121.5ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:18:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-10-13 00:18:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2021-10-13 00:18:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 249 states have (on average 1.3453815261044177) internal successors, (335), 278 states have internal predecessors, (335), 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-13 00:18:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 338 transitions. [2021-10-13 00:18:32,572 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 338 transitions. Word has length 40 [2021-10-13 00:18:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:32,572 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 338 transitions. [2021-10-13 00:18:32,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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-13 00:18:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 338 transitions. [2021-10-13 00:18:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 00:18:32,574 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:32,574 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:32,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 00:18:32,574 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:32,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:32,575 INFO L82 PathProgramCache]: Analyzing trace with hash 533473399, now seen corresponding path program 1 times [2021-10-13 00:18:32,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:32,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114830665] [2021-10-13 00:18:32,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:32,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:32,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:32,730 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-13 00:18:32,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:32,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114830665] [2021-10-13 00:18:32,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114830665] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:32,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:32,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:18:32,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517127962] [2021-10-13 00:18:32,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:18:32,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:32,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:18:32,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:18:32,734 INFO L87 Difference]: Start difference. First operand 282 states and 338 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-13 00:18:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:33,179 INFO L93 Difference]: Finished difference Result 282 states and 338 transitions. [2021-10-13 00:18:33,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:18:33,179 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 40 [2021-10-13 00:18:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:33,181 INFO L225 Difference]: With dead ends: 282 [2021-10-13 00:18:33,182 INFO L226 Difference]: Without dead ends: 282 [2021-10-13 00:18:33,182 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 154.1ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:18:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-13 00:18:33,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2021-10-13 00:18:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 249 states have (on average 1.3413654618473896) internal successors, (334), 277 states have internal predecessors, (334), 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-13 00:18:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 337 transitions. [2021-10-13 00:18:33,197 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 337 transitions. Word has length 40 [2021-10-13 00:18:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:33,197 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 337 transitions. [2021-10-13 00:18:33,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-13 00:18:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 337 transitions. [2021-10-13 00:18:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 00:18:33,198 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:33,199 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:33,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 00:18:33,199 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:33,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:33,200 INFO L82 PathProgramCache]: Analyzing trace with hash 533473400, now seen corresponding path program 1 times [2021-10-13 00:18:33,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:33,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767782941] [2021-10-13 00:18:33,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:33,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:33,395 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-13 00:18:33,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:33,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767782941] [2021-10-13 00:18:33,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767782941] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:33,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:33,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:18:33,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624042015] [2021-10-13 00:18:33,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:18:33,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:33,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:18:33,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:18:33,398 INFO L87 Difference]: Start difference. First operand 281 states and 337 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-13 00:18:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:34,044 INFO L93 Difference]: Finished difference Result 281 states and 337 transitions. [2021-10-13 00:18:34,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:18:34,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 40 [2021-10-13 00:18:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:34,047 INFO L225 Difference]: With dead ends: 281 [2021-10-13 00:18:34,048 INFO L226 Difference]: Without dead ends: 281 [2021-10-13 00:18:34,048 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 231.3ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:18:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-10-13 00:18:34,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2021-10-13 00:18:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3373493975903614) internal successors, (333), 276 states have internal predecessors, (333), 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-13 00:18:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 336 transitions. [2021-10-13 00:18:34,057 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 336 transitions. Word has length 40 [2021-10-13 00:18:34,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:34,058 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 336 transitions. [2021-10-13 00:18:34,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-13 00:18:34,058 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 336 transitions. [2021-10-13 00:18:34,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 00:18:34,059 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:34,060 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:34,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 00:18:34,060 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr51ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:34,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1330432764, now seen corresponding path program 1 times [2021-10-13 00:18:34,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:34,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431786491] [2021-10-13 00:18:34,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:34,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:34,469 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-13 00:18:34,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:34,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431786491] [2021-10-13 00:18:34,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431786491] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:34,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:34,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-13 00:18:34,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336259692] [2021-10-13 00:18:34,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:18:34,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:34,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:18:34,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:18:34,472 INFO L87 Difference]: Start difference. First operand 280 states and 336 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-13 00:18:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:35,769 INFO L93 Difference]: Finished difference Result 448 states and 489 transitions. [2021-10-13 00:18:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-13 00:18:35,769 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2021-10-13 00:18:35,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:35,772 INFO L225 Difference]: With dead ends: 448 [2021-10-13 00:18:35,773 INFO L226 Difference]: Without dead ends: 448 [2021-10-13 00:18:35,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 642.9ms TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2021-10-13 00:18:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-10-13 00:18:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 280. [2021-10-13 00:18:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3333333333333333) internal successors, (332), 276 states have internal predecessors, (332), 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-13 00:18:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2021-10-13 00:18:35,785 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 40 [2021-10-13 00:18:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:35,786 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2021-10-13 00:18:35,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-13 00:18:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2021-10-13 00:18:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-13 00:18:35,787 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:35,787 INFO L512 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-13 00:18:35,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 00:18:35,788 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:35,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash -930257781, now seen corresponding path program 1 times [2021-10-13 00:18:35,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:35,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257239613] [2021-10-13 00:18:35,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:35,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:35,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:35,909 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-13 00:18:35,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:35,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257239613] [2021-10-13 00:18:35,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257239613] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:35,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:35,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:18:35,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119682987] [2021-10-13 00:18:35,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:18:35,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:35,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:18:35,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:18:35,912 INFO L87 Difference]: Start difference. First operand 280 states and 335 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-13 00:18:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:36,345 INFO L93 Difference]: Finished difference Result 290 states and 346 transitions. [2021-10-13 00:18:36,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 00:18:36,346 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-13 00:18:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:36,348 INFO L225 Difference]: With dead ends: 290 [2021-10-13 00:18:36,349 INFO L226 Difference]: Without dead ends: 290 [2021-10-13 00:18:36,350 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 139.4ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-13 00:18:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-13 00:18:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 276. [2021-10-13 00:18:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 246 states have (on average 1.329268292682927) internal successors, (327), 272 states have internal predecessors, (327), 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-13 00:18:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 330 transitions. [2021-10-13 00:18:36,360 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 330 transitions. Word has length 41 [2021-10-13 00:18:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:36,360 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 330 transitions. [2021-10-13 00:18:36,360 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-13 00:18:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 330 transitions. [2021-10-13 00:18:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-13 00:18:36,362 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:36,362 INFO L512 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] [2021-10-13 00:18:36,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 00:18:36,363 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr77ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:36,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:36,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1804534839, now seen corresponding path program 1 times [2021-10-13 00:18:36,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:36,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062072897] [2021-10-13 00:18:36,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:36,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:36,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:36,427 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-13 00:18:36,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:36,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062072897] [2021-10-13 00:18:36,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062072897] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:36,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:36,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:18:36,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315968472] [2021-10-13 00:18:36,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:18:36,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:36,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:18:36,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:36,430 INFO L87 Difference]: Start difference. First operand 276 states and 330 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-13 00:18:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:36,675 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2021-10-13 00:18:36,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:18:36,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 42 [2021-10-13 00:18:36,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:36,677 INFO L225 Difference]: With dead ends: 289 [2021-10-13 00:18:36,677 INFO L226 Difference]: Without dead ends: 289 [2021-10-13 00:18:36,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:36,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-13 00:18:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2021-10-13 00:18:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 247 states have (on average 1.3279352226720649) internal successors, (328), 273 states have internal predecessors, (328), 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-13 00:18:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2021-10-13 00:18:36,687 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 42 [2021-10-13 00:18:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:36,687 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2021-10-13 00:18:36,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-13 00:18:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2021-10-13 00:18:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 00:18:36,688 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:36,689 INFO L512 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-13 00:18:36,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 00:18:36,690 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr54ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash 968459560, now seen corresponding path program 1 times [2021-10-13 00:18:36,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:36,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593508234] [2021-10-13 00:18:36,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:36,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:37,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:37,223 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-13 00:18:37,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:37,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593508234] [2021-10-13 00:18:37,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593508234] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:37,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:37,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-13 00:18:37,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466366386] [2021-10-13 00:18:37,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:18:37,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:37,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:18:37,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:18:37,227 INFO L87 Difference]: Start difference. First operand 277 states and 331 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 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-13 00:18:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:38,437 INFO L93 Difference]: Finished difference Result 428 states and 475 transitions. [2021-10-13 00:18:38,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-13 00:18:38,438 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 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-13 00:18:38,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:38,440 INFO L225 Difference]: With dead ends: 428 [2021-10-13 00:18:38,440 INFO L226 Difference]: Without dead ends: 428 [2021-10-13 00:18:38,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 634.4ms TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-10-13 00:18:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-10-13 00:18:38,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 277. [2021-10-13 00:18:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 247 states have (on average 1.3238866396761133) internal successors, (327), 273 states have internal predecessors, (327), 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-13 00:18:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2021-10-13 00:18:38,451 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 43 [2021-10-13 00:18:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:38,452 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2021-10-13 00:18:38,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 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-13 00:18:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2021-10-13 00:18:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-13 00:18:38,453 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:38,454 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:38,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 00:18:38,454 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:38,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:38,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1207787386, now seen corresponding path program 1 times [2021-10-13 00:18:38,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:38,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391101784] [2021-10-13 00:18:38,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:38,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:38,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:18:38,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:38,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391101784] [2021-10-13 00:18:38,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391101784] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:18:38,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838930382] [2021-10-13 00:18:38,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:38,675 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:18:38,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:18:38,689 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:18:38,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 00:18:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:38,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 00:18:38,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:18:38,933 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-13 00:18:38,940 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-13 00:18:39,009 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-10-13 00:18:39,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-10-13 00:18:39,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 00:18:39,019 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-13 00:18:39,505 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-13 00:18:39,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-10-13 00:18:39,517 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-13 00:18:39,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-10-13 00:18:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 00:18:39,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838930382] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:18:39,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:18:39,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2021-10-13 00:18:39,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785339754] [2021-10-13 00:18:39,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 00:18:39,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:39,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 00:18:39,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:18:39,565 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 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-13 00:18:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:40,442 INFO L93 Difference]: Finished difference Result 409 states and 450 transitions. [2021-10-13 00:18:40,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-13 00:18:40,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 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 45 [2021-10-13 00:18:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:40,445 INFO L225 Difference]: With dead ends: 409 [2021-10-13 00:18:40,445 INFO L226 Difference]: Without dead ends: 409 [2021-10-13 00:18:40,445 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 376.5ms TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-10-13 00:18:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-10-13 00:18:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 301. [2021-10-13 00:18:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 271 states have (on average 1.3357933579335792) internal successors, (362), 297 states have internal predecessors, (362), 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-13 00:18:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 365 transitions. [2021-10-13 00:18:40,456 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 365 transitions. Word has length 45 [2021-10-13 00:18:40,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:40,456 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 365 transitions. [2021-10-13 00:18:40,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 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-13 00:18:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 365 transitions. [2021-10-13 00:18:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-13 00:18:40,458 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:40,458 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:40,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 00:18:40,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:18:40,673 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:40,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:40,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1891470081, now seen corresponding path program 1 times [2021-10-13 00:18:40,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:40,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112796009] [2021-10-13 00:18:40,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:40,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:40,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:40,733 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-13 00:18:40,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:40,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112796009] [2021-10-13 00:18:40,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112796009] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:40,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:40,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:18:40,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616995190] [2021-10-13 00:18:40,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:18:40,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:40,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:18:40,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:40,736 INFO L87 Difference]: Start difference. First operand 301 states and 365 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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-13 00:18:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:40,966 INFO L93 Difference]: Finished difference Result 303 states and 365 transitions. [2021-10-13 00:18:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:18:40,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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 45 [2021-10-13 00:18:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:40,970 INFO L225 Difference]: With dead ends: 303 [2021-10-13 00:18:40,970 INFO L226 Difference]: Without dead ends: 303 [2021-10-13 00:18:40,970 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:18:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-10-13 00:18:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-10-13 00:18:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 270 states have (on average 1.325925925925926) internal successors, (358), 295 states have internal predecessors, (358), 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-13 00:18:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2021-10-13 00:18:40,979 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 45 [2021-10-13 00:18:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:40,980 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2021-10-13 00:18:40,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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-13 00:18:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2021-10-13 00:18:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 00:18:40,982 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:40,982 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:40,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 00:18:40,983 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr79ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:40,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1213297892, now seen corresponding path program 1 times [2021-10-13 00:18:40,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:40,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467343091] [2021-10-13 00:18:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:40,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:41,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 00:18:41,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:41,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467343091] [2021-10-13 00:18:41,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467343091] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:18:41,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525769579] [2021-10-13 00:18:41,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:41,064 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:18:41,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:18:41,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:18:41,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 00:18:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:41,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 00:18:41,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:18:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 00:18:41,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525769579] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:18:41,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:18:41,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-10-13 00:18:41,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795688118] [2021-10-13 00:18:41,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:18:41,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:41,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:18:41,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:18:41,801 INFO L87 Difference]: Start difference. First operand 299 states and 361 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 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-13 00:18:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:42,183 INFO L93 Difference]: Finished difference Result 330 states and 392 transitions. [2021-10-13 00:18:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:18:42,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 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 46 [2021-10-13 00:18:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:42,186 INFO L225 Difference]: With dead ends: 330 [2021-10-13 00:18:42,187 INFO L226 Difference]: Without dead ends: 306 [2021-10-13 00:18:42,187 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 53.6ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:18:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-13 00:18:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-10-13 00:18:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 277 states have (on average 1.3176895306859207) internal successors, (365), 302 states have internal predecessors, (365), 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-13 00:18:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 368 transitions. [2021-10-13 00:18:42,196 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 368 transitions. Word has length 46 [2021-10-13 00:18:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:42,196 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 368 transitions. [2021-10-13 00:18:42,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 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-13 00:18:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 368 transitions. [2021-10-13 00:18:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 00:18:42,198 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:42,198 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:42,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 00:18:42,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-10-13 00:18:42,421 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr65REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:42,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:42,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1493965183, now seen corresponding path program 1 times [2021-10-13 00:18:42,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:42,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625648414] [2021-10-13 00:18:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:42,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:42,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:42,630 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-13 00:18:42,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:42,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625648414] [2021-10-13 00:18:42,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625648414] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:42,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:42,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:18:42,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775995962] [2021-10-13 00:18:42,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 00:18:42,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:42,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 00:18:42,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:18:42,633 INFO L87 Difference]: Start difference. First operand 306 states and 368 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-13 00:18:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:43,227 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-10-13 00:18:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:18:43,228 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 46 [2021-10-13 00:18:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:43,230 INFO L225 Difference]: With dead ends: 349 [2021-10-13 00:18:43,230 INFO L226 Difference]: Without dead ends: 349 [2021-10-13 00:18:43,230 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 209.2ms TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-10-13 00:18:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-10-13 00:18:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 313. [2021-10-13 00:18:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 284 states have (on average 1.3169014084507042) internal successors, (374), 309 states have internal predecessors, (374), 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-13 00:18:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 377 transitions. [2021-10-13 00:18:43,241 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 377 transitions. Word has length 46 [2021-10-13 00:18:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:43,241 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 377 transitions. [2021-10-13 00:18:43,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-13 00:18:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 377 transitions. [2021-10-13 00:18:43,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 00:18:43,243 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:43,243 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:43,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-13 00:18:43,244 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr66REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:43,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:43,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1493965182, now seen corresponding path program 1 times [2021-10-13 00:18:43,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:43,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296234721] [2021-10-13 00:18:43,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:43,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:43,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:18:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:18:43,506 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-13 00:18:43,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:18:43,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296234721] [2021-10-13 00:18:43,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296234721] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:18:43,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:18:43,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:18:43,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644955448] [2021-10-13 00:18:43,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 00:18:43,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:18:43,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:18:43,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:18:43,511 INFO L87 Difference]: Start difference. First operand 313 states and 377 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-13 00:18:44,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:18:44,458 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-10-13 00:18:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 00:18:44,458 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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 46 [2021-10-13 00:18:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:18:44,461 INFO L225 Difference]: With dead ends: 349 [2021-10-13 00:18:44,461 INFO L226 Difference]: Without dead ends: 349 [2021-10-13 00:18:44,461 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 290.0ms TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-10-13 00:18:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-10-13 00:18:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 319. [2021-10-13 00:18:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 290 states have (on average 1.313793103448276) internal successors, (381), 315 states have internal predecessors, (381), 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-13 00:18:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2021-10-13 00:18:44,471 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 46 [2021-10-13 00:18:44,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:18:44,471 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2021-10-13 00:18:44,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-13 00:18:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2021-10-13 00:18:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 00:18:44,473 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:18:44,473 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:18:44,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-13 00:18:44,473 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr57REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-13 00:18:44,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:18:44,474 INFO L82 PathProgramCache]: Analyzing trace with hash 292246064, now seen corresponding path program 1 times [2021-10-13 00:18:44,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:18:44,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757301834] [2021-10-13 00:18:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:18:44,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:18:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:18:44,502 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:18:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:18:44,576 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:18:44,576 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:18:44,578 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr57REQUIRES_VIOLATION [2021-10-13 00:18:44,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-10-13 00:18:44,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-10-13 00:18:44,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-10-13 00:18:44,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-10-13 00:18:44,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-10-13 00:18:44,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-10-13 00:18:44,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-10-13 00:18:44,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-10-13 00:18:44,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-10-13 00:18:44,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-10-13 00:18:44,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-10-13 00:18:44,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-10-13 00:18:44,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-10-13 00:18:44,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-10-13 00:18:44,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-10-13 00:18:44,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-10-13 00:18:44,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-10-13 00:18:44,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-10-13 00:18:44,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-10-13 00:18:44,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-10-13 00:18:44,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-10-13 00:18:44,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-10-13 00:18:44,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-10-13 00:18:44,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-10-13 00:18:44,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-10-13 00:18:44,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-10-13 00:18:44,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-10-13 00:18:44,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-10-13 00:18:44,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-10-13 00:18:44,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-10-13 00:18:44,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-10-13 00:18:44,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-10-13 00:18:44,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-10-13 00:18:44,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-10-13 00:18:44,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-10-13 00:18:44,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-10-13 00:18:44,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-10-13 00:18:44,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-10-13 00:18:44,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-10-13 00:18:44,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-10-13 00:18:44,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-10-13 00:18:44,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-10-13 00:18:44,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-10-13 00:18:44,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-10-13 00:18:44,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-10-13 00:18:44,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-10-13 00:18:44,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-10-13 00:18:44,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-10-13 00:18:44,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-10-13 00:18:44,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-10-13 00:18:44,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-10-13 00:18:44,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-10-13 00:18:44,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63REQUIRES_VIOLATION [2021-10-13 00:18:44,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-10-13 00:18:44,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-10-13 00:18:44,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68REQUIRES_VIOLATION [2021-10-13 00:18:44,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-10-13 00:18:44,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 00:18:44,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 00:18:44,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 00:18:44,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74REQUIRES_VIOLATION [2021-10-13 00:18:44,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75REQUIRES_VIOLATION [2021-10-13 00:18:44,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 00:18:44,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 00:18:44,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 00:18:44,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79ENSURES_VIOLATIONMEMORY_LEAK [2021-10-13 00:18:44,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-13 00:18:44,610 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:18:44,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:18:44 BoogieIcfgContainer [2021-10-13 00:18:44,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:18:44,684 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:18:44,684 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:18:44,684 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:18:44,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:18:13" (3/4) ... [2021-10-13 00:18:44,687 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 00:18:44,737 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:18:44,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:18:44,739 INFO L168 Benchmark]: Toolchain (without parser) took 33167.09 ms. Allocated memory was 83.9 MB in the beginning and 195.0 MB in the end (delta: 111.1 MB). Free memory was 47.1 MB in the beginning and 133.4 MB in the end (delta: -86.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:18:44,740 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 83.9 MB. Free memory was 64.6 MB in the beginning and 64.5 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:18:44,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.42 ms. Allocated memory was 83.9 MB in the beginning and 104.9 MB in the end (delta: 21.0 MB). Free memory was 46.9 MB in the beginning and 71.8 MB in the end (delta: -25.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:18:44,741 INFO L168 Benchmark]: Boogie Preprocessor took 103.98 ms. Allocated memory is still 104.9 MB. Free memory was 71.8 MB in the beginning and 68.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:18:44,741 INFO L168 Benchmark]: RCFGBuilder took 1255.20 ms. Allocated memory is still 104.9 MB. Free memory was 68.8 MB in the beginning and 77.4 MB in the end (delta: -8.5 MB). Peak memory consumption was 35.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:18:44,742 INFO L168 Benchmark]: TraceAbstraction took 30954.69 ms. Allocated memory was 104.9 MB in the beginning and 195.0 MB in the end (delta: 90.2 MB). Free memory was 76.8 MB in the beginning and 136.6 MB in the end (delta: -59.8 MB). Peak memory consumption was 31.0 MB. Max. memory is 16.1 GB. [2021-10-13 00:18:44,743 INFO L168 Benchmark]: Witness Printer took 54.18 ms. Allocated memory is still 195.0 MB. Free memory was 136.6 MB in the beginning and 133.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:18:44,745 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.35 ms. Allocated memory is still 83.9 MB. Free memory was 64.6 MB in the beginning and 64.5 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 788.42 ms. Allocated memory was 83.9 MB in the beginning and 104.9 MB in the end (delta: 21.0 MB). Free memory was 46.9 MB in the beginning and 71.8 MB in the end (delta: -25.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 103.98 ms. Allocated memory is still 104.9 MB. Free memory was 71.8 MB in the beginning and 68.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1255.20 ms. Allocated memory is still 104.9 MB. Free memory was 68.8 MB in the beginning and 77.4 MB in the end (delta: -8.5 MB). Peak memory consumption was 35.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 30954.69 ms. Allocated memory was 104.9 MB in the beginning and 195.0 MB in the end (delta: 90.2 MB). Free memory was 76.8 MB in the beginning and 136.6 MB in the end (delta: -59.8 MB). Peak memory consumption was 31.0 MB. Max. memory is 16.1 GB. * Witness Printer took 54.18 ms. Allocated memory is still 195.0 MB. Free memory was 136.6 MB in the beginning and 133.4 MB in the end (delta: 3.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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] 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] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1038] inner = inner->inner [L1039] COND TRUE len == 1 VAL [end={-1:0}, inner={0:0}, len=1, list={-1:0}] [L1040] inner->inner - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: 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 all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 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: 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: 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: 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: 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: 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: 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 all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: 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: 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 all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 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: 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: 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: 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: 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: 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: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1038]: 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 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: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1055]: 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 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 free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: 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 free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: 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, 203 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 30795.8ms, OverallIterations: 38, TraceHistogramMax: 2, EmptinessCheckTime: 58.3ms, AutomataDifference: 20406.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 20.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5010 SDtfs, 6834 SDslu, 14758 SDs, 0 SdLazy, 16128 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12910.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 5560.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=37, InterpolantAutomatonStates: 351, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 408.5ms AutomataMinimizationTime, 37 MinimizatonAttempts, 1401 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 134.3ms SsaConstructionTime, 610.5ms SatisfiabilityAnalysisTime, 7198.6ms InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1220 ConstructedInterpolants, 3 QuantifiedInterpolants, 11356 SizeOfPredicates, 13 NumberOfNonLiveVariables, 583 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 12/19 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-13 00:18:44,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faa01548-49db-4b42-afe8-cd499febd8f1/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...