./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 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY --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 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 08:40:21,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:40:21,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:40:22,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:40:22,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:40:22,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:40:22,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:40:22,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:40:22,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:40:22,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:40:22,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:40:22,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:40:22,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:40:22,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:40:22,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:40:22,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:40:22,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:40:22,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:40:22,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:40:22,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:40:22,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:40:22,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:40:22,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:40:22,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:40:22,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:40:22,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:40:22,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:40:22,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:40:22,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:40:22,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:40:22,067 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:40:22,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:40:22,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:40:22,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:40:22,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:40:22,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:40:22,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:40:22,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:40:22,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:40:22,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:40:22,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:40:22,077 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-07 08:40:22,103 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:40:22,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:40:22,104 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:40:22,104 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:40:22,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:40:22,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:40:22,106 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:40:22,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:40:22,106 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 08:40:22,106 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 08:40:22,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 08:40:22,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 08:40:22,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:40:22,107 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 08:40:22,108 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 08:40:22,108 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-07 08:40:22,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 08:40:22,108 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 08:40:22,109 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 08:40:22,109 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:40:22,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:40:22,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:40:22,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 08:40:22,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:40:22,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:40:22,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 08:40:22,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 08:40:22,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 08:40:22,111 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:40:22,111 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2021-11-07 08:40:22,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:40:22,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:40:22,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:40:22,438 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:40:22,440 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:40:22,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2021-11-07 08:40:22,535 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/data/ff89aec2f/a7c19d7ec6bb4614840a397e9493edf5/FLAG4be93d51d [2021-11-07 08:40:23,090 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:40:23,091 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-11-07 08:40:23,107 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/data/ff89aec2f/a7c19d7ec6bb4614840a397e9493edf5/FLAG4be93d51d [2021-11-07 08:40:23,407 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/data/ff89aec2f/a7c19d7ec6bb4614840a397e9493edf5 [2021-11-07 08:40:23,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:40:23,411 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-07 08:40:23,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:40:23,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:40:23,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:40:23,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:40:23" (1/1) ... [2021-11-07 08:40:23,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a920f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:23, skipping insertion in model container [2021-11-07 08:40:23,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:40:23" (1/1) ... [2021-11-07 08:40:23,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:40:23,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:40:23,839 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-11-07 08:40:23,845 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-11-07 08:40:23,848 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-11-07 08:40:23,849 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-11-07 08:40:23,853 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-11-07 08:40:23,854 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-11-07 08:40:23,857 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-11-07 08:40:23,858 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-11-07 08:40:23,860 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-11-07 08:40:23,862 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-11-07 08:40:23,864 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-11-07 08:40:23,865 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-11-07 08:40:23,866 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-11-07 08:40:23,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:40:23,881 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:40:23,920 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-11-07 08:40:23,937 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-11-07 08:40:23,939 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-11-07 08:40:23,940 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-11-07 08:40:23,943 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-11-07 08:40:23,945 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-11-07 08:40:23,947 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-11-07 08:40:23,958 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-11-07 08:40:23,959 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-11-07 08:40:23,961 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-11-07 08:40:23,962 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-11-07 08:40:23,964 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-11-07 08:40:23,965 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_55d29b71-3e52-45e1-b16a-f0f70701e9bc/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-11-07 08:40:23,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:40:24,007 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:40:24,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:24 WrapperNode [2021-11-07 08:40:24,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:40:24,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:40:24,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:40:24,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:40:24,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:24" (1/1) ... [2021-11-07 08:40:24,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:24" (1/1) ... [2021-11-07 08:40:24,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:24" (1/1) ... [2021-11-07 08:40:24,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:24" (1/1) ... [2021-11-07 08:40:24,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:24" (1/1) ... [2021-11-07 08:40:24,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:24" (1/1) ... [2021-11-07 08:40:24,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:24" (1/1) ... [2021-11-07 08:40:24,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:40:24,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:40:24,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:40:24,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:40:24,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:24" (1/1) ... [2021-11-07 08:40:24,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:40:24,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:40:24,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 08:40:24,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 08:40:24,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-07 08:40:24,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:40:24,230 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-07 08:40:24,230 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-07 08:40:24,230 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-11-07 08:40:24,230 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-11-07 08:40:24,230 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-11-07 08:40:24,230 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-11-07 08:40:24,230 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-11-07 08:40:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-11-07 08:40:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-11-07 08:40:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-11-07 08:40:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-11-07 08:40:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-11-07 08:40:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-11-07 08:40:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-11-07 08:40:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-11-07 08:40:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-11-07 08:40:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-11-07 08:40:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-11-07 08:40:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-11-07 08:40:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-11-07 08:40:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-11-07 08:40:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-11-07 08:40:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-11-07 08:40:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-11-07 08:40:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-11-07 08:40:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-11-07 08:40:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-11-07 08:40:24,234 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-11-07 08:40:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-11-07 08:40:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-11-07 08:40:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-11-07 08:40:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-11-07 08:40:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-11-07 08:40:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-11-07 08:40:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-11-07 08:40:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-11-07 08:40:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-11-07 08:40:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-11-07 08:40:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-11-07 08:40:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-11-07 08:40:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-11-07 08:40:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-11-07 08:40:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-11-07 08:40:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-11-07 08:40:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-11-07 08:40:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-11-07 08:40:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-11-07 08:40:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-11-07 08:40:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-11-07 08:40:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-11-07 08:40:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-11-07 08:40:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-11-07 08:40:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-11-07 08:40:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-11-07 08:40:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-11-07 08:40:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-11-07 08:40:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-11-07 08:40:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-11-07 08:40:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-11-07 08:40:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-11-07 08:40:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-11-07 08:40:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-07 08:40:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-11-07 08:40:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-11-07 08:40:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-11-07 08:40:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-11-07 08:40:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-11-07 08:40:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-11-07 08:40:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-11-07 08:40:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-11-07 08:40:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-11-07 08:40:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-11-07 08:40:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-11-07 08:40:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-11-07 08:40:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-11-07 08:40:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-11-07 08:40:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-11-07 08:40:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-11-07 08:40:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-11-07 08:40:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-11-07 08:40:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-11-07 08:40:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-11-07 08:40:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-11-07 08:40:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-11-07 08:40:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-11-07 08:40:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-11-07 08:40:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-11-07 08:40:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-11-07 08:40:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-11-07 08:40:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-11-07 08:40:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-11-07 08:40:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-11-07 08:40:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-11-07 08:40:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-11-07 08:40:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-11-07 08:40:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-11-07 08:40:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-11-07 08:40:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-11-07 08:40:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-11-07 08:40:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-11-07 08:40:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-11-07 08:40:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-11-07 08:40:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-11-07 08:40:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-11-07 08:40:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-11-07 08:40:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-11-07 08:40:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-07 08:40:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-11-07 08:40:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-11-07 08:40:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-07 08:40:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:40:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-07 08:40:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 08:40:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 08:40:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 08:40:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 08:40:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-07 08:40:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 08:40:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:40:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 08:40:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 08:40:25,115 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:40:25,116 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-11-07 08:40:25,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:40:25 BoogieIcfgContainer [2021-11-07 08:40:25,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:40:25,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 08:40:25,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 08:40:25,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 08:40:25,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:40:23" (1/3) ... [2021-11-07 08:40:25,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3615e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:40:25, skipping insertion in model container [2021-11-07 08:40:25,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:24" (2/3) ... [2021-11-07 08:40:25,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3615e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:40:25, skipping insertion in model container [2021-11-07 08:40:25,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:40:25" (3/3) ... [2021-11-07 08:40:25,138 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-11-07 08:40:25,145 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 08:40:25,146 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-11-07 08:40:25,197 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 08:40:25,203 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 08:40:25,203 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-11-07 08:40:25,224 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-11-07 08:40:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 08:40:25,234 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:25,234 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:25,235 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:25,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1164341321, now seen corresponding path program 1 times [2021-11-07 08:40:25,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:25,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279866853] [2021-11-07 08:40:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:25,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:25,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:25,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:25,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279866853] [2021-11-07 08:40:25,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279866853] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:25,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:25,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:40:25,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194863806] [2021-11-07 08:40:25,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:40:25,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:25,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:40:25,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:25,524 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-11-07 08:40:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:26,006 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2021-11-07 08:40:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:40:26,008 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-11-07 08:40:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:26,024 INFO L225 Difference]: With dead ends: 201 [2021-11-07 08:40:26,025 INFO L226 Difference]: Without dead ends: 197 [2021-11-07 08:40:26,026 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-07 08:40:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2021-11-07 08:40:26,095 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-11-07 08:40:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2021-11-07 08:40:26,110 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 7 [2021-11-07 08:40:26,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:26,110 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2021-11-07 08:40:26,111 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-11-07 08:40:26,111 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2021-11-07 08:40:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 08:40:26,111 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:26,112 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:26,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 08:40:26,112 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:26,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1164341322, now seen corresponding path program 1 times [2021-11-07 08:40:26,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:26,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136013450] [2021-11-07 08:40:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:26,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:26,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:26,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:26,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136013450] [2021-11-07 08:40:26,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136013450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:26,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:26,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:40:26,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735586409] [2021-11-07 08:40:26,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:40:26,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:40:26,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:26,249 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-11-07 08:40:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:26,707 INFO L93 Difference]: Finished difference Result 222 states and 234 transitions. [2021-11-07 08:40:26,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:40:26,708 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-11-07 08:40:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:26,713 INFO L225 Difference]: With dead ends: 222 [2021-11-07 08:40:26,714 INFO L226 Difference]: Without dead ends: 222 [2021-11-07 08:40:26,715 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:26,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-07 08:40:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2021-11-07 08:40:26,737 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-11-07 08:40:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2021-11-07 08:40:26,743 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 7 [2021-11-07 08:40:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:26,743 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2021-11-07 08:40:26,744 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-11-07 08:40:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2021-11-07 08:40:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 08:40:26,745 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:26,745 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:26,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 08:40:26,747 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2054455159, now seen corresponding path program 1 times [2021-11-07 08:40:26,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:26,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845424634] [2021-11-07 08:40:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:26,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:26,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:26,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:26,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845424634] [2021-11-07 08:40:26,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845424634] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:26,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:26,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:40:26,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469424219] [2021-11-07 08:40:26,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:40:26,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:26,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:40:26,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:26,885 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-11-07 08:40:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:27,172 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2021-11-07 08:40:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:40:27,173 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-11-07 08:40:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:27,174 INFO L225 Difference]: With dead ends: 217 [2021-11-07 08:40:27,175 INFO L226 Difference]: Without dead ends: 217 [2021-11-07 08:40:27,175 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-07 08:40:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-11-07 08:40:27,193 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-11-07 08:40:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2021-11-07 08:40:27,195 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 9 [2021-11-07 08:40:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:27,196 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2021-11-07 08:40:27,197 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-11-07 08:40:27,197 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2021-11-07 08:40:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 08:40:27,197 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:27,198 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:27,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 08:40:27,198 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:27,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1492111941, now seen corresponding path program 1 times [2021-11-07 08:40:27,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:27,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124196157] [2021-11-07 08:40:27,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:27,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:27,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:27,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:27,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124196157] [2021-11-07 08:40:27,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124196157] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:27,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:27,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:40:27,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475963160] [2021-11-07 08:40:27,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:40:27,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:27,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:40:27,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:40:27,353 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-11-07 08:40:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:27,712 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-11-07 08:40:27,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 08:40:27,713 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-11-07 08:40:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:27,718 INFO L225 Difference]: With dead ends: 199 [2021-11-07 08:40:27,722 INFO L226 Difference]: Without dead ends: 199 [2021-11-07 08:40:27,722 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:40:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-07 08:40:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-11-07 08:40:27,736 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-11-07 08:40:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-11-07 08:40:27,746 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 15 [2021-11-07 08:40:27,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:27,747 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-11-07 08:40:27,747 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-11-07 08:40:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-11-07 08:40:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 08:40:27,748 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:27,748 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:27,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 08:40:27,749 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:27,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1492111940, now seen corresponding path program 1 times [2021-11-07 08:40:27,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:27,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615739024] [2021-11-07 08:40:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:27,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:27,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:27,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:27,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615739024] [2021-11-07 08:40:27,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615739024] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:27,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:27,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:40:27,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032469853] [2021-11-07 08:40:27,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:40:27,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:27,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:40:27,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:40:27,889 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-11-07 08:40:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:28,252 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2021-11-07 08:40:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 08:40:28,253 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-11-07 08:40:28,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:28,254 INFO L225 Difference]: With dead ends: 198 [2021-11-07 08:40:28,255 INFO L226 Difference]: Without dead ends: 198 [2021-11-07 08:40:28,255 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:40:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-07 08:40:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-07 08:40:28,260 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-11-07 08:40:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-11-07 08:40:28,262 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 15 [2021-11-07 08:40:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:28,262 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-11-07 08:40:28,263 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-11-07 08:40:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-11-07 08:40:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 08:40:28,264 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:28,264 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:28,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 08:40:28,264 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:28,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash 331044621, now seen corresponding path program 1 times [2021-11-07 08:40:28,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:28,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517009649] [2021-11-07 08:40:28,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:28,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:28,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:28,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517009649] [2021-11-07 08:40:28,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517009649] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:28,314 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:28,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:40:28,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263682364] [2021-11-07 08:40:28,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:40:28,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:28,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:40:28,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:28,316 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-11-07 08:40:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:28,543 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-11-07 08:40:28,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:40:28,544 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-11-07 08:40:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:28,545 INFO L225 Difference]: With dead ends: 199 [2021-11-07 08:40:28,546 INFO L226 Difference]: Without dead ends: 199 [2021-11-07 08:40:28,546 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-07 08:40:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-11-07 08:40:28,551 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-11-07 08:40:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-11-07 08:40:28,553 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 17 [2021-11-07 08:40:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:28,553 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-11-07 08:40:28,554 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-11-07 08:40:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-11-07 08:40:28,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 08:40:28,555 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:28,555 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:28,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 08:40:28,556 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:28,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1404699164, now seen corresponding path program 1 times [2021-11-07 08:40:28,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:28,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256353510] [2021-11-07 08:40:28,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:28,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:28,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:28,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:28,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256353510] [2021-11-07 08:40:28,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256353510] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:28,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:28,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 08:40:28,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282124528] [2021-11-07 08:40:28,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 08:40:28,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:28,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 08:40:28,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-07 08:40:28,693 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-11-07 08:40:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:29,226 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2021-11-07 08:40:29,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 08:40:29,226 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-11-07 08:40:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:29,228 INFO L225 Difference]: With dead ends: 199 [2021-11-07 08:40:29,228 INFO L226 Difference]: Without dead ends: 199 [2021-11-07 08:40:29,229 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-07 08:40:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-07 08:40:29,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2021-11-07 08:40:29,233 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-11-07 08:40:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-11-07 08:40:29,234 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 18 [2021-11-07 08:40:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:29,235 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-11-07 08:40:29,235 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-11-07 08:40:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-11-07 08:40:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 08:40:29,236 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:29,236 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:29,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 08:40:29,236 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:29,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:29,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1404699165, now seen corresponding path program 1 times [2021-11-07 08:40:29,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:29,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881874737] [2021-11-07 08:40:29,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:29,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:29,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:29,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:29,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881874737] [2021-11-07 08:40:29,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881874737] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:29,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:29,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 08:40:29,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048688192] [2021-11-07 08:40:29,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 08:40:29,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:29,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 08:40:29,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-07 08:40:29,431 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-11-07 08:40:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:30,054 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2021-11-07 08:40:30,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 08:40:30,055 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-11-07 08:40:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:30,056 INFO L225 Difference]: With dead ends: 198 [2021-11-07 08:40:30,056 INFO L226 Difference]: Without dead ends: 198 [2021-11-07 08:40:30,056 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-07 08:40:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-07 08:40:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-11-07 08:40:30,060 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-11-07 08:40:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-11-07 08:40:30,066 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 18 [2021-11-07 08:40:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:30,066 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-11-07 08:40:30,066 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-11-07 08:40:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-11-07 08:40:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 08:40:30,067 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:30,067 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:30,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 08:40:30,067 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:30,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:30,070 INFO L85 PathProgramCache]: Analyzing trace with hash 307937042, now seen corresponding path program 1 times [2021-11-07 08:40:30,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:30,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005008731] [2021-11-07 08:40:30,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:30,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:30,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:30,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:30,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005008731] [2021-11-07 08:40:30,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005008731] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:30,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:30,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 08:40:30,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439069427] [2021-11-07 08:40:30,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 08:40:30,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:30,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 08:40:30,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:40:30,210 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-11-07 08:40:30,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:30,665 INFO L93 Difference]: Finished difference Result 289 states and 319 transitions. [2021-11-07 08:40:30,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 08:40:30,665 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-11-07 08:40:30,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:30,667 INFO L225 Difference]: With dead ends: 289 [2021-11-07 08:40:30,668 INFO L226 Difference]: Without dead ends: 289 [2021-11-07 08:40:30,668 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-07 08:40:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-07 08:40:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2021-11-07 08:40:30,673 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-11-07 08:40:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2021-11-07 08:40:30,675 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 19 [2021-11-07 08:40:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:30,675 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2021-11-07 08:40:30,676 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-11-07 08:40:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2021-11-07 08:40:30,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 08:40:30,677 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:30,677 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:30,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 08:40:30,677 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:30,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1873843689, now seen corresponding path program 1 times [2021-11-07 08:40:30,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:30,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342431891] [2021-11-07 08:40:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:30,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:30,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:30,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342431891] [2021-11-07 08:40:30,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342431891] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:30,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:30,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:40:30,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996310905] [2021-11-07 08:40:30,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:40:30,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:30,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:40:30,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:40:30,757 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-11-07 08:40:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:31,090 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2021-11-07 08:40:31,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 08:40:31,091 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-11-07 08:40:31,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:31,093 INFO L225 Difference]: With dead ends: 290 [2021-11-07 08:40:31,093 INFO L226 Difference]: Without dead ends: 290 [2021-11-07 08:40:31,093 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:40:31,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-11-07 08:40:31,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2021-11-07 08:40:31,098 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-11-07 08:40:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-11-07 08:40:31,118 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 21 [2021-11-07 08:40:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:31,119 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-11-07 08:40:31,119 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-11-07 08:40:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-11-07 08:40:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 08:40:31,121 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:31,121 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:31,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 08:40:31,121 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:31,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash -515815524, now seen corresponding path program 1 times [2021-11-07 08:40:31,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:31,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935950116] [2021-11-07 08:40:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:31,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:31,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:31,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935950116] [2021-11-07 08:40:31,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935950116] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:31,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:31,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:40:31,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014778681] [2021-11-07 08:40:31,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:40:31,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:31,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:40:31,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:40:31,190 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-11-07 08:40:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:31,498 INFO L93 Difference]: Finished difference Result 193 states and 214 transitions. [2021-11-07 08:40:31,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:40:31,498 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-11-07 08:40:31,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:31,500 INFO L225 Difference]: With dead ends: 193 [2021-11-07 08:40:31,500 INFO L226 Difference]: Without dead ends: 193 [2021-11-07 08:40:31,500 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:40:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-07 08:40:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2021-11-07 08:40:31,505 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-11-07 08:40:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2021-11-07 08:40:31,506 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 23 [2021-11-07 08:40:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:31,507 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2021-11-07 08:40:31,507 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-11-07 08:40:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2021-11-07 08:40:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 08:40:31,508 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:31,508 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:31,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 08:40:31,509 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:31,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash -515815523, now seen corresponding path program 1 times [2021-11-07 08:40:31,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:31,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63329345] [2021-11-07 08:40:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:31,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:31,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:31,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63329345] [2021-11-07 08:40:31,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63329345] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:31,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:31,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:40:31,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337464370] [2021-11-07 08:40:31,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 08:40:31,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:31,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 08:40:31,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:40:31,614 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-11-07 08:40:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:32,024 INFO L93 Difference]: Finished difference Result 249 states and 266 transitions. [2021-11-07 08:40:32,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:40:32,025 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-11-07 08:40:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:32,026 INFO L225 Difference]: With dead ends: 249 [2021-11-07 08:40:32,027 INFO L226 Difference]: Without dead ends: 249 [2021-11-07 08:40:32,027 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:40:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-11-07 08:40:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 212. [2021-11-07 08:40:32,032 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-11-07 08:40:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2021-11-07 08:40:32,033 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 23 [2021-11-07 08:40:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:32,033 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2021-11-07 08:40:32,033 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-11-07 08:40:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2021-11-07 08:40:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 08:40:32,034 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:32,034 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:32,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 08:40:32,035 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:32,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1777429398, now seen corresponding path program 1 times [2021-11-07 08:40:32,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:32,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039461446] [2021-11-07 08:40:32,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:32,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:32,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:32,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:32,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039461446] [2021-11-07 08:40:32,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039461446] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:32,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:32,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:40:32,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342298917] [2021-11-07 08:40:32,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:40:32,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:32,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:40:32,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:40:32,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-11-07 08:40:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:32,335 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2021-11-07 08:40:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:40:32,335 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-11-07 08:40:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:32,337 INFO L225 Difference]: With dead ends: 244 [2021-11-07 08:40:32,337 INFO L226 Difference]: Without dead ends: 244 [2021-11-07 08:40:32,337 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:40:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-07 08:40:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2021-11-07 08:40:32,342 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-11-07 08:40:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2021-11-07 08:40:32,343 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 25 [2021-11-07 08:40:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:32,363 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2021-11-07 08:40:32,364 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-11-07 08:40:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2021-11-07 08:40:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 08:40:32,365 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:32,365 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:32,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 08:40:32,365 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:32,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1241440350, now seen corresponding path program 1 times [2021-11-07 08:40:32,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:32,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593988933] [2021-11-07 08:40:32,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:32,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:32,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:32,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:32,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593988933] [2021-11-07 08:40:32,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593988933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:32,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:32,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:40:32,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207372619] [2021-11-07 08:40:32,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 08:40:32,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:32,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 08:40:32,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:40:32,435 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-11-07 08:40:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:32,799 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-11-07 08:40:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 08:40:32,800 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-11-07 08:40:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:32,802 INFO L225 Difference]: With dead ends: 210 [2021-11-07 08:40:32,802 INFO L226 Difference]: Without dead ends: 210 [2021-11-07 08:40:32,802 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-07 08:40:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-07 08:40:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2021-11-07 08:40:32,807 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-11-07 08:40:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 246 transitions. [2021-11-07 08:40:32,808 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 246 transitions. Word has length 27 [2021-11-07 08:40:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:32,808 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 246 transitions. [2021-11-07 08:40:32,808 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-11-07 08:40:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 246 transitions. [2021-11-07 08:40:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 08:40:32,809 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:32,810 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:32,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 08:40:32,810 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:32,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:32,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1241440351, now seen corresponding path program 1 times [2021-11-07 08:40:32,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:32,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404615364] [2021-11-07 08:40:32,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:32,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:32,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:32,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:32,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404615364] [2021-11-07 08:40:32,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404615364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:32,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:32,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:40:32,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047365259] [2021-11-07 08:40:32,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 08:40:32,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:32,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 08:40:32,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:40:32,927 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-11-07 08:40:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:33,346 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2021-11-07 08:40:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 08:40:33,346 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-11-07 08:40:33,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:33,348 INFO L225 Difference]: With dead ends: 202 [2021-11-07 08:40:33,348 INFO L226 Difference]: Without dead ends: 202 [2021-11-07 08:40:33,348 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-07 08:40:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-07 08:40:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2021-11-07 08:40:33,352 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-11-07 08:40:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2021-11-07 08:40:33,354 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 27 [2021-11-07 08:40:33,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:33,357 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2021-11-07 08:40:33,357 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-11-07 08:40:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2021-11-07 08:40:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 08:40:33,358 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:33,359 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:33,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 08:40:33,359 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr26ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:33,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:33,359 INFO L85 PathProgramCache]: Analyzing trace with hash -976729154, now seen corresponding path program 1 times [2021-11-07 08:40:33,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:33,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961849272] [2021-11-07 08:40:33,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:33,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:33,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:33,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:33,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961849272] [2021-11-07 08:40:33,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961849272] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:33,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:33,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 08:40:33,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919204699] [2021-11-07 08:40:33,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 08:40:33,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:33,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 08:40:33,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:40:33,456 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-11-07 08:40:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:33,782 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2021-11-07 08:40:33,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 08:40:33,782 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-11-07 08:40:33,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:33,784 INFO L225 Difference]: With dead ends: 198 [2021-11-07 08:40:33,784 INFO L226 Difference]: Without dead ends: 198 [2021-11-07 08:40:33,785 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-07 08:40:33,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-07 08:40:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2021-11-07 08:40:33,790 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-11-07 08:40:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2021-11-07 08:40:33,804 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 29 [2021-11-07 08:40:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:33,804 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2021-11-07 08:40:33,804 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-11-07 08:40:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2021-11-07 08:40:33,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-07 08:40:33,809 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:33,810 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:33,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 08:40:33,810 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr59ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash 90529238, now seen corresponding path program 1 times [2021-11-07 08:40:33,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:33,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260978989] [2021-11-07 08:40:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:33,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:33,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:33,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260978989] [2021-11-07 08:40:33,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260978989] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:33,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:33,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:40:33,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672158301] [2021-11-07 08:40:33,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:40:33,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:33,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:40:33,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:33,881 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-11-07 08:40:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:34,098 INFO L93 Difference]: Finished difference Result 264 states and 315 transitions. [2021-11-07 08:40:34,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:40:34,099 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-11-07 08:40:34,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:34,101 INFO L225 Difference]: With dead ends: 264 [2021-11-07 08:40:34,101 INFO L226 Difference]: Without dead ends: 264 [2021-11-07 08:40:34,102 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-07 08:40:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 197. [2021-11-07 08:40:34,108 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-11-07 08:40:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2021-11-07 08:40:34,109 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 31 [2021-11-07 08:40:34,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:34,111 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2021-11-07 08:40:34,111 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-11-07 08:40:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2021-11-07 08:40:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-07 08:40:34,113 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:34,113 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:34,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 08:40:34,114 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:34,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1488582203, now seen corresponding path program 1 times [2021-11-07 08:40:34,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:34,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077260017] [2021-11-07 08:40:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:34,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:34,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:34,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077260017] [2021-11-07 08:40:34,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077260017] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:34,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:34,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:40:34,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557503471] [2021-11-07 08:40:34,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:40:34,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:34,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:40:34,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:34,191 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-11-07 08:40:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:34,395 INFO L93 Difference]: Finished difference Result 195 states and 232 transitions. [2021-11-07 08:40:34,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:40:34,395 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-11-07 08:40:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:34,397 INFO L225 Difference]: With dead ends: 195 [2021-11-07 08:40:34,397 INFO L226 Difference]: Without dead ends: 195 [2021-11-07 08:40:34,397 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-07 08:40:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-11-07 08:40:34,401 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-11-07 08:40:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2021-11-07 08:40:34,402 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 32 [2021-11-07 08:40:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:34,403 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2021-11-07 08:40:34,403 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-11-07 08:40:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2021-11-07 08:40:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 08:40:34,404 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:34,404 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:34,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 08:40:34,404 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:34,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:34,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1098596299, now seen corresponding path program 1 times [2021-11-07 08:40:34,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:34,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860730433] [2021-11-07 08:40:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:34,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:34,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:34,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:34,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860730433] [2021-11-07 08:40:34,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860730433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:34,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:34,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 08:40:34,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764094409] [2021-11-07 08:40:34,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 08:40:34,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:34,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 08:40:34,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-07 08:40:34,567 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-11-07 08:40:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:35,240 INFO L93 Difference]: Finished difference Result 325 states and 363 transitions. [2021-11-07 08:40:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 08:40:35,240 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-11-07 08:40:35,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:35,242 INFO L225 Difference]: With dead ends: 325 [2021-11-07 08:40:35,242 INFO L226 Difference]: Without dead ends: 325 [2021-11-07 08:40:35,243 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-11-07 08:40:35,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-11-07 08:40:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 228. [2021-11-07 08:40:35,262 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-11-07 08:40:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2021-11-07 08:40:35,264 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 33 [2021-11-07 08:40:35,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:35,264 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2021-11-07 08:40:35,265 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-11-07 08:40:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2021-11-07 08:40:35,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-07 08:40:35,265 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:35,266 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:35,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 08:40:35,266 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr46REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:35,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash -49345090, now seen corresponding path program 1 times [2021-11-07 08:40:35,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:35,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701290057] [2021-11-07 08:40:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:35,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:35,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:35,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:35,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701290057] [2021-11-07 08:40:35,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701290057] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:40:35,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393608131] [2021-11-07 08:40:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:35,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:40:35,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:40:35,390 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:40:35,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 08:40:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:35,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-07 08:40:35,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:40:35,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:40:35,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:40:35,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:40:35,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-07 08:40:35,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:40:35,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-07 08:40:36,379 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-07 08:40:36,380 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-11-07 08:40:36,402 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-07 08:40:36,403 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-11-07 08:40:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:36,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393608131] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:40:36,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:40:36,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2021-11-07 08:40:36,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13406821] [2021-11-07 08:40:36,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 08:40:36,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:36,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 08:40:36,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-07 08:40:36,429 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-11-07 08:40:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:37,174 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-11-07 08:40:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 08:40:37,175 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-11-07 08:40:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:37,177 INFO L225 Difference]: With dead ends: 381 [2021-11-07 08:40:37,178 INFO L226 Difference]: Without dead ends: 381 [2021-11-07 08:40:37,179 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-11-07 08:40:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-07 08:40:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 266. [2021-11-07 08:40:37,186 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-11-07 08:40:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2021-11-07 08:40:37,188 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 35 [2021-11-07 08:40:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:37,189 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2021-11-07 08:40:37,189 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-11-07 08:40:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2021-11-07 08:40:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 08:40:37,190 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:37,191 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:37,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 08:40:37,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:40:37,415 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:37,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:37,415 INFO L85 PathProgramCache]: Analyzing trace with hash -824345932, now seen corresponding path program 1 times [2021-11-07 08:40:37,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:37,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217180944] [2021-11-07 08:40:37,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:37,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:37,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:37,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:37,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217180944] [2021-11-07 08:40:37,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217180944] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:37,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:37,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:40:37,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078966191] [2021-11-07 08:40:37,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:40:37,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:37,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:40:37,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:40:37,478 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-11-07 08:40:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:37,786 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2021-11-07 08:40:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 08:40:37,787 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-11-07 08:40:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:37,789 INFO L225 Difference]: With dead ends: 265 [2021-11-07 08:40:37,789 INFO L226 Difference]: Without dead ends: 265 [2021-11-07 08:40:37,789 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:40:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-11-07 08:40:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-11-07 08:40:37,797 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-11-07 08:40:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 323 transitions. [2021-11-07 08:40:37,799 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 323 transitions. Word has length 37 [2021-11-07 08:40:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:37,800 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 323 transitions. [2021-11-07 08:40:37,800 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-11-07 08:40:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 323 transitions. [2021-11-07 08:40:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 08:40:37,801 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:37,801 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:37,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 08:40:37,802 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:37,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:37,803 INFO L85 PathProgramCache]: Analyzing trace with hash -824345931, now seen corresponding path program 1 times [2021-11-07 08:40:37,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:37,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101228871] [2021-11-07 08:40:37,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:37,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:37,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:37,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:37,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101228871] [2021-11-07 08:40:37,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101228871] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:37,914 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:37,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:40:37,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665490891] [2021-11-07 08:40:37,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:40:37,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:37,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:40:37,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:40:37,915 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-11-07 08:40:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:38,248 INFO L93 Difference]: Finished difference Result 264 states and 322 transitions. [2021-11-07 08:40:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 08:40:38,251 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-11-07 08:40:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:38,252 INFO L225 Difference]: With dead ends: 264 [2021-11-07 08:40:38,253 INFO L226 Difference]: Without dead ends: 264 [2021-11-07 08:40:38,253 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:40:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-07 08:40:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2021-11-07 08:40:38,259 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-11-07 08:40:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 322 transitions. [2021-11-07 08:40:38,261 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 322 transitions. Word has length 37 [2021-11-07 08:40:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:38,262 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 322 transitions. [2021-11-07 08:40:38,262 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-11-07 08:40:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 322 transitions. [2021-11-07 08:40:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 08:40:38,263 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:38,263 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:38,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 08:40:38,264 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:38,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:38,264 INFO L85 PathProgramCache]: Analyzing trace with hash 385741532, now seen corresponding path program 1 times [2021-11-07 08:40:38,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:38,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708317668] [2021-11-07 08:40:38,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:38,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:38,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:38,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:38,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708317668] [2021-11-07 08:40:38,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708317668] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:38,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:38,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 08:40:38,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573089288] [2021-11-07 08:40:38,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 08:40:38,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:38,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 08:40:38,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-07 08:40:38,479 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-11-07 08:40:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:39,252 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2021-11-07 08:40:39,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 08:40:39,253 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-11-07 08:40:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:39,255 INFO L225 Difference]: With dead ends: 374 [2021-11-07 08:40:39,255 INFO L226 Difference]: Without dead ends: 374 [2021-11-07 08:40:39,256 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-11-07 08:40:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-11-07 08:40:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 265. [2021-11-07 08:40:39,263 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-11-07 08:40:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 320 transitions. [2021-11-07 08:40:39,265 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 320 transitions. Word has length 38 [2021-11-07 08:40:39,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:39,265 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 320 transitions. [2021-11-07 08:40:39,266 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-11-07 08:40:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 320 transitions. [2021-11-07 08:40:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 08:40:39,266 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:39,267 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:39,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 08:40:39,267 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr50REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:39,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:39,267 INFO L85 PathProgramCache]: Analyzing trace with hash 385741533, now seen corresponding path program 1 times [2021-11-07 08:40:39,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:39,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469450681] [2021-11-07 08:40:39,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:39,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:39,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:39,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469450681] [2021-11-07 08:40:39,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469450681] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:39,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:39,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 08:40:39,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501023217] [2021-11-07 08:40:39,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 08:40:39,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:39,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 08:40:39,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-07 08:40:39,526 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-11-07 08:40:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:40,556 INFO L93 Difference]: Finished difference Result 430 states and 478 transitions. [2021-11-07 08:40:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 08:40:40,556 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-11-07 08:40:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:40,559 INFO L225 Difference]: With dead ends: 430 [2021-11-07 08:40:40,559 INFO L226 Difference]: Without dead ends: 430 [2021-11-07 08:40:40,559 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2021-11-07 08:40:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-11-07 08:40:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 271. [2021-11-07 08:40:40,569 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-11-07 08:40:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 327 transitions. [2021-11-07 08:40:40,571 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 327 transitions. Word has length 38 [2021-11-07 08:40:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:40,571 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 327 transitions. [2021-11-07 08:40:40,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-11-07 08:40:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 327 transitions. [2021-11-07 08:40:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 08:40:40,572 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:40,572 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:40,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 08:40:40,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-11-07 08:40:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2104055878, now seen corresponding path program 1 times [2021-11-07 08:40:40,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:40,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938241902] [2021-11-07 08:40:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:40,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:40,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:40,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:40,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938241902] [2021-11-07 08:40:40,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938241902] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:40,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:40,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:40:40,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809269659] [2021-11-07 08:40:40,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:40:40,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:40,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:40:40,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:40,625 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-11-07 08:40:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:40,831 INFO L93 Difference]: Finished difference Result 273 states and 329 transitions. [2021-11-07 08:40:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:40:40,832 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-11-07 08:40:40,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:40,836 INFO L225 Difference]: With dead ends: 273 [2021-11-07 08:40:40,836 INFO L226 Difference]: Without dead ends: 273 [2021-11-07 08:40:40,836 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-07 08:40:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-11-07 08:40:40,844 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-11-07 08:40:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2021-11-07 08:40:40,846 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 39 [2021-11-07 08:40:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:40,847 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2021-11-07 08:40:40,847 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-11-07 08:40:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2021-11-07 08:40:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 08:40:40,848 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:40,848 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:40,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 08:40:40,849 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:40,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1003773134, now seen corresponding path program 1 times [2021-11-07 08:40:40,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:40,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157369439] [2021-11-07 08:40:40,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:40,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:40,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 08:40:40,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:40,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157369439] [2021-11-07 08:40:40,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157369439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:40,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:40,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 08:40:40,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291559365] [2021-11-07 08:40:40,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 08:40:40,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:40,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 08:40:40,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:40:40,973 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-11-07 08:40:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:41,292 INFO L93 Difference]: Finished difference Result 288 states and 344 transitions. [2021-11-07 08:40:41,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 08:40:41,293 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-11-07 08:40:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:41,294 INFO L225 Difference]: With dead ends: 288 [2021-11-07 08:40:41,294 INFO L226 Difference]: Without dead ends: 288 [2021-11-07 08:40:41,294 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-07 08:40:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-11-07 08:40:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2021-11-07 08:40:41,300 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-11-07 08:40:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 338 transitions. [2021-11-07 08:40:41,301 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 338 transitions. Word has length 40 [2021-11-07 08:40:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:41,302 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 338 transitions. [2021-11-07 08:40:41,302 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-11-07 08:40:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 338 transitions. [2021-11-07 08:40:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 08:40:41,303 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:41,303 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:41,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 08:40:41,303 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:41,303 INFO L85 PathProgramCache]: Analyzing trace with hash 533473399, now seen corresponding path program 1 times [2021-11-07 08:40:41,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:41,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370128284] [2021-11-07 08:40:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:41,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:41,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:41,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:41,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370128284] [2021-11-07 08:40:41,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370128284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:41,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:41,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 08:40:41,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138930270] [2021-11-07 08:40:41,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 08:40:41,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:41,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 08:40:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-07 08:40:41,406 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-11-07 08:40:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:41,761 INFO L93 Difference]: Finished difference Result 282 states and 338 transitions. [2021-11-07 08:40:41,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 08:40:41,761 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-11-07 08:40:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:41,763 INFO L225 Difference]: With dead ends: 282 [2021-11-07 08:40:41,763 INFO L226 Difference]: Without dead ends: 282 [2021-11-07 08:40:41,763 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-07 08:40:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-11-07 08:40:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2021-11-07 08:40:41,768 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-11-07 08:40:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 337 transitions. [2021-11-07 08:40:41,770 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 337 transitions. Word has length 40 [2021-11-07 08:40:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:41,770 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 337 transitions. [2021-11-07 08:40:41,770 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-11-07 08:40:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 337 transitions. [2021-11-07 08:40:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 08:40:41,771 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:41,771 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:41,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 08:40:41,771 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:41,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash 533473400, now seen corresponding path program 1 times [2021-11-07 08:40:41,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:41,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082612646] [2021-11-07 08:40:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:41,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:41,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:41,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082612646] [2021-11-07 08:40:41,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082612646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:41,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:41,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 08:40:41,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108358905] [2021-11-07 08:40:41,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 08:40:41,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:41,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 08:40:41,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-07 08:40:41,900 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-11-07 08:40:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:42,346 INFO L93 Difference]: Finished difference Result 281 states and 337 transitions. [2021-11-07 08:40:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 08:40:42,346 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-11-07 08:40:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:42,348 INFO L225 Difference]: With dead ends: 281 [2021-11-07 08:40:42,348 INFO L226 Difference]: Without dead ends: 281 [2021-11-07 08:40:42,349 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-07 08:40:42,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-11-07 08:40:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2021-11-07 08:40:42,354 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-11-07 08:40:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 336 transitions. [2021-11-07 08:40:42,356 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 336 transitions. Word has length 40 [2021-11-07 08:40:42,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:42,356 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 336 transitions. [2021-11-07 08:40:42,357 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-11-07 08:40:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 336 transitions. [2021-11-07 08:40:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 08:40:42,357 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:42,357 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:42,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 08:40:42,358 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr51ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:42,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:42,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1330432764, now seen corresponding path program 1 times [2021-11-07 08:40:42,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:42,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951929319] [2021-11-07 08:40:42,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:42,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:42,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:42,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:42,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951929319] [2021-11-07 08:40:42,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951929319] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:42,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:42,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-07 08:40:42,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938595502] [2021-11-07 08:40:42,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 08:40:42,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:42,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 08:40:42,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-07 08:40:42,711 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-11-07 08:40:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:43,774 INFO L93 Difference]: Finished difference Result 448 states and 489 transitions. [2021-11-07 08:40:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 08:40:43,775 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-11-07 08:40:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:43,777 INFO L225 Difference]: With dead ends: 448 [2021-11-07 08:40:43,777 INFO L226 Difference]: Without dead ends: 448 [2021-11-07 08:40:43,778 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2021-11-07 08:40:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-11-07 08:40:43,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 280. [2021-11-07 08:40:43,785 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-11-07 08:40:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2021-11-07 08:40:43,787 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 40 [2021-11-07 08:40:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:43,787 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2021-11-07 08:40:43,787 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-11-07 08:40:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2021-11-07 08:40:43,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-07 08:40:43,788 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:43,788 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:43,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 08:40:43,789 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:43,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash -930257781, now seen corresponding path program 1 times [2021-11-07 08:40:43,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:43,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984806706] [2021-11-07 08:40:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:43,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:43,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:43,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984806706] [2021-11-07 08:40:43,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984806706] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:43,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:43,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 08:40:43,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083177912] [2021-11-07 08:40:43,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 08:40:43,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:43,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 08:40:43,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:40:43,908 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-11-07 08:40:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:44,252 INFO L93 Difference]: Finished difference Result 290 states and 346 transitions. [2021-11-07 08:40:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 08:40:44,256 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-11-07 08:40:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:44,258 INFO L225 Difference]: With dead ends: 290 [2021-11-07 08:40:44,258 INFO L226 Difference]: Without dead ends: 290 [2021-11-07 08:40:44,258 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-07 08:40:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-11-07 08:40:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 276. [2021-11-07 08:40:44,265 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-11-07 08:40:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 330 transitions. [2021-11-07 08:40:44,268 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 330 transitions. Word has length 41 [2021-11-07 08:40:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:44,268 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 330 transitions. [2021-11-07 08:40:44,268 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-11-07 08:40:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 330 transitions. [2021-11-07 08:40:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-07 08:40:44,269 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:44,269 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:44,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 08:40:44,271 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr77ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:44,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:44,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1804534839, now seen corresponding path program 1 times [2021-11-07 08:40:44,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:44,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223340594] [2021-11-07 08:40:44,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:44,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:44,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 08:40:44,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:44,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223340594] [2021-11-07 08:40:44,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223340594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:44,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:44,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:40:44,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063137978] [2021-11-07 08:40:44,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:40:44,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:44,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:40:44,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:44,319 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-11-07 08:40:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:44,478 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2021-11-07 08:40:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:40:44,478 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-11-07 08:40:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:44,480 INFO L225 Difference]: With dead ends: 289 [2021-11-07 08:40:44,480 INFO L226 Difference]: Without dead ends: 289 [2021-11-07 08:40:44,480 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-07 08:40:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2021-11-07 08:40:44,509 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-11-07 08:40:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2021-11-07 08:40:44,511 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 42 [2021-11-07 08:40:44,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:44,511 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2021-11-07 08:40:44,511 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-11-07 08:40:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2021-11-07 08:40:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 08:40:44,517 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:44,517 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:44,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 08:40:44,518 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr54ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:44,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:44,519 INFO L85 PathProgramCache]: Analyzing trace with hash 968459560, now seen corresponding path program 1 times [2021-11-07 08:40:44,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:44,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435006179] [2021-11-07 08:40:44,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:44,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:44,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:44,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:44,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435006179] [2021-11-07 08:40:44,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435006179] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:44,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:44,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-07 08:40:44,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399333815] [2021-11-07 08:40:44,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 08:40:44,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:44,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 08:40:44,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-07 08:40:44,847 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-11-07 08:40:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:45,826 INFO L93 Difference]: Finished difference Result 428 states and 475 transitions. [2021-11-07 08:40:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 08:40:45,827 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-11-07 08:40:45,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:45,829 INFO L225 Difference]: With dead ends: 428 [2021-11-07 08:40:45,829 INFO L226 Difference]: Without dead ends: 428 [2021-11-07 08:40:45,830 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-11-07 08:40:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-11-07 08:40:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 277. [2021-11-07 08:40:45,837 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-11-07 08:40:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2021-11-07 08:40:45,839 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 43 [2021-11-07 08:40:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:45,839 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2021-11-07 08:40:45,839 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-11-07 08:40:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2021-11-07 08:40:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-07 08:40:45,840 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:45,841 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:45,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 08:40:45,841 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1207787386, now seen corresponding path program 1 times [2021-11-07 08:40:45,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:45,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582619694] [2021-11-07 08:40:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:45,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:46,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:46,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:46,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582619694] [2021-11-07 08:40:46,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582619694] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:40:46,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300377529] [2021-11-07 08:40:46,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:46,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:40:46,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:40:46,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:40:46,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 08:40:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:46,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-07 08:40:46,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:40:46,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:40:46,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:40:46,303 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-07 08:40:46,303 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-11-07 08:40:46,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:40:46,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-07 08:40:46,766 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-07 08:40:46,767 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-11-07 08:40:46,777 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-07 08:40:46,777 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-11-07 08:40:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 08:40:46,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300377529] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:40:46,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:40:46,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2021-11-07 08:40:46,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418366623] [2021-11-07 08:40:46,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 08:40:46,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:46,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 08:40:46,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-07 08:40:46,820 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-11-07 08:40:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:47,548 INFO L93 Difference]: Finished difference Result 409 states and 450 transitions. [2021-11-07 08:40:47,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 08:40:47,549 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-11-07 08:40:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:47,552 INFO L225 Difference]: With dead ends: 409 [2021-11-07 08:40:47,553 INFO L226 Difference]: Without dead ends: 409 [2021-11-07 08:40:47,553 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-11-07 08:40:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-11-07 08:40:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 301. [2021-11-07 08:40:47,560 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-11-07 08:40:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 365 transitions. [2021-11-07 08:40:47,562 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 365 transitions. Word has length 45 [2021-11-07 08:40:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:47,563 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 365 transitions. [2021-11-07 08:40:47,563 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-11-07 08:40:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 365 transitions. [2021-11-07 08:40:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-07 08:40:47,564 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:47,564 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:47,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-07 08:40:47,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-07 08:40:47,777 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:47,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1891470081, now seen corresponding path program 1 times [2021-11-07 08:40:47,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:47,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183302363] [2021-11-07 08:40:47,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:47,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 08:40:47,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:47,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183302363] [2021-11-07 08:40:47,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183302363] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:47,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:47,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:40:47,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379221500] [2021-11-07 08:40:47,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:40:47,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:47,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:40:47,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:47,827 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-11-07 08:40:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:48,019 INFO L93 Difference]: Finished difference Result 303 states and 365 transitions. [2021-11-07 08:40:48,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:40:48,020 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-11-07 08:40:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:48,022 INFO L225 Difference]: With dead ends: 303 [2021-11-07 08:40:48,022 INFO L226 Difference]: Without dead ends: 303 [2021-11-07 08:40:48,022 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:40:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-11-07 08:40:48,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-11-07 08:40:48,028 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-11-07 08:40:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2021-11-07 08:40:48,030 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 45 [2021-11-07 08:40:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:48,031 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2021-11-07 08:40:48,031 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-11-07 08:40:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2021-11-07 08:40:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-07 08:40:48,032 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:48,032 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:48,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 08:40:48,033 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr79ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1213297892, now seen corresponding path program 1 times [2021-11-07 08:40:48,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:48,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242418415] [2021-11-07 08:40:48,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:48,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:48,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 08:40:48,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:48,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242418415] [2021-11-07 08:40:48,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242418415] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:40:48,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537425315] [2021-11-07 08:40:48,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:48,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:40:48,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:40:48,101 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:40:48,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 08:40:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:48,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 08:40:48,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:40:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 08:40:48,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537425315] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:40:48,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:40:48,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-07 08:40:48,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757581031] [2021-11-07 08:40:48,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 08:40:48,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:48,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 08:40:48,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:40:48,645 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-11-07 08:40:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:48,928 INFO L93 Difference]: Finished difference Result 330 states and 392 transitions. [2021-11-07 08:40:48,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:40:48,928 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-11-07 08:40:48,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:48,930 INFO L225 Difference]: With dead ends: 330 [2021-11-07 08:40:48,930 INFO L226 Difference]: Without dead ends: 306 [2021-11-07 08:40:48,931 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:40:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-07 08:40:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-11-07 08:40:48,937 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-11-07 08:40:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 368 transitions. [2021-11-07 08:40:48,939 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 368 transitions. Word has length 46 [2021-11-07 08:40:48,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:48,939 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 368 transitions. [2021-11-07 08:40:48,939 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-11-07 08:40:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 368 transitions. [2021-11-07 08:40:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-07 08:40:48,940 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:48,940 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:48,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 08:40:49,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-11-07 08:40:49,167 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr65REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:49,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1493965183, now seen corresponding path program 1 times [2021-11-07 08:40:49,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:49,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916165073] [2021-11-07 08:40:49,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:49,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:49,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 08:40:49,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:49,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916165073] [2021-11-07 08:40:49,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916165073] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:49,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:49,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 08:40:49,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519998370] [2021-11-07 08:40:49,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 08:40:49,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:49,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 08:40:49,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-07 08:40:49,372 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-11-07 08:40:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:49,874 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-11-07 08:40:49,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 08:40:49,875 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-11-07 08:40:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:49,876 INFO L225 Difference]: With dead ends: 349 [2021-11-07 08:40:49,876 INFO L226 Difference]: Without dead ends: 349 [2021-11-07 08:40:49,877 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-11-07 08:40:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-11-07 08:40:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 313. [2021-11-07 08:40:49,884 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-11-07 08:40:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 377 transitions. [2021-11-07 08:40:49,885 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 377 transitions. Word has length 46 [2021-11-07 08:40:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:49,886 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 377 transitions. [2021-11-07 08:40:49,886 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-11-07 08:40:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 377 transitions. [2021-11-07 08:40:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-07 08:40:49,887 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:49,887 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:49,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 08:40:49,888 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr66REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:49,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:49,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1493965182, now seen corresponding path program 1 times [2021-11-07 08:40:49,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:49,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419118596] [2021-11-07 08:40:49,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:49,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:50,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:40:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 08:40:50,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:50,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419118596] [2021-11-07 08:40:50,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419118596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:40:50,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:40:50,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 08:40:50,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262157538] [2021-11-07 08:40:50,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 08:40:50,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:50,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 08:40:50,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-07 08:40:50,080 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-11-07 08:40:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:50,636 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-11-07 08:40:50,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 08:40:50,637 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-11-07 08:40:50,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:40:50,640 INFO L225 Difference]: With dead ends: 349 [2021-11-07 08:40:50,640 INFO L226 Difference]: Without dead ends: 349 [2021-11-07 08:40:50,641 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-11-07 08:40:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-11-07 08:40:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 319. [2021-11-07 08:40:50,662 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-11-07 08:40:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2021-11-07 08:40:50,663 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 46 [2021-11-07 08:40:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:40:50,664 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2021-11-07 08:40:50,664 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-11-07 08:40:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2021-11-07 08:40:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-07 08:40:50,665 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:40:50,665 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:50,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-07 08:40:50,666 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr57REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-07 08:40:50,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:50,666 INFO L85 PathProgramCache]: Analyzing trace with hash 292246064, now seen corresponding path program 1 times [2021-11-07 08:40:50,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:50,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888248720] [2021-11-07 08:40:50,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:50,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:40:50,689 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:40:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:40:50,741 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:40:50,741 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 08:40:50,743 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr57REQUIRES_VIOLATION [2021-11-07 08:40:50,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-11-07 08:40:50,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-11-07 08:40:50,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-11-07 08:40:50,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-11-07 08:40:50,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-11-07 08:40:50,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-11-07 08:40:50,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-11-07 08:40:50,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-11-07 08:40:50,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-11-07 08:40:50,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-11-07 08:40:50,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-11-07 08:40:50,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-11-07 08:40:50,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-11-07 08:40:50,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-11-07 08:40:50,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-11-07 08:40:50,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-11-07 08:40:50,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-11-07 08:40:50,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-11-07 08:40:50,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-11-07 08:40:50,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-11-07 08:40:50,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-11-07 08:40:50,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-11-07 08:40:50,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-11-07 08:40:50,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-11-07 08:40:50,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-11-07 08:40:50,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-11-07 08:40:50,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-11-07 08:40:50,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-11-07 08:40:50,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-11-07 08:40:50,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-11-07 08:40:50,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-11-07 08:40:50,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-11-07 08:40:50,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-11-07 08:40:50,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-11-07 08:40:50,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-11-07 08:40:50,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-11-07 08:40:50,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-11-07 08:40:50,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-11-07 08:40:50,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-11-07 08:40:50,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-11-07 08:40:50,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-11-07 08:40:50,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-11-07 08:40:50,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-11-07 08:40:50,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-11-07 08:40:50,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-11-07 08:40:50,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-11-07 08:40:50,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-11-07 08:40:50,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-11-07 08:40:50,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-11-07 08:40:50,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-11-07 08:40:50,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-11-07 08:40:50,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-11-07 08:40:50,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63REQUIRES_VIOLATION [2021-11-07 08:40:50,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-11-07 08:40:50,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-11-07 08:40:50,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68REQUIRES_VIOLATION [2021-11-07 08:40:50,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-11-07 08:40:50,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 08:40:50,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 08:40:50,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 08:40:50,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74REQUIRES_VIOLATION [2021-11-07 08:40:50,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75REQUIRES_VIOLATION [2021-11-07 08:40:50,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 08:40:50,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 08:40:50,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 08:40:50,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79ENSURES_VIOLATIONMEMORY_LEAK [2021-11-07 08:40:50,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-07 08:40:50,765 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:40:50,769 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 08:40:50,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:40:50 BoogieIcfgContainer [2021-11-07 08:40:50,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 08:40:50,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 08:40:50,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 08:40:50,805 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 08:40:50,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:40:25" (3/4) ... [2021-11-07 08:40:50,807 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 08:40:50,855 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/witness.graphml [2021-11-07 08:40:50,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 08:40:50,856 INFO L168 Benchmark]: Toolchain (without parser) took 27444.74 ms. Allocated memory was 81.8 MB in the beginning and 201.3 MB in the end (delta: 119.5 MB). Free memory was 45.7 MB in the beginning and 145.8 MB in the end (delta: -100.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-11-07 08:40:50,856 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 81.8 MB. Free memory was 54.4 MB in the beginning and 54.4 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:40:50,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 595.43 ms. Allocated memory was 81.8 MB in the beginning and 107.0 MB in the end (delta: 25.2 MB). Free memory was 45.5 MB in the beginning and 73.5 MB in the end (delta: -28.0 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. [2021-11-07 08:40:50,857 INFO L168 Benchmark]: Boogie Preprocessor took 126.03 ms. Allocated memory is still 107.0 MB. Free memory was 73.5 MB in the beginning and 70.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 08:40:50,858 INFO L168 Benchmark]: RCFGBuilder took 982.81 ms. Allocated memory is still 107.0 MB. Free memory was 70.1 MB in the beginning and 63.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 17.7 MB. Max. memory is 16.1 GB. [2021-11-07 08:40:50,858 INFO L168 Benchmark]: TraceAbstraction took 25683.42 ms. Allocated memory was 107.0 MB in the beginning and 201.3 MB in the end (delta: 94.4 MB). Free memory was 62.9 MB in the beginning and 148.9 MB in the end (delta: -86.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. [2021-11-07 08:40:50,859 INFO L168 Benchmark]: Witness Printer took 50.97 ms. Allocated memory is still 201.3 MB. Free memory was 148.9 MB in the beginning and 145.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 08:40:50,869 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.30 ms. Allocated memory is still 81.8 MB. Free memory was 54.4 MB in the beginning and 54.4 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 595.43 ms. Allocated memory was 81.8 MB in the beginning and 107.0 MB in the end (delta: 25.2 MB). Free memory was 45.5 MB in the beginning and 73.5 MB in the end (delta: -28.0 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 126.03 ms. Allocated memory is still 107.0 MB. Free memory was 73.5 MB in the beginning and 70.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 982.81 ms. Allocated memory is still 107.0 MB. Free memory was 70.1 MB in the beginning and 63.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 17.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25683.42 ms. Allocated memory was 107.0 MB in the beginning and 201.3 MB in the end (delta: 94.4 MB). Free memory was 62.9 MB in the beginning and 148.9 MB in the end (delta: -86.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. * Witness Printer took 50.97 ms. Allocated memory is still 201.3 MB. Free memory was 148.9 MB in the beginning and 145.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: 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: 25.5s, OverallIterations: 38, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5010 SDtfs, 6834 SDslu, 14758 SDs, 0 SdLazy, 16128 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 4.4s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 1401 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s 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-11-07 08:40:50,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d29b71-3e52-45e1-b16a-f0f70701e9bc/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)