./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 08:56:07,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 08:56:07,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 08:56:07,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 08:56:07,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 08:56:07,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 08:56:07,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 08:56:07,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 08:56:07,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 08:56:07,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 08:56:07,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 08:56:07,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 08:56:07,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 08:56:07,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 08:56:07,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 08:56:07,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 08:56:07,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 08:56:07,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 08:56:07,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 08:56:07,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 08:56:07,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 08:56:07,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 08:56:07,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 08:56:07,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 08:56:07,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 08:56:07,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 08:56:07,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 08:56:07,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 08:56:07,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 08:56:07,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 08:56:07,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 08:56:07,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 08:56:07,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 08:56:07,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 08:56:07,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 08:56:07,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 08:56:07,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 08:56:07,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 08:56:07,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 08:56:07,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 08:56:07,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 08:56:07,722 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-10-28 08:56:07,763 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 08:56:07,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 08:56:07,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 08:56:07,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 08:56:07,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 08:56:07,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 08:56:07,766 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 08:56:07,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 08:56:07,766 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 08:56:07,767 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 08:56:07,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 08:56:07,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 08:56:07,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 08:56:07,768 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-28 08:56:07,768 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-28 08:56:07,768 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-28 08:56:07,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 08:56:07,769 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-28 08:56:07,769 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 08:56:07,769 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 08:56:07,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 08:56:07,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 08:56:07,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 08:56:07,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 08:56:07,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 08:56:07,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 08:56:07,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 08:56:07,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 08:56:07,772 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 08:56:07,772 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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-10-28 08:56:08,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 08:56:08,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 08:56:08,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 08:56:08,117 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 08:56:08,119 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 08:56:08,120 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2021-10-28 08:56:08,201 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/data/254c0f508/2313e09bdfa74e6683392929be8a6f3a/FLAG29efa3ea2 [2021-10-28 08:56:08,895 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 08:56:08,895 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-10-28 08:56:08,914 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/data/254c0f508/2313e09bdfa74e6683392929be8a6f3a/FLAG29efa3ea2 [2021-10-28 08:56:09,141 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/data/254c0f508/2313e09bdfa74e6683392929be8a6f3a [2021-10-28 08:56:09,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 08:56:09,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-28 08:56:09,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 08:56:09,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 08:56:09,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 08:56:09,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:56:09" (1/1) ... [2021-10-28 08:56:09,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0771cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:56:09, skipping insertion in model container [2021-10-28 08:56:09,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:56:09" (1/1) ... [2021-10-28 08:56:09,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 08:56:09,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 08:56:09,603 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-10-28 08:56:09,610 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-10-28 08:56:09,613 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-10-28 08:56:09,614 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-10-28 08:56:09,617 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-10-28 08:56:09,619 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-10-28 08:56:09,621 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-10-28 08:56:09,622 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-10-28 08:56:09,623 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-10-28 08:56:09,625 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-10-28 08:56:09,627 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-10-28 08:56:09,628 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-10-28 08:56:09,629 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-10-28 08:56:09,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:56:09,645 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 08:56:09,677 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-10-28 08:56:09,680 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-10-28 08:56:09,682 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-10-28 08:56:09,683 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-10-28 08:56:09,686 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-10-28 08:56:09,687 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-10-28 08:56:09,689 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-10-28 08:56:09,690 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-10-28 08:56:09,691 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-10-28 08:56:09,692 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-10-28 08:56:09,694 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-10-28 08:56:09,695 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-10-28 08:56:09,696 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_6eac9f62-c4a6-4324-960c-97d7b3c5a261/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-10-28 08:56:09,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:56:09,739 INFO L208 MainTranslator]: Completed translation [2021-10-28 08:56:09,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:56:09 WrapperNode [2021-10-28 08:56:09,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 08:56:09,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 08:56:09,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 08:56:09,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 08:56:09,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:56:09" (1/1) ... [2021-10-28 08:56:09,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:56:09" (1/1) ... [2021-10-28 08:56:09,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:56:09" (1/1) ... [2021-10-28 08:56:09,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:56:09" (1/1) ... [2021-10-28 08:56:09,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:56:09" (1/1) ... [2021-10-28 08:56:09,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:56:09" (1/1) ... [2021-10-28 08:56:09,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:56:09" (1/1) ... [2021-10-28 08:56:09,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 08:56:09,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 08:56:09,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 08:56:09,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 08:56:09,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:56:09" (1/1) ... [2021-10-28 08:56:09,870 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 08:56:09,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:56:09,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 08:56:09,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 08:56:09,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-28 08:56:09,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 08:56:09,955 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-28 08:56:09,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-28 08:56:09,955 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-10-28 08:56:09,956 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-10-28 08:56:09,956 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-10-28 08:56:09,956 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-10-28 08:56:09,956 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-10-28 08:56:09,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-10-28 08:56:09,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-10-28 08:56:09,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-10-28 08:56:09,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-10-28 08:56:09,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-10-28 08:56:09,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-10-28 08:56:09,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-10-28 08:56:09,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-10-28 08:56:09,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-10-28 08:56:09,958 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-10-28 08:56:09,958 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-10-28 08:56:09,958 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-10-28 08:56:09,958 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-10-28 08:56:09,959 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-10-28 08:56:09,959 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-10-28 08:56:09,960 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-10-28 08:56:09,960 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-10-28 08:56:09,960 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-10-28 08:56:09,960 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-10-28 08:56:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-10-28 08:56:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-10-28 08:56:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-10-28 08:56:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-10-28 08:56:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-10-28 08:56:09,962 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-10-28 08:56:09,962 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-10-28 08:56:09,962 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-10-28 08:56:09,962 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-10-28 08:56:09,962 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-10-28 08:56:09,963 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-10-28 08:56:09,963 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-10-28 08:56:09,963 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-10-28 08:56:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-10-28 08:56:09,965 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-10-28 08:56:09,965 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-10-28 08:56:09,966 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-10-28 08:56:09,966 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-10-28 08:56:09,966 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-10-28 08:56:09,966 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-10-28 08:56:09,966 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-10-28 08:56:09,966 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-10-28 08:56:09,966 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-10-28 08:56:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-10-28 08:56:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-10-28 08:56:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-10-28 08:56:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-10-28 08:56:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-10-28 08:56:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-10-28 08:56:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-10-28 08:56:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-10-28 08:56:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-10-28 08:56:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-10-28 08:56:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-10-28 08:56:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-10-28 08:56:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-28 08:56:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-10-28 08:56:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-10-28 08:56:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-10-28 08:56:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-10-28 08:56:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-10-28 08:56:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-10-28 08:56:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-10-28 08:56:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-10-28 08:56:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-10-28 08:56:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-10-28 08:56:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-10-28 08:56:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-10-28 08:56:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-10-28 08:56:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-10-28 08:56:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-10-28 08:56:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-10-28 08:56:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-10-28 08:56:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-10-28 08:56:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-10-28 08:56:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-10-28 08:56:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-10-28 08:56:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-10-28 08:56:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-10-28 08:56:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-10-28 08:56:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-10-28 08:56:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-10-28 08:56:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-10-28 08:56:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-10-28 08:56:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-10-28 08:56:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-10-28 08:56:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-10-28 08:56:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-10-28 08:56:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-10-28 08:56:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-10-28 08:56:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-10-28 08:56:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-10-28 08:56:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-10-28 08:56:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-10-28 08:56:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-10-28 08:56:09,976 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-10-28 08:56:09,979 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-10-28 08:56:09,979 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-10-28 08:56:09,979 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-10-28 08:56:09,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-28 08:56:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-28 08:56:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-10-28 08:56:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-10-28 08:56:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-28 08:56:09,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 08:56:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-28 08:56:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-28 08:56:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-28 08:56:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-28 08:56:09,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 08:56:09,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-28 08:56:09,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 08:56:09,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 08:56:09,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 08:56:09,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 08:56:10,894 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 08:56:10,894 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-10-28 08:56:10,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:56:10 BoogieIcfgContainer [2021-10-28 08:56:10,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 08:56:10,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 08:56:10,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 08:56:10,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 08:56:10,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 08:56:09" (1/3) ... [2021-10-28 08:56:10,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15061e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 08:56:10, skipping insertion in model container [2021-10-28 08:56:10,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:56:09" (2/3) ... [2021-10-28 08:56:10,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15061e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 08:56:10, skipping insertion in model container [2021-10-28 08:56:10,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:56:10" (3/3) ... [2021-10-28 08:56:10,906 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-10-28 08:56:10,912 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 08:56:10,913 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-10-28 08:56:10,984 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 08:56:10,990 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 08:56:10,990 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-10-28 08:56:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 115 states have (on average 2.1652173913043478) internal successors, (249), 195 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-28 08:56:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 08:56:11,017 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:11,018 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:11,019 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:11,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1164341321, now seen corresponding path program 1 times [2021-10-28 08:56:11,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:11,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418538051] [2021-10-28 08:56:11,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:11,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:11,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:11,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:11,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418538051] [2021-10-28 08:56:11,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418538051] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:11,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:11,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:56:11,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18001561] [2021-10-28 08:56:11,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 08:56:11,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:11,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:56:11,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:11,285 INFO L87 Difference]: Start difference. First operand has 200 states, 115 states have (on average 2.1652173913043478) internal successors, (249), 195 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:11,859 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2021-10-28 08:56:11,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:56:11,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-10-28 08:56:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:11,874 INFO L225 Difference]: With dead ends: 201 [2021-10-28 08:56:11,874 INFO L226 Difference]: Without dead ends: 197 [2021-10-28 08:56:11,876 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-10-28 08:56:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2021-10-28 08:56:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.7264957264957266) internal successors, (202), 188 states have internal predecessors, (202), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2021-10-28 08:56:11,928 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 7 [2021-10-28 08:56:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:11,929 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2021-10-28 08:56:11,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2021-10-28 08:56:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 08:56:11,930 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:11,930 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:11,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 08:56:11,931 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1164341322, now seen corresponding path program 1 times [2021-10-28 08:56:11,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:11,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086586437] [2021-10-28 08:56:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:11,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:12,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:12,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086586437] [2021-10-28 08:56:12,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086586437] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:12,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:12,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:56:12,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31356182] [2021-10-28 08:56:12,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 08:56:12,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:12,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:56:12,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:12,044 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:12,516 INFO L93 Difference]: Finished difference Result 222 states and 234 transitions. [2021-10-28 08:56:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:56:12,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-10-28 08:56:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:12,523 INFO L225 Difference]: With dead ends: 222 [2021-10-28 08:56:12,524 INFO L226 Difference]: Without dead ends: 222 [2021-10-28 08:56:12,525 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-28 08:56:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2021-10-28 08:56:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.664179104477612) internal successors, (223), 198 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2021-10-28 08:56:12,564 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 7 [2021-10-28 08:56:12,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:12,565 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2021-10-28 08:56:12,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2021-10-28 08:56:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-28 08:56:12,566 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:12,567 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:12,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 08:56:12,573 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:12,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:12,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2054455159, now seen corresponding path program 1 times [2021-10-28 08:56:12,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:12,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243300138] [2021-10-28 08:56:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:12,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:12,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:12,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:12,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243300138] [2021-10-28 08:56:12,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243300138] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:12,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:12,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:56:12,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190213866] [2021-10-28 08:56:12,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 08:56:12,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:56:12,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:12,730 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:13,038 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2021-10-28 08:56:13,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:56:13,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-10-28 08:56:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:13,041 INFO L225 Difference]: With dead ends: 217 [2021-10-28 08:56:13,041 INFO L226 Difference]: Without dead ends: 217 [2021-10-28 08:56:13,041 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-10-28 08:56:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-10-28 08:56:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 196 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2021-10-28 08:56:13,064 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 9 [2021-10-28 08:56:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:13,065 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2021-10-28 08:56:13,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2021-10-28 08:56:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 08:56:13,066 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:13,067 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:13,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 08:56:13,067 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:13,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1492111941, now seen corresponding path program 1 times [2021-10-28 08:56:13,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:13,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096535103] [2021-10-28 08:56:13,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:13,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:13,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:13,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:13,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096535103] [2021-10-28 08:56:13,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096535103] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:13,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:13,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 08:56:13,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535106183] [2021-10-28 08:56:13,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:56:13,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:13,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:56:13,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:56:13,249 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:13,686 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-10-28 08:56:13,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 08:56:13,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-10-28 08:56:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:13,689 INFO L225 Difference]: With dead ends: 199 [2021-10-28 08:56:13,689 INFO L226 Difference]: Without dead ends: 199 [2021-10-28 08:56:13,689 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 08:56:13,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-28 08:56:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-10-28 08:56:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 195 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-10-28 08:56:13,697 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 15 [2021-10-28 08:56:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:13,698 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-10-28 08:56:13,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-10-28 08:56:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 08:56:13,699 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:13,699 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:13,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 08:56:13,700 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:13,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1492111940, now seen corresponding path program 1 times [2021-10-28 08:56:13,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:13,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589790825] [2021-10-28 08:56:13,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:13,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:13,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:13,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:13,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589790825] [2021-10-28 08:56:13,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589790825] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:13,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:13,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 08:56:13,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452540638] [2021-10-28 08:56:13,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:56:13,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:13,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:56:13,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:56:13,834 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:14,354 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2021-10-28 08:56:14,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 08:56:14,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-10-28 08:56:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:14,357 INFO L225 Difference]: With dead ends: 198 [2021-10-28 08:56:14,357 INFO L226 Difference]: Without dead ends: 198 [2021-10-28 08:56:14,357 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 08:56:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-28 08:56:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-10-28 08:56:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 194 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-10-28 08:56:14,365 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 15 [2021-10-28 08:56:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:14,366 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-10-28 08:56:14,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-10-28 08:56:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 08:56:14,367 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:14,367 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:14,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 08:56:14,368 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:14,368 INFO L85 PathProgramCache]: Analyzing trace with hash 331044621, now seen corresponding path program 1 times [2021-10-28 08:56:14,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:14,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400056047] [2021-10-28 08:56:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:14,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:14,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:14,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400056047] [2021-10-28 08:56:14,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400056047] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:14,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:14,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:56:14,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095710938] [2021-10-28 08:56:14,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 08:56:14,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:14,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:56:14,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:14,478 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:14,725 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-10-28 08:56:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:56:14,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-10-28 08:56:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:14,728 INFO L225 Difference]: With dead ends: 199 [2021-10-28 08:56:14,728 INFO L226 Difference]: Without dead ends: 199 [2021-10-28 08:56:14,729 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-28 08:56:14,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-10-28 08:56:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 195 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-10-28 08:56:14,735 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 17 [2021-10-28 08:56:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:14,736 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-10-28 08:56:14,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-10-28 08:56:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 08:56:14,737 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:14,737 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:14,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 08:56:14,738 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:14,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:14,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1404699164, now seen corresponding path program 1 times [2021-10-28 08:56:14,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:14,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63302779] [2021-10-28 08:56:14,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:14,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:14,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:14,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63302779] [2021-10-28 08:56:14,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63302779] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:14,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:14,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 08:56:14,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972507098] [2021-10-28 08:56:14,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 08:56:14,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:14,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 08:56:14,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 08:56:14,886 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:15,463 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2021-10-28 08:56:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 08:56:15,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-10-28 08:56:15,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:15,465 INFO L225 Difference]: With dead ends: 199 [2021-10-28 08:56:15,465 INFO L226 Difference]: Without dead ends: 199 [2021-10-28 08:56:15,466 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-28 08:56:15,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-28 08:56:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2021-10-28 08:56:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.626865671641791) internal successors, (218), 194 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-10-28 08:56:15,476 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 18 [2021-10-28 08:56:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:15,477 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-10-28 08:56:15,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-10-28 08:56:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 08:56:15,479 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:15,479 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:15,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 08:56:15,480 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1404699165, now seen corresponding path program 1 times [2021-10-28 08:56:15,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:15,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228859046] [2021-10-28 08:56:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:15,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:15,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:15,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:15,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228859046] [2021-10-28 08:56:15,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228859046] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:15,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:15,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 08:56:15,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367948108] [2021-10-28 08:56:15,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 08:56:15,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:15,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 08:56:15,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 08:56:15,744 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:16,389 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2021-10-28 08:56:16,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 08:56:16,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-10-28 08:56:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:16,391 INFO L225 Difference]: With dead ends: 198 [2021-10-28 08:56:16,391 INFO L226 Difference]: Without dead ends: 198 [2021-10-28 08:56:16,391 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-28 08:56:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-28 08:56:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-10-28 08:56:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.6194029850746268) internal successors, (217), 193 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-10-28 08:56:16,398 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 18 [2021-10-28 08:56:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:16,399 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-10-28 08:56:16,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-10-28 08:56:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 08:56:16,400 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:16,401 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:16,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 08:56:16,401 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash 307937042, now seen corresponding path program 1 times [2021-10-28 08:56:16,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:16,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053997775] [2021-10-28 08:56:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:16,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:16,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:16,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:16,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053997775] [2021-10-28 08:56:16,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053997775] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:16,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:16,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 08:56:16,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319895711] [2021-10-28 08:56:16,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 08:56:16,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:16,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 08:56:16,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-28 08:56:16,553 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:17,068 INFO L93 Difference]: Finished difference Result 289 states and 319 transitions. [2021-10-28 08:56:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 08:56:17,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-10-28 08:56:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:17,071 INFO L225 Difference]: With dead ends: 289 [2021-10-28 08:56:17,071 INFO L226 Difference]: Without dead ends: 289 [2021-10-28 08:56:17,071 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-28 08:56:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-28 08:56:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2021-10-28 08:56:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.621212121212121) internal successors, (214), 190 states have internal predecessors, (214), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2021-10-28 08:56:17,078 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 19 [2021-10-28 08:56:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:17,079 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2021-10-28 08:56:17,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:17,079 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2021-10-28 08:56:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 08:56:17,080 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:17,080 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-10-28 08:56:17,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 08:56:17,081 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:17,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1873843689, now seen corresponding path program 1 times [2021-10-28 08:56:17,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:17,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056405950] [2021-10-28 08:56:17,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:17,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:17,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:17,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:17,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056405950] [2021-10-28 08:56:17,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056405950] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:17,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:17,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 08:56:17,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046696702] [2021-10-28 08:56:17,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:56:17,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:17,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:56:17,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:56:17,177 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:17,538 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2021-10-28 08:56:17,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 08:56:17,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-10-28 08:56:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:17,540 INFO L225 Difference]: With dead ends: 290 [2021-10-28 08:56:17,541 INFO L226 Difference]: Without dead ends: 290 [2021-10-28 08:56:17,541 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-28 08:56:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-28 08:56:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2021-10-28 08:56:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.6074074074074074) internal successors, (217), 193 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-10-28 08:56:17,548 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 21 [2021-10-28 08:56:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:17,548 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-10-28 08:56:17,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-10-28 08:56:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-28 08:56:17,550 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:17,550 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-10-28 08:56:17,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 08:56:17,551 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:17,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:17,551 INFO L85 PathProgramCache]: Analyzing trace with hash -515815524, now seen corresponding path program 1 times [2021-10-28 08:56:17,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:17,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123630730] [2021-10-28 08:56:17,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:17,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:17,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:17,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:17,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123630730] [2021-10-28 08:56:17,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123630730] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:17,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:17,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:56:17,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540050879] [2021-10-28 08:56:17,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 08:56:17,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:17,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 08:56:17,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 08:56:17,617 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:17,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:17,913 INFO L93 Difference]: Finished difference Result 193 states and 214 transitions. [2021-10-28 08:56:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 08:56:17,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-10-28 08:56:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:17,915 INFO L225 Difference]: With dead ends: 193 [2021-10-28 08:56:17,915 INFO L226 Difference]: Without dead ends: 193 [2021-10-28 08:56:17,915 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:56:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-10-28 08:56:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2021-10-28 08:56:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 184 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2021-10-28 08:56:17,921 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 23 [2021-10-28 08:56:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:17,921 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2021-10-28 08:56:17,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2021-10-28 08:56:17,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-28 08:56:17,922 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:17,923 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-10-28 08:56:17,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 08:56:17,923 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:17,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:17,923 INFO L85 PathProgramCache]: Analyzing trace with hash -515815523, now seen corresponding path program 1 times [2021-10-28 08:56:17,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:17,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196824294] [2021-10-28 08:56:17,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:17,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:18,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:18,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:18,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:18,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196824294] [2021-10-28 08:56:18,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196824294] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:18,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:18,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 08:56:18,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350998690] [2021-10-28 08:56:18,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 08:56:18,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:18,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 08:56:18,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-28 08:56:18,026 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:18,492 INFO L93 Difference]: Finished difference Result 249 states and 266 transitions. [2021-10-28 08:56:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 08:56:18,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-10-28 08:56:18,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:18,495 INFO L225 Difference]: With dead ends: 249 [2021-10-28 08:56:18,495 INFO L226 Difference]: Without dead ends: 249 [2021-10-28 08:56:18,495 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-10-28 08:56:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-10-28 08:56:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 212. [2021-10-28 08:56:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 208 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2021-10-28 08:56:18,507 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 23 [2021-10-28 08:56:18,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:18,508 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2021-10-28 08:56:18,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2021-10-28 08:56:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-28 08:56:18,510 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:18,510 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-10-28 08:56:18,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 08:56:18,510 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1777429398, now seen corresponding path program 1 times [2021-10-28 08:56:18,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:18,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991462238] [2021-10-28 08:56:18,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:18,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:18,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:18,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991462238] [2021-10-28 08:56:18,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991462238] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:18,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:18,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 08:56:18,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792510982] [2021-10-28 08:56:18,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 08:56:18,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:18,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 08:56:18,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 08:56:18,595 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:18,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:18,906 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2021-10-28 08:56:18,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 08:56:18,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-10-28 08:56:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:18,909 INFO L225 Difference]: With dead ends: 244 [2021-10-28 08:56:18,909 INFO L226 Difference]: Without dead ends: 244 [2021-10-28 08:56:18,910 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:56:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-28 08:56:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2021-10-28 08:56:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 160 states have (on average 1.525) internal successors, (244), 206 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2021-10-28 08:56:18,918 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 25 [2021-10-28 08:56:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:18,920 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2021-10-28 08:56:18,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2021-10-28 08:56:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 08:56:18,922 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:18,922 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:18,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 08:56:18,922 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:18,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:18,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1241440350, now seen corresponding path program 1 times [2021-10-28 08:56:18,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:18,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134048516] [2021-10-28 08:56:18,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:18,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:19,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:19,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:19,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134048516] [2021-10-28 08:56:19,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134048516] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:19,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:19,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 08:56:19,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468209979] [2021-10-28 08:56:19,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 08:56:19,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:19,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 08:56:19,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 08:56:19,017 INFO L87 Difference]: Start difference. First operand 210 states and 247 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:19,447 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-10-28 08:56:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 08:56:19,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-10-28 08:56:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:19,449 INFO L225 Difference]: With dead ends: 210 [2021-10-28 08:56:19,450 INFO L226 Difference]: Without dead ends: 210 [2021-10-28 08:56:19,450 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-10-28 08:56:19,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-28 08:56:19,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2021-10-28 08:56:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.51875) internal successors, (243), 205 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 246 transitions. [2021-10-28 08:56:19,458 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 246 transitions. Word has length 27 [2021-10-28 08:56:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:19,458 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 246 transitions. [2021-10-28 08:56:19,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 246 transitions. [2021-10-28 08:56:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 08:56:19,465 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:19,466 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:19,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 08:56:19,466 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:19,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1241440351, now seen corresponding path program 1 times [2021-10-28 08:56:19,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:19,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730018153] [2021-10-28 08:56:19,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:19,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:19,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:19,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:19,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730018153] [2021-10-28 08:56:19,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730018153] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:19,596 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:19,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 08:56:19,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796485195] [2021-10-28 08:56:19,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 08:56:19,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:19,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 08:56:19,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 08:56:19,602 INFO L87 Difference]: Start difference. First operand 209 states and 246 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:20,091 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2021-10-28 08:56:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 08:56:20,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-10-28 08:56:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:20,094 INFO L225 Difference]: With dead ends: 202 [2021-10-28 08:56:20,094 INFO L226 Difference]: Without dead ends: 202 [2021-10-28 08:56:20,095 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-10-28 08:56:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-28 08:56:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2021-10-28 08:56:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 191 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2021-10-28 08:56:20,104 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 27 [2021-10-28 08:56:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:20,104 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2021-10-28 08:56:20,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2021-10-28 08:56:20,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-28 08:56:20,106 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:20,106 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-10-28 08:56:20,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 08:56:20,106 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr26ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:20,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:20,107 INFO L85 PathProgramCache]: Analyzing trace with hash -976729154, now seen corresponding path program 1 times [2021-10-28 08:56:20,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:20,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298212802] [2021-10-28 08:56:20,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:20,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:20,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:20,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:20,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298212802] [2021-10-28 08:56:20,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298212802] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:20,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:20,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 08:56:20,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457537459] [2021-10-28 08:56:20,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 08:56:20,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:20,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 08:56:20,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 08:56:20,211 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:20,588 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2021-10-28 08:56:20,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 08:56:20,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-10-28 08:56:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:20,590 INFO L225 Difference]: With dead ends: 198 [2021-10-28 08:56:20,590 INFO L226 Difference]: Without dead ends: 198 [2021-10-28 08:56:20,591 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-10-28 08:56:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-28 08:56:20,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2021-10-28 08:56:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 187 states have internal predecessors, (224), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2021-10-28 08:56:20,599 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 29 [2021-10-28 08:56:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:20,599 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2021-10-28 08:56:20,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2021-10-28 08:56:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 08:56:20,603 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:20,603 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:20,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 08:56:20,604 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr59ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:20,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash 90529238, now seen corresponding path program 1 times [2021-10-28 08:56:20,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:20,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963833539] [2021-10-28 08:56:20,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:20,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:20,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:20,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:20,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963833539] [2021-10-28 08:56:20,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963833539] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:20,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:20,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:56:20,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039173911] [2021-10-28 08:56:20,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 08:56:20,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:20,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:56:20,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:20,673 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:20,881 INFO L93 Difference]: Finished difference Result 264 states and 315 transitions. [2021-10-28 08:56:20,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:56:20,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-10-28 08:56:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:20,891 INFO L225 Difference]: With dead ends: 264 [2021-10-28 08:56:20,891 INFO L226 Difference]: Without dead ends: 264 [2021-10-28 08:56:20,892 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-28 08:56:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 197. [2021-10-28 08:56:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.4591194968553458) internal successors, (232), 193 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2021-10-28 08:56:20,900 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 31 [2021-10-28 08:56:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:20,901 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2021-10-28 08:56:20,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2021-10-28 08:56:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 08:56:20,902 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:20,903 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:20,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 08:56:20,904 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:20,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:20,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1488582203, now seen corresponding path program 1 times [2021-10-28 08:56:20,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:20,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381770726] [2021-10-28 08:56:20,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:20,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:20,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:20,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:20,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381770726] [2021-10-28 08:56:20,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381770726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:20,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:20,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:56:20,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598879062] [2021-10-28 08:56:20,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 08:56:20,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:56:20,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:20,967 INFO L87 Difference]: Start difference. First operand 197 states and 235 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:21,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:21,169 INFO L93 Difference]: Finished difference Result 195 states and 232 transitions. [2021-10-28 08:56:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:56:21,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-10-28 08:56:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:21,172 INFO L225 Difference]: With dead ends: 195 [2021-10-28 08:56:21,173 INFO L226 Difference]: Without dead ends: 195 [2021-10-28 08:56:21,173 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-10-28 08:56:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-10-28 08:56:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 158 states have (on average 1.4493670886075949) internal successors, (229), 191 states have internal predecessors, (229), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2021-10-28 08:56:21,179 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 32 [2021-10-28 08:56:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:21,180 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2021-10-28 08:56:21,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2021-10-28 08:56:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 08:56:21,181 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:21,181 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:21,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 08:56:21,182 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:21,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1098596299, now seen corresponding path program 1 times [2021-10-28 08:56:21,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:21,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475298251] [2021-10-28 08:56:21,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:21,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:21,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:21,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:21,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475298251] [2021-10-28 08:56:21,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475298251] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:21,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:21,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 08:56:21,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798338083] [2021-10-28 08:56:21,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 08:56:21,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:21,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 08:56:21,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-28 08:56:21,373 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:22,054 INFO L93 Difference]: Finished difference Result 325 states and 363 transitions. [2021-10-28 08:56:22,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 08:56:22,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-10-28 08:56:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:22,057 INFO L225 Difference]: With dead ends: 325 [2021-10-28 08:56:22,057 INFO L226 Difference]: Without dead ends: 325 [2021-10-28 08:56:22,057 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-10-28 08:56:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-10-28 08:56:22,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 228. [2021-10-28 08:56:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 191 states have (on average 1.3979057591623036) internal successors, (267), 224 states have internal predecessors, (267), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2021-10-28 08:56:22,083 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 33 [2021-10-28 08:56:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:22,083 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2021-10-28 08:56:22,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2021-10-28 08:56:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 08:56:22,084 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:22,084 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-10-28 08:56:22,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 08:56:22,085 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr46REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:22,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash -49345090, now seen corresponding path program 1 times [2021-10-28 08:56:22,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:22,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480289273] [2021-10-28 08:56:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:22,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:22,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:22,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:22,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480289273] [2021-10-28 08:56:22,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480289273] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:56:22,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746948068] [2021-10-28 08:56:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:22,199 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:56:22,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:56:22,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:56:22,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 08:56:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:22,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-28 08:56:22,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:56:22,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-28 08:56:22,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-28 08:56:22,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:56:22,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-28 08:56:22,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:56:22,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-28 08:56:23,234 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-10-28 08:56:23,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 40 [2021-10-28 08:56:23,258 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-10-28 08:56:23,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 22 [2021-10-28 08:56:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:23,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746948068] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:56:23,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:56:23,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2021-10-28 08:56:23,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614907197] [2021-10-28 08:56:23,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 08:56:23,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:23,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 08:56:23,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-28 08:56:23,283 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:24,031 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-10-28 08:56:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 08:56:24,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-10-28 08:56:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:24,034 INFO L225 Difference]: With dead ends: 381 [2021-10-28 08:56:24,035 INFO L226 Difference]: Without dead ends: 381 [2021-10-28 08:56:24,036 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-10-28 08:56:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-10-28 08:56:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 266. [2021-10-28 08:56:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 229 states have (on average 1.4017467248908297) internal successors, (321), 262 states have internal predecessors, (321), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2021-10-28 08:56:24,046 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 35 [2021-10-28 08:56:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:24,047 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2021-10-28 08:56:24,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2021-10-28 08:56:24,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 08:56:24,048 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:24,049 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-10-28 08:56:24,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-28 08:56:24,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:56:24,281 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:24,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash -824345932, now seen corresponding path program 1 times [2021-10-28 08:56:24,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:24,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684120918] [2021-10-28 08:56:24,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:24,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:24,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:24,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:24,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684120918] [2021-10-28 08:56:24,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684120918] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:24,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:24,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 08:56:24,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954053787] [2021-10-28 08:56:24,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:56:24,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:24,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:56:24,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:56:24,357 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:24,668 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2021-10-28 08:56:24,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 08:56:24,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-10-28 08:56:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:24,670 INFO L225 Difference]: With dead ends: 265 [2021-10-28 08:56:24,670 INFO L226 Difference]: Without dead ends: 265 [2021-10-28 08:56:24,671 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 08:56:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-10-28 08:56:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-10-28 08:56:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 229 states have (on average 1.3973799126637554) internal successors, (320), 261 states have internal predecessors, (320), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 323 transitions. [2021-10-28 08:56:24,679 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 323 transitions. Word has length 37 [2021-10-28 08:56:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:24,680 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 323 transitions. [2021-10-28 08:56:24,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 323 transitions. [2021-10-28 08:56:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 08:56:24,681 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:24,681 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:24,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 08:56:24,682 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:24,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash -824345931, now seen corresponding path program 1 times [2021-10-28 08:56:24,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:24,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170595749] [2021-10-28 08:56:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:24,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:24,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:24,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:24,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170595749] [2021-10-28 08:56:24,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170595749] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:24,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:24,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 08:56:24,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510445671] [2021-10-28 08:56:24,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:56:24,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:24,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:56:24,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:56:24,813 INFO L87 Difference]: Start difference. First operand 265 states and 323 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:25,079 INFO L93 Difference]: Finished difference Result 264 states and 322 transitions. [2021-10-28 08:56:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 08:56:25,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-10-28 08:56:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:25,085 INFO L225 Difference]: With dead ends: 264 [2021-10-28 08:56:25,085 INFO L226 Difference]: Without dead ends: 264 [2021-10-28 08:56:25,086 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 08:56:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-28 08:56:25,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2021-10-28 08:56:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 260 states have internal predecessors, (319), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 322 transitions. [2021-10-28 08:56:25,094 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 322 transitions. Word has length 37 [2021-10-28 08:56:25,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:25,094 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 322 transitions. [2021-10-28 08:56:25,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 322 transitions. [2021-10-28 08:56:25,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 08:56:25,095 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:25,096 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-10-28 08:56:25,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 08:56:25,096 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:25,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:25,097 INFO L85 PathProgramCache]: Analyzing trace with hash 385741532, now seen corresponding path program 1 times [2021-10-28 08:56:25,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:25,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929353823] [2021-10-28 08:56:25,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:25,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:25,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:25,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929353823] [2021-10-28 08:56:25,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929353823] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:25,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:25,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 08:56:25,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334184193] [2021-10-28 08:56:25,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 08:56:25,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:25,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 08:56:25,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-28 08:56:25,267 INFO L87 Difference]: Start difference. First operand 264 states and 322 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:26,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:26,039 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2021-10-28 08:56:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 08:56:26,048 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-10-28 08:56:26,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:26,051 INFO L225 Difference]: With dead ends: 374 [2021-10-28 08:56:26,051 INFO L226 Difference]: Without dead ends: 374 [2021-10-28 08:56:26,052 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-10-28 08:56:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-10-28 08:56:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 265. [2021-10-28 08:56:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 261 states have internal predecessors, (317), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 320 transitions. [2021-10-28 08:56:26,062 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 320 transitions. Word has length 38 [2021-10-28 08:56:26,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:26,062 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 320 transitions. [2021-10-28 08:56:26,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 320 transitions. [2021-10-28 08:56:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 08:56:26,063 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:26,064 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-10-28 08:56:26,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 08:56:26,064 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr50REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:26,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash 385741533, now seen corresponding path program 1 times [2021-10-28 08:56:26,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:26,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126268333] [2021-10-28 08:56:26,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:26,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:26,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:26,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126268333] [2021-10-28 08:56:26,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126268333] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:26,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:26,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 08:56:26,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439564855] [2021-10-28 08:56:26,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 08:56:26,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:26,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 08:56:26,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-28 08:56:26,346 INFO L87 Difference]: Start difference. First operand 265 states and 320 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:27,284 INFO L93 Difference]: Finished difference Result 430 states and 478 transitions. [2021-10-28 08:56:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 08:56:27,284 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-10-28 08:56:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:27,287 INFO L225 Difference]: With dead ends: 430 [2021-10-28 08:56:27,287 INFO L226 Difference]: Without dead ends: 430 [2021-10-28 08:56:27,288 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-10-28 08:56:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-10-28 08:56:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 271. [2021-10-28 08:56:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 238 states have (on average 1.361344537815126) internal successors, (324), 267 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 327 transitions. [2021-10-28 08:56:27,298 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 327 transitions. Word has length 38 [2021-10-28 08:56:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:27,298 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 327 transitions. [2021-10-28 08:56:27,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 327 transitions. [2021-10-28 08:56:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 08:56:27,299 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:27,300 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:27,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 08:56:27,300 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:27,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2104055878, now seen corresponding path program 1 times [2021-10-28 08:56:27,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:27,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962008500] [2021-10-28 08:56:27,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:27,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:27,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:27,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:27,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962008500] [2021-10-28 08:56:27,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962008500] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:27,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:27,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:56:27,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855713196] [2021-10-28 08:56:27,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 08:56:27,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:27,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:56:27,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:27,366 INFO L87 Difference]: Start difference. First operand 271 states and 327 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:27,544 INFO L93 Difference]: Finished difference Result 273 states and 329 transitions. [2021-10-28 08:56:27,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:56:27,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-10-28 08:56:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:27,548 INFO L225 Difference]: With dead ends: 273 [2021-10-28 08:56:27,548 INFO L226 Difference]: Without dead ends: 273 [2021-10-28 08:56:27,548 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:27,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-28 08:56:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-10-28 08:56:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 240 states have (on average 1.3583333333333334) internal successors, (326), 269 states have internal predecessors, (326), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2021-10-28 08:56:27,559 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 39 [2021-10-28 08:56:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:27,559 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2021-10-28 08:56:27,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2021-10-28 08:56:27,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 08:56:27,560 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:27,560 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-10-28 08:56:27,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 08:56:27,561 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:27,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1003773134, now seen corresponding path program 1 times [2021-10-28 08:56:27,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:27,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646764089] [2021-10-28 08:56:27,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:27,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:27,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:56:27,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:27,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646764089] [2021-10-28 08:56:27,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646764089] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:27,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:27,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 08:56:27,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361637858] [2021-10-28 08:56:27,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 08:56:27,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:27,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 08:56:27,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-28 08:56:27,687 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:28,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:28,025 INFO L93 Difference]: Finished difference Result 288 states and 344 transitions. [2021-10-28 08:56:28,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 08:56:28,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-28 08:56:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:28,028 INFO L225 Difference]: With dead ends: 288 [2021-10-28 08:56:28,028 INFO L226 Difference]: Without dead ends: 288 [2021-10-28 08:56:28,028 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-28 08:56:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-10-28 08:56:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2021-10-28 08:56:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 249 states have (on average 1.3453815261044177) internal successors, (335), 278 states have internal predecessors, (335), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 338 transitions. [2021-10-28 08:56:28,035 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 338 transitions. Word has length 40 [2021-10-28 08:56:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:28,036 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 338 transitions. [2021-10-28 08:56:28,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 338 transitions. [2021-10-28 08:56:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 08:56:28,037 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:28,037 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-10-28 08:56:28,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-28 08:56:28,038 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:28,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash 533473399, now seen corresponding path program 1 times [2021-10-28 08:56:28,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:28,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767160294] [2021-10-28 08:56:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:28,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:28,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:28,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:28,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767160294] [2021-10-28 08:56:28,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767160294] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:28,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:28,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 08:56:28,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330661434] [2021-10-28 08:56:28,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 08:56:28,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:28,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 08:56:28,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 08:56:28,177 INFO L87 Difference]: Start difference. First operand 282 states and 338 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:28,534 INFO L93 Difference]: Finished difference Result 282 states and 338 transitions. [2021-10-28 08:56:28,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 08:56:28,535 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-28 08:56:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:28,536 INFO L225 Difference]: With dead ends: 282 [2021-10-28 08:56:28,536 INFO L226 Difference]: Without dead ends: 282 [2021-10-28 08:56:28,537 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-10-28 08:56:28,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-28 08:56:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2021-10-28 08:56:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 249 states have (on average 1.3413654618473896) internal successors, (334), 277 states have internal predecessors, (334), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 337 transitions. [2021-10-28 08:56:28,546 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 337 transitions. Word has length 40 [2021-10-28 08:56:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:28,546 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 337 transitions. [2021-10-28 08:56:28,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 337 transitions. [2021-10-28 08:56:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 08:56:28,547 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:28,548 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-10-28 08:56:28,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-28 08:56:28,548 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:28,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:28,549 INFO L85 PathProgramCache]: Analyzing trace with hash 533473400, now seen corresponding path program 1 times [2021-10-28 08:56:28,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:28,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587599152] [2021-10-28 08:56:28,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:28,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:28,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:28,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:28,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587599152] [2021-10-28 08:56:28,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587599152] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:28,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:28,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 08:56:28,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946678244] [2021-10-28 08:56:28,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 08:56:28,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:28,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 08:56:28,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 08:56:28,715 INFO L87 Difference]: Start difference. First operand 281 states and 337 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:29,220 INFO L93 Difference]: Finished difference Result 281 states and 337 transitions. [2021-10-28 08:56:29,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 08:56:29,221 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-28 08:56:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:29,222 INFO L225 Difference]: With dead ends: 281 [2021-10-28 08:56:29,222 INFO L226 Difference]: Without dead ends: 281 [2021-10-28 08:56:29,223 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-28 08:56:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-10-28 08:56:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2021-10-28 08:56:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3373493975903614) internal successors, (333), 276 states have internal predecessors, (333), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 336 transitions. [2021-10-28 08:56:29,231 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 336 transitions. Word has length 40 [2021-10-28 08:56:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:29,232 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 336 transitions. [2021-10-28 08:56:29,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 336 transitions. [2021-10-28 08:56:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 08:56:29,233 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:29,233 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-10-28 08:56:29,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-28 08:56:29,234 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr51ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:29,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:29,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1330432764, now seen corresponding path program 1 times [2021-10-28 08:56:29,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:29,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967400513] [2021-10-28 08:56:29,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:29,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:29,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:29,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967400513] [2021-10-28 08:56:29,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967400513] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:29,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:29,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 08:56:29,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750758415] [2021-10-28 08:56:29,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 08:56:29,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 08:56:29,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-10-28 08:56:29,588 INFO L87 Difference]: Start difference. First operand 280 states and 336 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:30,722 INFO L93 Difference]: Finished difference Result 448 states and 489 transitions. [2021-10-28 08:56:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-28 08:56:30,723 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-28 08:56:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:30,725 INFO L225 Difference]: With dead ends: 448 [2021-10-28 08:56:30,726 INFO L226 Difference]: Without dead ends: 448 [2021-10-28 08:56:30,726 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2021-10-28 08:56:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-10-28 08:56:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 280. [2021-10-28 08:56:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3333333333333333) internal successors, (332), 276 states have internal predecessors, (332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2021-10-28 08:56:30,737 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 40 [2021-10-28 08:56:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:30,738 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2021-10-28 08:56:30,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2021-10-28 08:56:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 08:56:30,739 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:30,739 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:30,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-28 08:56:30,740 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:30,741 INFO L85 PathProgramCache]: Analyzing trace with hash -930257781, now seen corresponding path program 1 times [2021-10-28 08:56:30,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:30,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349868411] [2021-10-28 08:56:30,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:30,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:30,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:30,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:30,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349868411] [2021-10-28 08:56:30,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349868411] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:30,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:30,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 08:56:30,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393067848] [2021-10-28 08:56:30,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 08:56:30,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:30,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 08:56:30,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-28 08:56:30,874 INFO L87 Difference]: Start difference. First operand 280 states and 335 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:31,247 INFO L93 Difference]: Finished difference Result 290 states and 346 transitions. [2021-10-28 08:56:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 08:56:31,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-10-28 08:56:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:31,250 INFO L225 Difference]: With dead ends: 290 [2021-10-28 08:56:31,250 INFO L226 Difference]: Without dead ends: 290 [2021-10-28 08:56:31,251 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-28 08:56:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-28 08:56:31,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 276. [2021-10-28 08:56:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 246 states have (on average 1.329268292682927) internal successors, (327), 272 states have internal predecessors, (327), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 330 transitions. [2021-10-28 08:56:31,259 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 330 transitions. Word has length 41 [2021-10-28 08:56:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:31,259 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 330 transitions. [2021-10-28 08:56:31,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 330 transitions. [2021-10-28 08:56:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-28 08:56:31,261 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:31,261 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-10-28 08:56:31,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-28 08:56:31,261 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr77ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:31,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:31,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1804534839, now seen corresponding path program 1 times [2021-10-28 08:56:31,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:31,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967809657] [2021-10-28 08:56:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:31,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:31,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:56:31,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:31,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967809657] [2021-10-28 08:56:31,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967809657] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:31,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:31,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:56:31,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926599035] [2021-10-28 08:56:31,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 08:56:31,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:31,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:56:31,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:31,315 INFO L87 Difference]: Start difference. First operand 276 states and 330 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:31,511 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2021-10-28 08:56:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:56:31,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2021-10-28 08:56:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:31,514 INFO L225 Difference]: With dead ends: 289 [2021-10-28 08:56:31,515 INFO L226 Difference]: Without dead ends: 289 [2021-10-28 08:56:31,515 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-28 08:56:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2021-10-28 08:56:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 247 states have (on average 1.3279352226720649) internal successors, (328), 273 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2021-10-28 08:56:31,524 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 42 [2021-10-28 08:56:31,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:31,525 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2021-10-28 08:56:31,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2021-10-28 08:56:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-28 08:56:31,533 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:31,533 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:31,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-28 08:56:31,534 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr54ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:31,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:31,534 INFO L85 PathProgramCache]: Analyzing trace with hash 968459560, now seen corresponding path program 1 times [2021-10-28 08:56:31,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:31,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568527820] [2021-10-28 08:56:31,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:31,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:31,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:31,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:31,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568527820] [2021-10-28 08:56:31,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568527820] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:31,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:31,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 08:56:31,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367612123] [2021-10-28 08:56:31,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 08:56:31,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:31,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 08:56:31,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-10-28 08:56:31,898 INFO L87 Difference]: Start difference. First operand 277 states and 331 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:32,969 INFO L93 Difference]: Finished difference Result 428 states and 475 transitions. [2021-10-28 08:56:32,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-28 08:56:32,970 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-10-28 08:56:32,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:32,973 INFO L225 Difference]: With dead ends: 428 [2021-10-28 08:56:32,973 INFO L226 Difference]: Without dead ends: 428 [2021-10-28 08:56:32,975 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-10-28 08:56:32,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-10-28 08:56:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 277. [2021-10-28 08:56:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 247 states have (on average 1.3238866396761133) internal successors, (327), 273 states have internal predecessors, (327), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2021-10-28 08:56:32,991 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 43 [2021-10-28 08:56:32,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:32,991 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2021-10-28 08:56:32,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2021-10-28 08:56:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-28 08:56:32,995 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:32,995 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-10-28 08:56:32,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-28 08:56:32,995 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1207787386, now seen corresponding path program 1 times [2021-10-28 08:56:32,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:32,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486900508] [2021-10-28 08:56:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:32,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:33,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:33,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:33,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486900508] [2021-10-28 08:56:33,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486900508] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:56:33,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961690516] [2021-10-28 08:56:33,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:33,218 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:56:33,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:56:33,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:56:33,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-28 08:56:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:33,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-28 08:56:33,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:56:33,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-28 08:56:33,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-28 08:56:33,563 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-10-28 08:56:33,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-10-28 08:56:33,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:56:33,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-28 08:56:34,045 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-28 08:56:34,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-10-28 08:56:34,057 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-28 08:56:34,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-10-28 08:56:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:56:34,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961690516] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:56:34,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:56:34,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2021-10-28 08:56:34,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015873917] [2021-10-28 08:56:34,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 08:56:34,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:34,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 08:56:34,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-10-28 08:56:34,100 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:34,813 INFO L93 Difference]: Finished difference Result 409 states and 450 transitions. [2021-10-28 08:56:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 08:56:34,813 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-10-28 08:56:34,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:34,816 INFO L225 Difference]: With dead ends: 409 [2021-10-28 08:56:34,817 INFO L226 Difference]: Without dead ends: 409 [2021-10-28 08:56:34,817 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-10-28 08:56:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-10-28 08:56:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 301. [2021-10-28 08:56:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 271 states have (on average 1.3357933579335792) internal successors, (362), 297 states have internal predecessors, (362), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 365 transitions. [2021-10-28 08:56:34,828 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 365 transitions. Word has length 45 [2021-10-28 08:56:34,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:34,829 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 365 transitions. [2021-10-28 08:56:34,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 365 transitions. [2021-10-28 08:56:34,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-28 08:56:34,830 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:34,831 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-10-28 08:56:34,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-28 08:56:35,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:56:35,041 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:35,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1891470081, now seen corresponding path program 1 times [2021-10-28 08:56:35,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:35,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326329620] [2021-10-28 08:56:35,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:35,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:35,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:56:35,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:35,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326329620] [2021-10-28 08:56:35,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326329620] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:35,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:35,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:56:35,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458791911] [2021-10-28 08:56:35,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 08:56:35,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:35,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:56:35,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:35,128 INFO L87 Difference]: Start difference. First operand 301 states and 365 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:35,416 INFO L93 Difference]: Finished difference Result 303 states and 365 transitions. [2021-10-28 08:56:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:56:35,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-10-28 08:56:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:35,418 INFO L225 Difference]: With dead ends: 303 [2021-10-28 08:56:35,418 INFO L226 Difference]: Without dead ends: 303 [2021-10-28 08:56:35,419 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:56:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-10-28 08:56:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-10-28 08:56:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 270 states have (on average 1.325925925925926) internal successors, (358), 295 states have internal predecessors, (358), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2021-10-28 08:56:35,428 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 45 [2021-10-28 08:56:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:35,428 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2021-10-28 08:56:35,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2021-10-28 08:56:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-28 08:56:35,434 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:35,434 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-10-28 08:56:35,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-28 08:56:35,435 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr79ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1213297892, now seen corresponding path program 1 times [2021-10-28 08:56:35,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:35,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713543954] [2021-10-28 08:56:35,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:35,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:35,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:56:35,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:35,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713543954] [2021-10-28 08:56:35,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713543954] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:56:35,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54041818] [2021-10-28 08:56:35,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:35,519 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:56:35,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:56:35,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:56:35,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-28 08:56:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:35,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-28 08:56:35,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:56:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:56:36,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54041818] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:56:36,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:56:36,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-10-28 08:56:36,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098126977] [2021-10-28 08:56:36,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 08:56:36,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:36,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 08:56:36,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-28 08:56:36,107 INFO L87 Difference]: Start difference. First operand 299 states and 361 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:36,477 INFO L93 Difference]: Finished difference Result 330 states and 392 transitions. [2021-10-28 08:56:36,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 08:56:36,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-10-28 08:56:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:36,480 INFO L225 Difference]: With dead ends: 330 [2021-10-28 08:56:36,480 INFO L226 Difference]: Without dead ends: 306 [2021-10-28 08:56:36,481 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-10-28 08:56:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-28 08:56:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-10-28 08:56:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 277 states have (on average 1.3176895306859207) internal successors, (365), 302 states have internal predecessors, (365), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 368 transitions. [2021-10-28 08:56:36,490 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 368 transitions. Word has length 46 [2021-10-28 08:56:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:36,490 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 368 transitions. [2021-10-28 08:56:36,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 368 transitions. [2021-10-28 08:56:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-28 08:56:36,492 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:36,492 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-10-28 08:56:36,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-28 08:56:36,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-10-28 08:56:36,693 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr65REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1493965183, now seen corresponding path program 1 times [2021-10-28 08:56:36,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:36,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788677481] [2021-10-28 08:56:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:36,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:36,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:56:36,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:36,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788677481] [2021-10-28 08:56:36,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788677481] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:36,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:36,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 08:56:36,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696008764] [2021-10-28 08:56:36,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 08:56:36,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:36,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 08:56:36,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-28 08:56:36,884 INFO L87 Difference]: Start difference. First operand 306 states and 368 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:37,518 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-10-28 08:56:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 08:56:37,518 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-10-28 08:56:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:37,521 INFO L225 Difference]: With dead ends: 349 [2021-10-28 08:56:37,521 INFO L226 Difference]: Without dead ends: 349 [2021-10-28 08:56:37,521 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-10-28 08:56:37,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-10-28 08:56:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 313. [2021-10-28 08:56:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 284 states have (on average 1.3169014084507042) internal successors, (374), 309 states have internal predecessors, (374), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 377 transitions. [2021-10-28 08:56:37,531 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 377 transitions. Word has length 46 [2021-10-28 08:56:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:37,532 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 377 transitions. [2021-10-28 08:56:37,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 377 transitions. [2021-10-28 08:56:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-28 08:56:37,534 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:37,534 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-10-28 08:56:37,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-28 08:56:37,534 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr66REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:37,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:37,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1493965182, now seen corresponding path program 1 times [2021-10-28 08:56:37,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:37,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177966367] [2021-10-28 08:56:37,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:37,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:37,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 08:56:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:56:37,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:37,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177966367] [2021-10-28 08:56:37,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177966367] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:37,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:37,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 08:56:37,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452840151] [2021-10-28 08:56:37,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 08:56:37,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:37,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 08:56:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-28 08:56:37,809 INFO L87 Difference]: Start difference. First operand 313 states and 377 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:38,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:56:38,562 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-10-28 08:56:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 08:56:38,563 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-10-28 08:56:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:56:38,566 INFO L225 Difference]: With dead ends: 349 [2021-10-28 08:56:38,566 INFO L226 Difference]: Without dead ends: 349 [2021-10-28 08:56:38,567 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-10-28 08:56:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-10-28 08:56:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 319. [2021-10-28 08:56:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 290 states have (on average 1.313793103448276) internal successors, (381), 315 states have internal predecessors, (381), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2021-10-28 08:56:38,577 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 46 [2021-10-28 08:56:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:56:38,578 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2021-10-28 08:56:38,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 08:56:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2021-10-28 08:56:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-28 08:56:38,579 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:56:38,580 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-10-28 08:56:38,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-28 08:56:38,580 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr57REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 08:56:38,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash 292246064, now seen corresponding path program 1 times [2021-10-28 08:56:38,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:38,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354658915] [2021-10-28 08:56:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:38,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:56:38,604 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:56:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:56:38,655 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:56:38,655 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 08:56:38,656 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr57REQUIRES_VIOLATION [2021-10-28 08:56:38,659 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-10-28 08:56:38,659 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-10-28 08:56:38,659 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,660 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-10-28 08:56:38,660 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-10-28 08:56:38,660 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-10-28 08:56:38,660 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-10-28 08:56:38,661 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-10-28 08:56:38,661 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-10-28 08:56:38,661 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-10-28 08:56:38,661 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-10-28 08:56:38,661 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-10-28 08:56:38,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-10-28 08:56:38,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-10-28 08:56:38,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-10-28 08:56:38,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-10-28 08:56:38,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-10-28 08:56:38,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-10-28 08:56:38,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-10-28 08:56:38,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-10-28 08:56:38,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-10-28 08:56:38,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-10-28 08:56:38,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-10-28 08:56:38,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-10-28 08:56:38,665 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-10-28 08:56:38,665 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,665 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,665 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-10-28 08:56:38,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-10-28 08:56:38,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-10-28 08:56:38,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-10-28 08:56:38,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-10-28 08:56:38,667 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-10-28 08:56:38,667 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-10-28 08:56:38,667 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-10-28 08:56:38,667 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-10-28 08:56:38,667 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-10-28 08:56:38,668 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-10-28 08:56:38,668 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-10-28 08:56:38,668 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-10-28 08:56:38,668 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-10-28 08:56:38,669 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-10-28 08:56:38,669 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-10-28 08:56:38,669 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,669 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,670 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-10-28 08:56:38,670 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-10-28 08:56:38,670 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,670 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-10-28 08:56:38,670 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-10-28 08:56:38,671 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,671 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-10-28 08:56:38,671 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-10-28 08:56:38,671 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,672 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-10-28 08:56:38,672 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-10-28 08:56:38,672 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-10-28 08:56:38,672 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,673 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-10-28 08:56:38,673 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-10-28 08:56:38,673 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-10-28 08:56:38,673 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63REQUIRES_VIOLATION [2021-10-28 08:56:38,673 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,674 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-10-28 08:56:38,674 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-10-28 08:56:38,674 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,674 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68REQUIRES_VIOLATION [2021-10-28 08:56:38,675 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-10-28 08:56:38,675 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,675 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 08:56:38,675 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 08:56:38,676 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 08:56:38,676 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74REQUIRES_VIOLATION [2021-10-28 08:56:38,676 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75REQUIRES_VIOLATION [2021-10-28 08:56:38,676 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 08:56:38,677 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 08:56:38,677 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 08:56:38,677 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79ENSURES_VIOLATIONMEMORY_LEAK [2021-10-28 08:56:38,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-28 08:56:38,681 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-10-28 08:56:38,686 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 08:56:38,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 08:56:38 BoogieIcfgContainer [2021-10-28 08:56:38,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 08:56:38,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 08:56:38,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 08:56:38,728 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 08:56:38,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:56:10" (3/4) ... [2021-10-28 08:56:38,731 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 08:56:38,781 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 08:56:38,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 08:56:38,783 INFO L168 Benchmark]: Toolchain (without parser) took 29636.08 ms. Allocated memory was 117.4 MB in the beginning and 178.3 MB in the end (delta: 60.8 MB). Free memory was 78.2 MB in the beginning and 108.3 MB in the end (delta: -30.2 MB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:38,783 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 117.4 MB. Free memory was 96.9 MB in the beginning and 96.8 MB in the end (delta: 60.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 08:56:38,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.58 ms. Allocated memory is still 117.4 MB. Free memory was 78.0 MB in the beginning and 84.9 MB in the end (delta: -6.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:38,784 INFO L168 Benchmark]: Boogie Preprocessor took 101.41 ms. Allocated memory is still 117.4 MB. Free memory was 84.9 MB in the beginning and 81.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:38,785 INFO L168 Benchmark]: RCFGBuilder took 1052.87 ms. Allocated memory is still 117.4 MB. Free memory was 81.5 MB in the beginning and 50.6 MB in the end (delta: 30.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:38,785 INFO L168 Benchmark]: TraceAbstraction took 27828.47 ms. Allocated memory was 117.4 MB in the beginning and 178.3 MB in the end (delta: 60.8 MB). Free memory was 50.0 MB in the beginning and 110.4 MB in the end (delta: -60.4 MB). Peak memory consumption was 1.8 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:38,786 INFO L168 Benchmark]: Witness Printer took 53.83 ms. Allocated memory is still 178.3 MB. Free memory was 110.4 MB in the beginning and 108.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:38,788 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.19 ms. Allocated memory is still 117.4 MB. Free memory was 96.9 MB in the beginning and 96.8 MB in the end (delta: 60.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 590.58 ms. Allocated memory is still 117.4 MB. Free memory was 78.0 MB in the beginning and 84.9 MB in the end (delta: -6.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 101.41 ms. Allocated memory is still 117.4 MB. Free memory was 84.9 MB in the beginning and 81.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1052.87 ms. Allocated memory is still 117.4 MB. Free memory was 81.5 MB in the beginning and 50.6 MB in the end (delta: 30.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 27828.47 ms. Allocated memory was 117.4 MB in the beginning and 178.3 MB in the end (delta: 60.8 MB). Free memory was 50.0 MB in the beginning and 110.4 MB in the end (delta: -60.4 MB). Peak memory consumption was 1.8 MB. Max. memory is 16.1 GB. * Witness Printer took 53.83 ms. Allocated memory is still 178.3 MB. Free memory was 110.4 MB in the beginning and 108.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: 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: 27.7s, OverallIterations: 38, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, 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, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 4.8s 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.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 1401 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1220 ConstructedInterpolants, 3 QuantifiedInterpolants, 11356 SizeOfPredicates, 13 NumberOfNonLiveVariables, 583 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 12/19 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-28 08:56:38,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eac9f62-c4a6-4324-960c-97d7b3c5a261/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...