./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 03:51:58,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 03:51:58,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 03:51:58,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 03:51:58,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 03:51:58,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 03:51:58,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 03:51:58,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 03:51:58,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 03:51:58,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 03:51:58,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 03:51:58,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 03:51:58,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 03:51:58,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 03:51:58,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 03:51:58,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 03:51:58,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 03:51:58,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 03:51:59,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 03:51:59,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 03:51:59,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 03:51:59,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 03:51:59,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 03:51:59,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 03:51:59,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 03:51:59,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 03:51:59,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 03:51:59,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 03:51:59,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 03:51:59,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 03:51:59,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 03:51:59,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 03:51:59,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 03:51:59,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 03:51:59,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 03:51:59,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 03:51:59,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 03:51:59,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 03:51:59,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 03:51:59,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 03:51:59,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 03:51:59,037 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-03 03:51:59,077 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 03:51:59,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 03:51:59,079 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 03:51:59,080 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 03:51:59,080 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 03:51:59,080 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 03:51:59,080 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 03:51:59,081 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 03:51:59,081 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 03:51:59,081 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 03:51:59,082 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 03:51:59,083 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 03:51:59,083 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 03:51:59,083 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 03:51:59,084 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 03:51:59,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 03:51:59,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 03:51:59,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 03:51:59,086 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 03:51:59,086 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 03:51:59,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 03:51:59,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 03:51:59,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 03:51:59,087 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-03 03:51:59,088 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-03 03:51:59,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 03:51:59,090 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 03:51:59,090 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 03:51:59,090 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 03:51:59,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 03:51:59,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 03:51:59,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:51:59,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 03:51:59,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 03:51:59,092 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 03:51:59,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 03:51:59,093 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 03:51:59,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 03:51:59,093 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/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_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2021-11-03 03:51:59,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 03:51:59,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 03:51:59,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 03:51:59,384 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 03:51:59,385 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 03:51:59,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-11-03 03:51:59,461 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/data/1cba0e46e/1b5249ac223f4b80a12e9fa801c1960d/FLAGe2f0811da [2021-11-03 03:52:00,077 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 03:52:00,079 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-11-03 03:52:00,104 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/data/1cba0e46e/1b5249ac223f4b80a12e9fa801c1960d/FLAGe2f0811da [2021-11-03 03:52:00,344 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/data/1cba0e46e/1b5249ac223f4b80a12e9fa801c1960d [2021-11-03 03:52:00,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 03:52:00,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 03:52:00,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 03:52:00,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 03:52:00,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 03:52:00,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:52:00" (1/1) ... [2021-11-03 03:52:00,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ecdb99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:00, skipping insertion in model container [2021-11-03 03:52:00,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:52:00" (1/1) ... [2021-11-03 03:52:00,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 03:52:00,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 03:52:00,917 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_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2021-11-03 03:52:00,941 WARN L563 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2021-11-03 03:52:00,942 WARN L563 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2021-11-03 03:52:00,943 WARN L563 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2021-11-03 03:52:00,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:52:01,003 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-11-03 03:52:01,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@142b213e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:01, skipping insertion in model container [2021-11-03 03:52:01,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 03:52:01,004 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-11-03 03:52:01,007 INFO L168 Benchmark]: Toolchain (without parser) took 655.96 ms. Allocated memory is still 96.5 MB. Free memory was 60.6 MB in the beginning and 67.6 MB in the end (delta: -7.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-03 03:52:01,008 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 96.5 MB. Free memory was 73.8 MB in the beginning and 73.7 MB in the end (delta: 24.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:52:01,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 651.49 ms. Allocated memory is still 96.5 MB. Free memory was 60.4 MB in the beginning and 67.6 MB in the end (delta: -7.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-03 03:52:01,013 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.23 ms. Allocated memory is still 96.5 MB. Free memory was 73.8 MB in the beginning and 73.7 MB in the end (delta: 24.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 651.49 ms. Allocated memory is still 96.5 MB. Free memory was 60.4 MB in the beginning and 67.6 MB in the end (delta: -7.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 03:52:03,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 03:52:03,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 03:52:03,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 03:52:03,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 03:52:03,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 03:52:03,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 03:52:03,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 03:52:03,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 03:52:03,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 03:52:03,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 03:52:03,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 03:52:03,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 03:52:03,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 03:52:03,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 03:52:03,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 03:52:03,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 03:52:03,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 03:52:03,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 03:52:03,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 03:52:03,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 03:52:03,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 03:52:03,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 03:52:03,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 03:52:03,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 03:52:03,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 03:52:03,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 03:52:03,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 03:52:03,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 03:52:03,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 03:52:03,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 03:52:03,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 03:52:03,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 03:52:03,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 03:52:03,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 03:52:03,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 03:52:03,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 03:52:03,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 03:52:03,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 03:52:03,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 03:52:03,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 03:52:03,217 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf [2021-11-03 03:52:03,245 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 03:52:03,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 03:52:03,250 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 03:52:03,250 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 03:52:03,250 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 03:52:03,251 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 03:52:03,251 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 03:52:03,251 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 03:52:03,251 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 03:52:03,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 03:52:03,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 03:52:03,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 03:52:03,254 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 03:52:03,254 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 03:52:03,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 03:52:03,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 03:52:03,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 03:52:03,255 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-03 03:52:03,255 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-03 03:52:03,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 03:52:03,255 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 03:52:03,255 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-03 03:52:03,255 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-03 03:52:03,256 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 03:52:03,256 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 03:52:03,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 03:52:03,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 03:52:03,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 03:52:03,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:52:03,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 03:52:03,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 03:52:03,257 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-03 03:52:03,258 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-03 03:52:03,258 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 03:52:03,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 03:52:03,258 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/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_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2021-11-03 03:52:03,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 03:52:03,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 03:52:03,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 03:52:03,665 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 03:52:03,666 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 03:52:03,667 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-11-03 03:52:03,739 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/data/c2670f4dd/2cdd4d2b06db405da40a9aabfaec6130/FLAG0a44b0461 [2021-11-03 03:52:04,338 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 03:52:04,338 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-11-03 03:52:04,360 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/data/c2670f4dd/2cdd4d2b06db405da40a9aabfaec6130/FLAG0a44b0461 [2021-11-03 03:52:04,567 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/data/c2670f4dd/2cdd4d2b06db405da40a9aabfaec6130 [2021-11-03 03:52:04,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 03:52:04,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 03:52:04,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 03:52:04,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 03:52:04,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 03:52:04,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:52:04" (1/1) ... [2021-11-03 03:52:04,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45049cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:04, skipping insertion in model container [2021-11-03 03:52:04,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:52:04" (1/1) ... [2021-11-03 03:52:04,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 03:52:04,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 03:52:05,101 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_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2021-11-03 03:52:05,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:52:05,178 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-03 03:52:05,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 03:52:05,213 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_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2021-11-03 03:52:05,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:52:05,239 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 03:52:05,273 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_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2021-11-03 03:52:05,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:52:05,370 INFO L208 MainTranslator]: Completed translation [2021-11-03 03:52:05,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:05 WrapperNode [2021-11-03 03:52:05,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 03:52:05,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 03:52:05,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 03:52:05,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 03:52:05,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:05" (1/1) ... [2021-11-03 03:52:05,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:05" (1/1) ... [2021-11-03 03:52:05,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 03:52:05,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 03:52:05,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 03:52:05,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 03:52:05,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:05" (1/1) ... [2021-11-03 03:52:05,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:05" (1/1) ... [2021-11-03 03:52:05,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:05" (1/1) ... [2021-11-03 03:52:05,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:05" (1/1) ... [2021-11-03 03:52:05,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:05" (1/1) ... [2021-11-03 03:52:05,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:05" (1/1) ... [2021-11-03 03:52:05,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:05" (1/1) ... [2021-11-03 03:52:05,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 03:52:05,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 03:52:05,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 03:52:05,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 03:52:05,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:05" (1/1) ... [2021-11-03 03:52:05,527 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:52:05,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 03:52:05,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 03:52:05,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 03:52:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-03 03:52:05,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 03:52:05,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 03:52:05,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 03:52:05,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-03 03:52:05,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-03 03:52:05,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-03 03:52:05,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 03:52:05,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 03:52:05,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 03:52:05,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 03:52:06,768 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 03:52:06,769 INFO L299 CfgBuilder]: Removed 178 assume(true) statements. [2021-11-03 03:52:06,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:52:06 BoogieIcfgContainer [2021-11-03 03:52:06,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 03:52:06,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 03:52:06,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 03:52:06,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 03:52:06,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:52:04" (1/3) ... [2021-11-03 03:52:06,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3a06aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:52:06, skipping insertion in model container [2021-11-03 03:52:06,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:05" (2/3) ... [2021-11-03 03:52:06,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3a06aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:52:06, skipping insertion in model container [2021-11-03 03:52:06,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:52:06" (3/3) ... [2021-11-03 03:52:06,779 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2021-11-03 03:52:06,784 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 03:52:06,784 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 146 error locations. [2021-11-03 03:52:06,825 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 03:52:06,831 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 03:52:06,832 INFO L340 AbstractCegarLoop]: Starting to check reachability of 146 error locations. [2021-11-03 03:52:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 353 states, 206 states have (on average 2.2815533980582523) internal successors, (470), 352 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 03:52:06,859 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:52:06,860 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 03:52:06,860 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:52:06,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:52:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash 28694792, now seen corresponding path program 1 times [2021-11-03 03:52:06,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:52:06,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955205166] [2021-11-03 03:52:06,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:52:06,878 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:52:06,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:52:06,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:52:06,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-03 03:52:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:52:06,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-03 03:52:06,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:52:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:07,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:52:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:07,018 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:52:07,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955205166] [2021-11-03 03:52:07,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955205166] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:52:07,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:52:07,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-03 03:52:07,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687653436] [2021-11-03 03:52:07,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 03:52:07,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:52:07,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 03:52:07,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 03:52:07,043 INFO L87 Difference]: Start difference. First operand has 353 states, 206 states have (on average 2.2815533980582523) internal successors, (470), 352 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:52:07,072 INFO L93 Difference]: Finished difference Result 345 states and 351 transitions. [2021-11-03 03:52:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 03:52:07,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-03 03:52:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:52:07,086 INFO L225 Difference]: With dead ends: 345 [2021-11-03 03:52:07,089 INFO L226 Difference]: Without dead ends: 343 [2021-11-03 03:52:07,092 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 03:52:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-11-03 03:52:07,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2021-11-03 03:52:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 201 states have (on average 1.736318407960199) internal successors, (349), 342 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 349 transitions. [2021-11-03 03:52:07,165 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 349 transitions. Word has length 5 [2021-11-03 03:52:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:52:07,166 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 349 transitions. [2021-11-03 03:52:07,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 349 transitions. [2021-11-03 03:52:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 03:52:07,167 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:52:07,168 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 03:52:07,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-03 03:52:07,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:52:07,382 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:52:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:52:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash 28694854, now seen corresponding path program 1 times [2021-11-03 03:52:07,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:52:07,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072947209] [2021-11-03 03:52:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:52:07,385 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:52:07,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:52:07,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:52:07,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-03 03:52:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:52:07,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 03:52:07,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:52:07,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-03 03:52:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:07,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:52:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:07,548 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:52:07,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072947209] [2021-11-03 03:52:07,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072947209] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:52:07,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:52:07,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-03 03:52:07,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158909969] [2021-11-03 03:52:07,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 03:52:07,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:52:07,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 03:52:07,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:52:07,552 INFO L87 Difference]: Start difference. First operand 343 states and 349 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:52:08,005 INFO L93 Difference]: Finished difference Result 362 states and 368 transitions. [2021-11-03 03:52:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 03:52:08,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-03 03:52:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:52:08,009 INFO L225 Difference]: With dead ends: 362 [2021-11-03 03:52:08,009 INFO L226 Difference]: Without dead ends: 362 [2021-11-03 03:52:08,009 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:52:08,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-11-03 03:52:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 340. [2021-11-03 03:52:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 201 states have (on average 1.7213930348258706) internal successors, (346), 339 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 346 transitions. [2021-11-03 03:52:08,034 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 346 transitions. Word has length 5 [2021-11-03 03:52:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:52:08,038 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 346 transitions. [2021-11-03 03:52:08,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 346 transitions. [2021-11-03 03:52:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 03:52:08,038 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:52:08,038 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 03:52:08,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-03 03:52:08,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:52:08,239 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:52:08,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:52:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash 28694855, now seen corresponding path program 1 times [2021-11-03 03:52:08,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:52:08,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291430514] [2021-11-03 03:52:08,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:52:08,247 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:52:08,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:52:08,249 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:52:08,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-03 03:52:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:52:08,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-03 03:52:08,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:52:08,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-03 03:52:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:08,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:52:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:08,467 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:52:08,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291430514] [2021-11-03 03:52:08,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291430514] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:52:08,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:52:08,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-03 03:52:08,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34461915] [2021-11-03 03:52:08,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:52:08,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:52:08,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:52:08,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:52:08,470 INFO L87 Difference]: Start difference. First operand 340 states and 346 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:52:08,938 INFO L93 Difference]: Finished difference Result 338 states and 344 transitions. [2021-11-03 03:52:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 03:52:08,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-03 03:52:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:52:08,941 INFO L225 Difference]: With dead ends: 338 [2021-11-03 03:52:08,941 INFO L226 Difference]: Without dead ends: 338 [2021-11-03 03:52:08,942 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:52:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-11-03 03:52:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2021-11-03 03:52:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 201 states have (on average 1.7064676616915422) internal successors, (343), 336 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 343 transitions. [2021-11-03 03:52:08,959 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 343 transitions. Word has length 5 [2021-11-03 03:52:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:52:08,959 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 343 transitions. [2021-11-03 03:52:08,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 343 transitions. [2021-11-03 03:52:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 03:52:08,960 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:52:08,960 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:52:08,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-03 03:52:09,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:52:09,171 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:52:09,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:52:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1805950471, now seen corresponding path program 1 times [2021-11-03 03:52:09,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:52:09,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361601566] [2021-11-03 03:52:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:52:09,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:52:09,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:52:09,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:52:09,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-03 03:52:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:52:09,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-03 03:52:09,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:52:09,336 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-03 03:52:09,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 37 [2021-11-03 03:52:09,552 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-03 03:52:09,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-11-03 03:52:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:09,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:52:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:11,838 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:52:11,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361601566] [2021-11-03 03:52:11,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361601566] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:52:11,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:52:11,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-03 03:52:11,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72850951] [2021-11-03 03:52:11,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 03:52:11,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:52:11,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 03:52:11,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2021-11-03 03:52:11,840 INFO L87 Difference]: Start difference. First operand 337 states and 343 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:52:12,563 INFO L93 Difference]: Finished difference Result 357 states and 363 transitions. [2021-11-03 03:52:12,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:52:12,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-03 03:52:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:52:12,566 INFO L225 Difference]: With dead ends: 357 [2021-11-03 03:52:12,566 INFO L226 Difference]: Without dead ends: 357 [2021-11-03 03:52:12,567 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=22, Invalid=33, Unknown=1, NotChecked=0, Total=56 [2021-11-03 03:52:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-11-03 03:52:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 335. [2021-11-03 03:52:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 202 states have (on average 1.693069306930693) internal successors, (342), 334 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 342 transitions. [2021-11-03 03:52:12,577 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 342 transitions. Word has length 7 [2021-11-03 03:52:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:52:12,577 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 342 transitions. [2021-11-03 03:52:12,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 342 transitions. [2021-11-03 03:52:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 03:52:12,578 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:52:12,578 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:52:12,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-03 03:52:12,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:52:12,789 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:52:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:52:12,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1805950472, now seen corresponding path program 1 times [2021-11-03 03:52:12,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:52:12,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048293486] [2021-11-03 03:52:12,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:52:12,791 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:52:12,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:52:12,795 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:52:12,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-03 03:52:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:52:12,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-03 03:52:12,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:52:12,993 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-03 03:52:12,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2021-11-03 03:52:13,068 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-03 03:52:13,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 63 [2021-11-03 03:52:13,329 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-03 03:52:13,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 53 [2021-11-03 03:52:13,376 INFO L354 Elim1Store]: treesize reduction 2, result has 92.0 percent of original size [2021-11-03 03:52:13,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 66 [2021-11-03 03:52:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:14,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:52:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:16,576 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:52:16,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048293486] [2021-11-03 03:52:16,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048293486] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:52:16,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:52:16,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2021-11-03 03:52:16,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182876236] [2021-11-03 03:52:16,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 03:52:16,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:52:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 03:52:16,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-11-03 03:52:16,578 INFO L87 Difference]: Start difference. First operand 335 states and 342 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:52:18,405 INFO L93 Difference]: Finished difference Result 539 states and 549 transitions. [2021-11-03 03:52:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 03:52:18,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-03 03:52:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:52:18,409 INFO L225 Difference]: With dead ends: 539 [2021-11-03 03:52:18,409 INFO L226 Difference]: Without dead ends: 539 [2021-11-03 03:52:18,410 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=59, Invalid=96, Unknown=1, NotChecked=0, Total=156 [2021-11-03 03:52:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-11-03 03:52:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 331. [2021-11-03 03:52:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 202 states have (on average 1.6683168316831682) internal successors, (337), 330 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 337 transitions. [2021-11-03 03:52:18,424 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 337 transitions. Word has length 7 [2021-11-03 03:52:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:52:18,424 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 337 transitions. [2021-11-03 03:52:18,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 337 transitions. [2021-11-03 03:52:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-03 03:52:18,425 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:52:18,425 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:52:18,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-03 03:52:18,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:52:18,637 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:52:18,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:52:18,637 INFO L85 PathProgramCache]: Analyzing trace with hash 351614728, now seen corresponding path program 1 times [2021-11-03 03:52:18,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:52:18,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43168758] [2021-11-03 03:52:18,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:52:18,638 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:52:18,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:52:18,639 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:52:18,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-03 03:52:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:52:18,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-03 03:52:18,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:52:18,861 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-03 03:52:18,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 37 [2021-11-03 03:52:19,091 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-03 03:52:19,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 16 [2021-11-03 03:52:19,193 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-11-03 03:52:19,194 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 4 case distinctions, treesize of input 60 treesize of output 15 [2021-11-03 03:52:19,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-11-03 03:52:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:19,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:52:19,323 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-11-03 03:52:19,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 21 [2021-11-03 03:52:19,349 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:52:19,350 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-11-03 03:52:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:27,109 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:52:27,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43168758] [2021-11-03 03:52:27,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43168758] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:52:27,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:52:27,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-03 03:52:27,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019258491] [2021-11-03 03:52:27,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 03:52:27,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:52:27,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 03:52:27,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=65, Unknown=3, NotChecked=0, Total=90 [2021-11-03 03:52:27,111 INFO L87 Difference]: Start difference. First operand 331 states and 337 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:52:31,377 INFO L93 Difference]: Finished difference Result 365 states and 371 transitions. [2021-11-03 03:52:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 03:52:31,377 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-03 03:52:31,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:52:31,380 INFO L225 Difference]: With dead ends: 365 [2021-11-03 03:52:31,380 INFO L226 Difference]: Without dead ends: 365 [2021-11-03 03:52:31,380 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=67, Invalid=139, Unknown=4, NotChecked=0, Total=210 [2021-11-03 03:52:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-11-03 03:52:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 338. [2021-11-03 03:52:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 209 states have (on average 1.6507177033492824) internal successors, (345), 337 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 345 transitions. [2021-11-03 03:52:31,388 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 345 transitions. Word has length 9 [2021-11-03 03:52:31,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:52:31,388 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 345 transitions. [2021-11-03 03:52:31,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 345 transitions. [2021-11-03 03:52:31,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-03 03:52:31,389 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:52:31,390 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:52:31,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-03 03:52:31,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:52:31,601 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:52:31,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:52:31,601 INFO L85 PathProgramCache]: Analyzing trace with hash 351614729, now seen corresponding path program 1 times [2021-11-03 03:52:31,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:52:31,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064584566] [2021-11-03 03:52:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:52:31,602 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:52:31,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:52:31,603 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:52:31,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-03 03:52:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:52:31,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-03 03:52:31,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:52:31,781 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-03 03:52:31,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2021-11-03 03:52:31,856 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-03 03:52:31,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 63 [2021-11-03 03:52:32,160 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-03 03:52:32,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 52 [2021-11-03 03:52:32,216 INFO L354 Elim1Store]: treesize reduction 2, result has 92.0 percent of original size [2021-11-03 03:52:32,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 65 [2021-11-03 03:52:32,681 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-11-03 03:52:32,681 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 4 case distinctions, treesize of input 116 treesize of output 71 [2021-11-03 03:52:32,748 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-11-03 03:52:32,748 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 4 case distinctions, treesize of input 68 treesize of output 23 [2021-11-03 03:52:32,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-11-03 03:52:32,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-11-03 03:52:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:32,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:52:33,354 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:52:33,355 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 186 [2021-11-03 03:52:33,360 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:52:33,362 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 288 [2021-11-03 03:52:46,988 WARN L207 SmtUtils]: Spent 5.41 s on a formula simplification that was a NOOP. DAG size: 47 [2021-11-03 03:52:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:52:59,991 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:52:59,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064584566] [2021-11-03 03:52:59,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064584566] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:52:59,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:52:59,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-11-03 03:52:59,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297039642] [2021-11-03 03:52:59,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-03 03:52:59,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:52:59,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-03 03:52:59,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=143, Unknown=4, NotChecked=0, Total=182 [2021-11-03 03:52:59,993 INFO L87 Difference]: Start difference. First operand 338 states and 345 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:02,866 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_list_add_~head.base) c_ULTIMATE.start_list_add_~head.offset))) (let ((.cse4 (bvadd (_ bv8 32) .cse3))) (and (= (select |c_#length| c_ULTIMATE.start___list_add_~next.base) (_ bv8 32)) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv1 32))) (.cse1 (bvadd (_ bv2 32) ULTIMATE.start_gl_insert_~node~1.offset)) (.cse2 (bvadd (_ bv3 32) ULTIMATE.start_gl_insert_~node~1.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_gl_insert_~node~1.base (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_gl_insert_~node~1.base) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_9) .cse0 v_DerPreprocessor_10) .cse1 v_DerPreprocessor_11) .cse2 v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6) .cse1 v_DerPreprocessor_7) .cse2 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) (= (_ bv8 32) (select |c_#length| |c_ULTIMATE.start_list_add_#t~mem48.base|)) (bvule (bvadd (_ bv4 32) .cse3) .cse4) (bvule .cse4 (select |c_#length| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_list_add_~head.base) c_ULTIMATE.start_list_add_~head.offset))) (= |c_ULTIMATE.start_list_add_#t~mem48.offset| (_ bv0 32)) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_gl_insert_~node~1.base (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_gl_insert_~node~1.base) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_9) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_10) (bvadd (_ bv2 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_11) (bvadd (_ bv3 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse5) (bvadd (_ bv8 32) .cse5)))) (exists ((ULTIMATE.start_gl_insert_~node~1.base (_ BitVec 32))) (= (select |c_#length| ULTIMATE.start_gl_insert_~node~1.base) (_ bv20 32))) (= c_ULTIMATE.start___list_add_~next.offset (_ bv0 32)) (forall ((v_ULTIMATE.start_gl_insert_~node~1.base_20 (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse6 (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv1 32))) (.cse7 (bvadd (_ bv2 32) ULTIMATE.start_gl_insert_~node~1.offset)) (.cse8 (bvadd (_ bv3 32) ULTIMATE.start_gl_insert_~node~1.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| v_ULTIMATE.start_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_ULTIMATE.start_gl_insert_~node~1.base_20) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_9) .cse6 v_DerPreprocessor_10) .cse7 v_DerPreprocessor_11) .cse8 v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select (store |c_#length| v_ULTIMATE.start_gl_insert_~node~1.base_20 (_ bv20 32)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_gl_insert_~node~1.base_20) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_5) .cse6 v_DerPreprocessor_6) .cse7 v_DerPreprocessor_7) .cse8 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| v_ULTIMATE.start_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_ULTIMATE.start_gl_insert_~node~1.base_20) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_9) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_10) (bvadd (_ bv2 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_11) (bvadd (_ bv3 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse9) (bvadd (_ bv8 32) .cse9))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_20))))))))) is different from false [2021-11-03 03:53:35,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:53:35,855 INFO L93 Difference]: Finished difference Result 646 states and 658 transitions. [2021-11-03 03:53:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 03:53:35,856 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-03 03:53:35,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:53:35,859 INFO L225 Difference]: With dead ends: 646 [2021-11-03 03:53:35,859 INFO L226 Difference]: Without dead ends: 646 [2021-11-03 03:53:35,860 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=87, Invalid=218, Unknown=5, NotChecked=32, Total=342 [2021-11-03 03:53:35,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2021-11-03 03:53:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 338. [2021-11-03 03:53:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 209 states have (on average 1.645933014354067) internal successors, (344), 337 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 344 transitions. [2021-11-03 03:53:35,869 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 344 transitions. Word has length 9 [2021-11-03 03:53:35,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:53:35,869 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 344 transitions. [2021-11-03 03:53:35,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 344 transitions. [2021-11-03 03:53:35,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 03:53:35,870 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:53:35,870 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:53:35,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-03 03:53:36,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:53:36,081 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:53:36,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:53:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1984845326, now seen corresponding path program 1 times [2021-11-03 03:53:36,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:53:36,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410095999] [2021-11-03 03:53:36,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:53:36,082 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:53:36,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:53:36,083 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:53:36,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-03 03:53:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:53:36,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-03 03:53:36,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:53:36,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-03 03:53:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:36,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:53:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:36,302 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:53:36,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410095999] [2021-11-03 03:53:36,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410095999] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:53:36,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:53:36,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-03 03:53:36,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384774938] [2021-11-03 03:53:36,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:53:36,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:53:36,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:53:36,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:53:36,303 INFO L87 Difference]: Start difference. First operand 338 states and 344 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:53:36,997 INFO L93 Difference]: Finished difference Result 521 states and 531 transitions. [2021-11-03 03:53:36,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 03:53:36,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-03 03:53:36,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:53:37,001 INFO L225 Difference]: With dead ends: 521 [2021-11-03 03:53:37,001 INFO L226 Difference]: Without dead ends: 521 [2021-11-03 03:53:37,002 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 03:53:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-11-03 03:53:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 335. [2021-11-03 03:53:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 209 states have (on average 1.631578947368421) internal successors, (341), 334 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 341 transitions. [2021-11-03 03:53:37,011 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 341 transitions. Word has length 10 [2021-11-03 03:53:37,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:53:37,011 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 341 transitions. [2021-11-03 03:53:37,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 341 transitions. [2021-11-03 03:53:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 03:53:37,012 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:53:37,012 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:53:37,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-03 03:53:37,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:53:37,230 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:53:37,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:53:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1984845325, now seen corresponding path program 1 times [2021-11-03 03:53:37,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:53:37,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318674869] [2021-11-03 03:53:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:53:37,231 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:53:37,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:53:37,231 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:53:37,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-03 03:53:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:53:37,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-03 03:53:37,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:53:37,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-03 03:53:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:37,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:53:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:37,754 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:53:37,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318674869] [2021-11-03 03:53:37,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318674869] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:53:37,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:53:37,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-03 03:53:37,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877690275] [2021-11-03 03:53:37,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 03:53:37,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:53:37,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 03:53:37,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-03 03:53:37,756 INFO L87 Difference]: Start difference. First operand 335 states and 341 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:53:39,003 INFO L93 Difference]: Finished difference Result 509 states and 519 transitions. [2021-11-03 03:53:39,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 03:53:39,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-03 03:53:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:53:39,007 INFO L225 Difference]: With dead ends: 509 [2021-11-03 03:53:39,007 INFO L226 Difference]: Without dead ends: 509 [2021-11-03 03:53:39,007 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-03 03:53:39,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-11-03 03:53:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 333. [2021-11-03 03:53:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 209 states have (on average 1.6220095693779903) internal successors, (339), 332 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 339 transitions. [2021-11-03 03:53:39,016 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 339 transitions. Word has length 10 [2021-11-03 03:53:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:53:39,016 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 339 transitions. [2021-11-03 03:53:39,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 339 transitions. [2021-11-03 03:53:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 03:53:39,017 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:53:39,017 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:53:39,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-03 03:53:39,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:53:39,229 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:53:39,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:53:39,230 INFO L85 PathProgramCache]: Analyzing trace with hash -470878954, now seen corresponding path program 1 times [2021-11-03 03:53:39,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:53:39,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6020041] [2021-11-03 03:53:39,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:53:39,231 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:53:39,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:53:39,232 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:53:39,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-03 03:53:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:53:39,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-03 03:53:39,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:53:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:39,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:53:39,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-11-03 03:53:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:39,796 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:53:39,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6020041] [2021-11-03 03:53:39,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6020041] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:53:39,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:53:39,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2021-11-03 03:53:39,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242074757] [2021-11-03 03:53:39,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 03:53:39,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:53:39,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 03:53:39,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-03 03:53:39,798 INFO L87 Difference]: Start difference. First operand 333 states and 339 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:53:40,938 INFO L93 Difference]: Finished difference Result 507 states and 517 transitions. [2021-11-03 03:53:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 03:53:40,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-03 03:53:40,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:53:40,942 INFO L225 Difference]: With dead ends: 507 [2021-11-03 03:53:40,942 INFO L226 Difference]: Without dead ends: 507 [2021-11-03 03:53:40,942 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-11-03 03:53:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-11-03 03:53:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 331. [2021-11-03 03:53:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 209 states have (on average 1.61244019138756) internal successors, (337), 330 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 337 transitions. [2021-11-03 03:53:40,950 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 337 transitions. Word has length 12 [2021-11-03 03:53:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:53:40,950 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 337 transitions. [2021-11-03 03:53:40,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 337 transitions. [2021-11-03 03:53:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 03:53:40,951 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:53:40,951 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:53:40,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-03 03:53:41,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:53:41,156 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:53:41,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:53:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash -470878955, now seen corresponding path program 1 times [2021-11-03 03:53:41,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:53:41,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184769874] [2021-11-03 03:53:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:53:41,157 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:53:41,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:53:41,158 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:53:41,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-03 03:53:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:53:41,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-03 03:53:41,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:53:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:41,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:53:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:41,383 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:53:41,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184769874] [2021-11-03 03:53:41,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184769874] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:53:41,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:53:41,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-03 03:53:41,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279016642] [2021-11-03 03:53:41,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:53:41,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:53:41,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:53:41,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:53:41,385 INFO L87 Difference]: Start difference. First operand 331 states and 337 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:53:41,732 INFO L93 Difference]: Finished difference Result 345 states and 351 transitions. [2021-11-03 03:53:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:53:41,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-03 03:53:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:53:41,734 INFO L225 Difference]: With dead ends: 345 [2021-11-03 03:53:41,734 INFO L226 Difference]: Without dead ends: 345 [2021-11-03 03:53:41,734 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:53:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-11-03 03:53:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 329. [2021-11-03 03:53:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 209 states have (on average 1.6028708133971292) internal successors, (335), 328 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 335 transitions. [2021-11-03 03:53:41,740 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 335 transitions. Word has length 12 [2021-11-03 03:53:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:53:41,741 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 335 transitions. [2021-11-03 03:53:41,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 335 transitions. [2021-11-03 03:53:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-03 03:53:41,742 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:53:41,742 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:53:41,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-03 03:53:41,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:53:41,953 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:53:41,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:53:41,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1914034178, now seen corresponding path program 1 times [2021-11-03 03:53:41,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:53:41,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942064934] [2021-11-03 03:53:41,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:53:41,954 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:53:41,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:53:41,955 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:53:41,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-03 03:53:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:53:42,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-03 03:53:42,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:53:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:42,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:53:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:42,340 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:53:42,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942064934] [2021-11-03 03:53:42,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942064934] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:53:42,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:53:42,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-03 03:53:42,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71374819] [2021-11-03 03:53:42,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:53:42,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:53:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:53:42,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:53:42,342 INFO L87 Difference]: Start difference. First operand 329 states and 335 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:53:42,651 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2021-11-03 03:53:42,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:53:42,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-03 03:53:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:53:42,654 INFO L225 Difference]: With dead ends: 325 [2021-11-03 03:53:42,654 INFO L226 Difference]: Without dead ends: 325 [2021-11-03 03:53:42,654 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:53:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-11-03 03:53:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-11-03 03:53:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 207 states have (on average 1.5990338164251208) internal successors, (331), 324 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 331 transitions. [2021-11-03 03:53:42,660 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 331 transitions. Word has length 21 [2021-11-03 03:53:42,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:53:42,661 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 331 transitions. [2021-11-03 03:53:42,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:42,661 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 331 transitions. [2021-11-03 03:53:42,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-03 03:53:42,662 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:53:42,662 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:53:42,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-03 03:53:42,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:53:42,863 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:53:42,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:53:42,863 INFO L85 PathProgramCache]: Analyzing trace with hash 794488727, now seen corresponding path program 1 times [2021-11-03 03:53:42,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:53:42,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105817498] [2021-11-03 03:53:42,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:53:42,864 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:53:42,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:53:42,865 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:53:42,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-03 03:53:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:53:43,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-03 03:53:43,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:53:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:43,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:53:43,234 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-03 03:53:43,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 17 [2021-11-03 03:53:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:43,247 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:53:43,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105817498] [2021-11-03 03:53:43,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105817498] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:53:43,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:53:43,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-03 03:53:43,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485654371] [2021-11-03 03:53:43,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:53:43,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:53:43,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:53:43,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:53:43,249 INFO L87 Difference]: Start difference. First operand 325 states and 331 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:53:44,153 INFO L93 Difference]: Finished difference Result 480 states and 490 transitions. [2021-11-03 03:53:44,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 03:53:44,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-03 03:53:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:53:44,156 INFO L225 Difference]: With dead ends: 480 [2021-11-03 03:53:44,156 INFO L226 Difference]: Without dead ends: 480 [2021-11-03 03:53:44,157 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 03:53:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-11-03 03:53:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 315. [2021-11-03 03:53:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 207 states have (on average 1.5507246376811594) internal successors, (321), 314 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 321 transitions. [2021-11-03 03:53:44,164 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 321 transitions. Word has length 22 [2021-11-03 03:53:44,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:53:44,164 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 321 transitions. [2021-11-03 03:53:44,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:44,165 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 321 transitions. [2021-11-03 03:53:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-03 03:53:44,165 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:53:44,166 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:53:44,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-03 03:53:44,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:53:44,377 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:53:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:53:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash 794488728, now seen corresponding path program 1 times [2021-11-03 03:53:44,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:53:44,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501217032] [2021-11-03 03:53:44,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:53:44,378 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:53:44,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:53:44,379 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:53:44,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-03 03:53:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:53:44,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-03 03:53:44,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:53:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:44,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:53:45,129 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:53:45,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 26 [2021-11-03 03:53:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:45,300 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:53:45,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501217032] [2021-11-03 03:53:45,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501217032] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:53:45,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:53:45,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2021-11-03 03:53:45,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038297045] [2021-11-03 03:53:45,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 03:53:45,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:53:45,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 03:53:45,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-03 03:53:45,301 INFO L87 Difference]: Start difference. First operand 315 states and 321 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:53:46,754 INFO L93 Difference]: Finished difference Result 474 states and 484 transitions. [2021-11-03 03:53:46,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 03:53:46,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-03 03:53:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:53:46,756 INFO L225 Difference]: With dead ends: 474 [2021-11-03 03:53:46,756 INFO L226 Difference]: Without dead ends: 474 [2021-11-03 03:53:46,757 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2021-11-03 03:53:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-11-03 03:53:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 311. [2021-11-03 03:53:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 207 states have (on average 1.5314009661835748) internal successors, (317), 310 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 317 transitions. [2021-11-03 03:53:46,767 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 317 transitions. Word has length 22 [2021-11-03 03:53:46,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:53:46,768 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 317 transitions. [2021-11-03 03:53:46,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 317 transitions. [2021-11-03 03:53:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-03 03:53:46,769 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:53:46,769 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:53:46,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-11-03 03:53:46,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:53:46,979 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:53:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:53:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1000510088, now seen corresponding path program 1 times [2021-11-03 03:53:46,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:53:46,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119269621] [2021-11-03 03:53:46,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:53:46,981 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:53:46,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:53:46,981 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:53:46,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-03 03:53:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:53:47,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-03 03:53:47,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:53:47,296 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-03 03:53:47,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 37 [2021-11-03 03:53:47,480 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-03 03:53:47,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 17 [2021-11-03 03:53:47,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-03 03:53:47,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 03:53:47,805 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-03 03:53:47,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 27 [2021-11-03 03:53:47,950 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-03 03:53:47,951 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 14 [2021-11-03 03:53:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:47,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:53:52,116 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32))) (not (= |c_~#gl_list~0.base| (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv12 32)) c_ULTIMATE.start_gl_insert_~node~1.base)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) is different from false [2021-11-03 03:53:52,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 170 [2021-11-03 03:53:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:53:52,396 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:53:52,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119269621] [2021-11-03 03:53:52,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119269621] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:53:52,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:53:52,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2021-11-03 03:53:52,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398957488] [2021-11-03 03:53:52,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-03 03:53:52,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:53:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-03 03:53:52,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=194, Unknown=2, NotChecked=28, Total=272 [2021-11-03 03:53:52,398 INFO L87 Difference]: Start difference. First operand 311 states and 317 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:54:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:54:07,242 INFO L93 Difference]: Finished difference Result 483 states and 493 transitions. [2021-11-03 03:54:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 03:54:07,242 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-03 03:54:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:54:07,245 INFO L225 Difference]: With dead ends: 483 [2021-11-03 03:54:07,245 INFO L226 Difference]: Without dead ends: 483 [2021-11-03 03:54:07,246 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=207, Invalid=551, Unknown=2, NotChecked=52, Total=812 [2021-11-03 03:54:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-11-03 03:54:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 331. [2021-11-03 03:54:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 228 states have (on average 1.5175438596491229) internal successors, (346), 330 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:54:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 346 transitions. [2021-11-03 03:54:07,253 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 346 transitions. Word has length 24 [2021-11-03 03:54:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:54:07,254 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 346 transitions. [2021-11-03 03:54:07,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:54:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 346 transitions. [2021-11-03 03:54:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 03:54:07,255 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:54:07,255 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:54:07,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-11-03 03:54:07,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:54:07,468 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:54:07,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:54:07,468 INFO L85 PathProgramCache]: Analyzing trace with hash -951035532, now seen corresponding path program 1 times [2021-11-03 03:54:07,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:54:07,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123877278] [2021-11-03 03:54:07,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:54:07,469 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:54:07,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:54:07,470 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:54:07,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-03 03:54:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:54:07,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-03 03:54:07,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:54:07,879 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-03 03:54:07,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2021-11-03 03:54:07,961 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-03 03:54:07,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 63 [2021-11-03 03:54:08,216 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-03 03:54:08,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 52 [2021-11-03 03:54:08,251 INFO L354 Elim1Store]: treesize reduction 2, result has 92.0 percent of original size [2021-11-03 03:54:08,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 65 [2021-11-03 03:54:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:54:08,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:54:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:54:13,459 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:54:13,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123877278] [2021-11-03 03:54:13,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123877278] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:54:13,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:54:13,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2021-11-03 03:54:13,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011634201] [2021-11-03 03:54:13,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 03:54:13,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:54:13,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 03:54:13,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=36, Unknown=2, NotChecked=0, Total=56 [2021-11-03 03:54:13,461 INFO L87 Difference]: Start difference. First operand 331 states and 346 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:54:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:54:14,926 INFO L93 Difference]: Finished difference Result 343 states and 358 transitions. [2021-11-03 03:54:14,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 03:54:14,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-03 03:54:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:54:14,928 INFO L225 Difference]: With dead ends: 343 [2021-11-03 03:54:14,928 INFO L226 Difference]: Without dead ends: 343 [2021-11-03 03:54:14,929 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=42, Invalid=66, Unknown=2, NotChecked=0, Total=110 [2021-11-03 03:54:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-11-03 03:54:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 327. [2021-11-03 03:54:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 228 states have (on average 1.5) internal successors, (342), 326 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:54:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 342 transitions. [2021-11-03 03:54:14,935 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 342 transitions. Word has length 25 [2021-11-03 03:54:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:54:14,935 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 342 transitions. [2021-11-03 03:54:14,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:54:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 342 transitions. [2021-11-03 03:54:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 03:54:14,937 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:54:14,937 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:54:14,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-03 03:54:15,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:54:15,150 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-03 03:54:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:54:15,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1591099974, now seen corresponding path program 1 times [2021-11-03 03:54:15,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:54:15,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153099715] [2021-11-03 03:54:15,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:54:15,151 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:54:15,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:54:15,153 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:54:15,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-03 03:54:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:54:15,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-03 03:54:15,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:54:15,711 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-03 03:54:15,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 37 [2021-11-03 03:54:15,896 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-03 03:54:15,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-11-03 03:54:16,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-03 03:54:16,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 03:54:16,601 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-03 03:54:16,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 38 [2021-11-03 03:54:16,851 INFO L354 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2021-11-03 03:54:16,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 71 [2021-11-03 03:54:17,193 INFO L354 Elim1Store]: treesize reduction 566, result has 2.9 percent of original size [2021-11-03 03:54:17,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 59 [2021-11-03 03:54:17,517 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-03 03:54:17,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 70 [2021-11-03 03:54:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:54:17,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:54:17,956 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:54:17,957 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-11-03 03:54:27,737 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.base_28 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_28 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_gl_insert_~node~1.base_28 (store (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_gl_insert_~node~1.base_28) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_13) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_15) (bvadd (_ bv3 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_16)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_28))))))) is different from false [2021-11-03 03:54:29,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.offset_27 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.base_28 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_28))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_28 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base) (bvadd c_ULTIMATE.start_gl_insert_~node~1.offset (_ bv12 32)) c_ULTIMATE.start_gl_insert_~node~1.base)))) (store .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_28 (store (store (store (store (select .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_28) v_ULTIMATE.start_gl_insert_~node~1.offset_27 v_DerPreprocessor_13) (bvadd v_ULTIMATE.start_gl_insert_~node~1.offset_27 (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) v_ULTIMATE.start_gl_insert_~node~1.offset_27) v_DerPreprocessor_15) (bvadd (_ bv3 32) v_ULTIMATE.start_gl_insert_~node~1.offset_27) v_DerPreprocessor_16))) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))))))))) (_ bv1 1))))) is different from false [2021-11-03 03:54:31,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.offset_27 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.base_28 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_28 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv12 32)) c_ULTIMATE.start_gl_insert_~node~1.base)))) (store .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_28 (store (store (store (store (select .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_28) v_ULTIMATE.start_gl_insert_~node~1.offset_27 v_DerPreprocessor_13) (bvadd v_ULTIMATE.start_gl_insert_~node~1.offset_27 (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) v_ULTIMATE.start_gl_insert_~node~1.offset_27) v_DerPreprocessor_15) (bvadd (_ bv3 32) v_ULTIMATE.start_gl_insert_~node~1.offset_27) v_DerPreprocessor_16))) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_28))))))) is different from false [2021-11-03 03:54:32,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11014098 treesize of output 10997714 [2021-11-03 03:55:00,015 WARN L207 SmtUtils]: Spent 27.96 s on a formula simplification that was a NOOP. DAG size: 2990 [2021-11-03 03:55:00,167 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:55:00,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153099715] [2021-11-03 03:55:00,168 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-03 03:55:00,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1579636916] [2021-11-03 03:55:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:00,169 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-03 03:55:00,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/cvc4 [2021-11-03 03:55:00,171 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-03 03:55:00,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2021-11-03 03:55:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:00,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-03 03:55:00,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:55:00,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-03 03:55:01,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-03 03:55:01,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-03 03:55:01,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 03:55:01,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 03:55:02,007 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-03 03:55:02,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 36 [2021-11-03 03:55:02,254 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-03 03:55:02,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 38 [2021-11-03 03:55:02,630 INFO L354 Elim1Store]: treesize reduction 566, result has 2.9 percent of original size [2021-11-03 03:55:02,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 57 [2021-11-03 03:55:03,028 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-03 03:55:03,029 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 45 [2021-11-03 03:55:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:55:03,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:55:03,407 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:55:03,408 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2021-11-03 03:55:11,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1507797 treesize of output 1505749 [2021-11-03 03:55:15,233 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-03 03:55:15,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355131785] [2021-11-03 03:55:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:15,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 03:55:15,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 03:55:15,237 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 03:55:15,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-03 03:55:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:15,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-03 03:55:15,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:55:15,768 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-03 03:55:15,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 37 [2021-11-03 03:55:15,928 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-03 03:55:15,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2021-11-03 03:55:16,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-03 03:55:16,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 03:55:16,448 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-03 03:55:16,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 38 [2021-11-03 03:55:16,670 INFO L354 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2021-11-03 03:55:16,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 63 [2021-11-03 03:55:17,062 INFO L354 Elim1Store]: treesize reduction 566, result has 2.9 percent of original size [2021-11-03 03:55:17,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 59 [2021-11-03 03:55:17,296 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-03 03:55:17,296 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 70 [2021-11-03 03:55:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:55:17,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:55:17,530 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:55:17,536 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-11-03 03:55:26,817 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_gl_insert_~node~1.base_30 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_30 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_gl_insert_~node~1.base_30 (store (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_gl_insert_~node~1.base_30) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_13) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_15) (bvadd (_ bv3 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_16)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))))))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_30)))))) is different from false [2021-11-03 03:55:28,984 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_gl_insert_~node~1.base_30 (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.offset_33 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_30 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base) (bvadd c_ULTIMATE.start_gl_insert_~node~1.offset (_ bv12 32)) c_ULTIMATE.start_gl_insert_~node~1.base)))) (store .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_30 (store (store (store (store (select .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_30) v_ULTIMATE.start_gl_insert_~node~1.offset_33 v_DerPreprocessor_13) (bvadd v_ULTIMATE.start_gl_insert_~node~1.offset_33 (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) v_ULTIMATE.start_gl_insert_~node~1.offset_33) v_DerPreprocessor_15) (bvadd (_ bv3 32) v_ULTIMATE.start_gl_insert_~node~1.offset_33) v_DerPreprocessor_16))) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_30)))))) is different from false [2021-11-03 03:55:31,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_gl_insert_~node~1.base_30 (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.offset_33 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_30 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv12 32)) c_ULTIMATE.start_gl_insert_~node~1.base)))) (store .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_30 (store (store (store (store (select .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_30) v_ULTIMATE.start_gl_insert_~node~1.offset_33 v_DerPreprocessor_13) (bvadd v_ULTIMATE.start_gl_insert_~node~1.offset_33 (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) v_ULTIMATE.start_gl_insert_~node~1.offset_33) v_DerPreprocessor_15) (bvadd (_ bv3 32) v_ULTIMATE.start_gl_insert_~node~1.offset_33) v_DerPreprocessor_16))) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_30)))))) is different from false [2021-11-03 03:55:31,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22573041 treesize of output 22540273 [2021-11-03 03:56:27,325 WARN L207 SmtUtils]: Spent 56.20 s on a formula simplification that was a NOOP. DAG size: 2440 [2021-11-03 03:56:27,524 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-03 03:56:27,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:56:27,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-03 03:56:27,525 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-11-03 03:56:27,525 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-11-03 03:56:27,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-03 03:56:27,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-03 03:56:27,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-03 03:56:27,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-03 03:56:27,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-03 03:56:27,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-03 03:56:27,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-03 03:56:27,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-03 03:56:27,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-03 03:56:27,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-03 03:56:27,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-03 03:56:27,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-03 03:56:27,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-03 03:56:27,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-03 03:56:27,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-03 03:56:27,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-03 03:56:27,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-03 03:56:27,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-03 03:56:27,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-03 03:56:27,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-03 03:56:27,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-03 03:56:27,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-03 03:56:27,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-03 03:56:27,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-03 03:56:27,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-03 03:56:27,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-03 03:56:27,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-03 03:56:27,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-03 03:56:27,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-03 03:56:27,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-03 03:56:27,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-03 03:56:27,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-03 03:56:27,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-03 03:56:27,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-03 03:56:27,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-11-03 03:56:27,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-11-03 03:56:27,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-11-03 03:56:27,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-11-03 03:56:27,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-11-03 03:56:27,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-11-03 03:56:27,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-11-03 03:56:27,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-11-03 03:56:27,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-11-03 03:56:27,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-11-03 03:56:27,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-11-03 03:56:27,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-11-03 03:56:27,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-11-03 03:56:27,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-11-03 03:56:27,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-11-03 03:56:27,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-11-03 03:56:27,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-11-03 03:56:27,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-11-03 03:56:27,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-11-03 03:56:27,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-11-03 03:56:27,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-11-03 03:56:27,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-11-03 03:56:27,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-11-03 03:56:27,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-11-03 03:56:27,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-11-03 03:56:27,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-11-03 03:56:27,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-11-03 03:56:27,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-11-03 03:56:27,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-11-03 03:56:27,552 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION [2021-11-03 03:56:27,552 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATION [2021-11-03 03:56:27,552 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-11-03 03:56:27,552 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-11-03 03:56:27,552 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION [2021-11-03 03:56:27,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-11-03 03:56:27,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-11-03 03:56:27,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-11-03 03:56:27,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-11-03 03:56:27,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-11-03 03:56:27,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-11-03 03:56:27,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-11-03 03:56:27,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-11-03 03:56:27,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-11-03 03:56:27,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-11-03 03:56:27,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99REQUIRES_VIOLATION [2021-11-03 03:56:27,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100REQUIRES_VIOLATION [2021-11-03 03:56:27,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-11-03 03:56:27,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103REQUIRES_VIOLATION [2021-11-03 03:56:27,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-11-03 03:56:27,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-11-03 03:56:27,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-11-03 03:56:27,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110REQUIRES_VIOLATION [2021-11-03 03:56:27,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-11-03 03:56:27,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-11-03 03:56:27,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-11-03 03:56:27,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-11-03 03:56:27,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-11-03 03:56:27,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-11-03 03:56:27,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-11-03 03:56:27,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-11-03 03:56:27,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126REQUIRES_VIOLATION [2021-11-03 03:56:27,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127REQUIRES_VIOLATION [2021-11-03 03:56:27,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128REQUIRES_VIOLATION [2021-11-03 03:56:27,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129REQUIRES_VIOLATION [2021-11-03 03:56:27,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131REQUIRES_VIOLATION [2021-11-03 03:56:27,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132REQUIRES_VIOLATION [2021-11-03 03:56:27,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133REQUIRES_VIOLATION [2021-11-03 03:56:27,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134REQUIRES_VIOLATION [2021-11-03 03:56:27,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136REQUIRES_VIOLATION [2021-11-03 03:56:27,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137REQUIRES_VIOLATION [2021-11-03 03:56:27,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138REQUIRES_VIOLATION [2021-11-03 03:56:27,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139REQUIRES_VIOLATION [2021-11-03 03:56:27,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140REQUIRES_VIOLATION [2021-11-03 03:56:27,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141REQUIRES_VIOLATION [2021-11-03 03:56:27,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:56:27,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:56:27,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:56:27,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:56:27,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2021-11-03 03:56:27,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-03 03:56:27,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-03 03:56:28,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:56:28,182 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:56:28,185 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 03:56:28,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:56:28 BoogieIcfgContainer [2021-11-03 03:56:28,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 03:56:28,222 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 03:56:28,222 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 03:56:28,222 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 03:56:28,223 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:52:06" (3/4) ... [2021-11-03 03:56:28,226 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-03 03:56:28,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 03:56:28,227 INFO L168 Benchmark]: Toolchain (without parser) took 263654.47 ms. Allocated memory was 60.8 MB in the beginning and 432.0 MB in the end (delta: 371.2 MB). Free memory was 39.3 MB in the beginning and 325.8 MB in the end (delta: -286.5 MB). Peak memory consumption was 84.3 MB. Max. memory is 16.1 GB. [2021-11-03 03:56:28,227 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 60.8 MB. Free memory is still 42.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:56:28,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.81 ms. Allocated memory was 60.8 MB in the beginning and 79.7 MB in the end (delta: 18.9 MB). Free memory was 39.1 MB in the beginning and 56.6 MB in the end (delta: -17.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-11-03 03:56:28,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.66 ms. Allocated memory is still 79.7 MB. Free memory was 56.3 MB in the beginning and 52.4 MB in the end (delta: 3.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 03:56:28,228 INFO L168 Benchmark]: Boogie Preprocessor took 71.75 ms. Allocated memory is still 79.7 MB. Free memory was 52.4 MB in the beginning and 48.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-03 03:56:28,228 INFO L168 Benchmark]: RCFGBuilder took 1252.45 ms. Allocated memory is still 79.7 MB. Free memory was 48.6 MB in the beginning and 50.4 MB in the end (delta: -1.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 16.1 GB. [2021-11-03 03:56:28,229 INFO L168 Benchmark]: TraceAbstraction took 261448.56 ms. Allocated memory was 79.7 MB in the beginning and 432.0 MB in the end (delta: 352.3 MB). Free memory was 50.0 MB in the beginning and 326.8 MB in the end (delta: -276.9 MB). Peak memory consumption was 264.6 MB. Max. memory is 16.1 GB. [2021-11-03 03:56:28,229 INFO L168 Benchmark]: Witness Printer took 3.87 ms. Allocated memory is still 432.0 MB. Free memory was 326.8 MB in the beginning and 325.8 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:56:28,231 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.22 ms. Allocated memory is still 60.8 MB. Free memory is still 42.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 798.81 ms. Allocated memory was 60.8 MB in the beginning and 79.7 MB in the end (delta: 18.9 MB). Free memory was 39.1 MB in the beginning and 56.6 MB in the end (delta: -17.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.66 ms. Allocated memory is still 79.7 MB. Free memory was 56.3 MB in the beginning and 52.4 MB in the end (delta: 3.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.75 ms. Allocated memory is still 79.7 MB. Free memory was 52.4 MB in the beginning and 48.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1252.45 ms. Allocated memory is still 79.7 MB. Free memory was 48.6 MB in the beginning and 50.4 MB in the end (delta: -1.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 261448.56 ms. Allocated memory was 79.7 MB in the beginning and 432.0 MB in the end (delta: 352.3 MB). Free memory was 50.0 MB in the beginning and 326.8 MB in the end (delta: -276.9 MB). Peak memory consumption was 264.6 MB. Max. memory is 16.1 GB. * Witness Printer took 3.87 ms. Allocated memory is still 432.0 MB. Free memory was 326.8 MB in the beginning and 325.8 MB in the end (delta: 1.0 MB). There was no memory consumed. 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 - UnprovableResult [Line: 878]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) [L902] node->value = value [L890] head->next [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->next = (&node->nested) [L911] COND TRUE __VERIFIER_nondet_int() [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) [L902] node->value = value [L890] head->next [L878] next->prev = new - UnprovableResult [Line: 902]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 928]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 928]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 886]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 886]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 916]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 916]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 947]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 353 locations, 146 error locations. Started 1 CEGAR loops. OverallTime: 261.3s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 66.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3861 SDtfs, 17668 SDslu, 7003 SDs, 0 SdLazy, 5995 SolverSat, 224 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 54.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 288 SyntacticMatches, 6 SemanticMatches, 143 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 55.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred in iteration=0, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 1638 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 100.6s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 402 ConstructedInterpolants, 79 QuantifiedInterpolants, 5686 SizeOfPredicates, 140 NumberOfNonLiveVariables, 1475 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 33 InterpolantComputations, 32 PerfectInterpolantSequences, 3/7 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 could not prove your program: unable to determine feasibility of some traces [2021-11-03 03:56:28,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90369e4c-b81a-4a4f-ab56-ab9763cb3d82/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN