./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:06:26,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:06:26,155 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:06:26,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:06:26,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:06:26,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:06:26,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:06:26,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:06:26,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:06:26,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:06:26,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:06:26,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:06:26,222 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:06:26,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:06:26,224 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:06:26,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:06:26,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:06:26,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:06:26,226 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:06:26,226 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:06:26,227 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:06:26,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:06:26,228 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:06:26,228 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:06:26,229 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:06:26,229 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:06:26,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:06:26,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:06:26,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:06:26,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:26,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:06:26,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:06:26,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:06:26,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:06:26,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:06:26,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:06:26,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:06:26,235 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:06:26,235 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/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_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2023-11-06 22:06:26,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:06:26,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:06:26,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:06:26,530 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:06:26,531 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:06:26,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2023-11-06 22:06:29,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:06:30,014 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:06:30,015 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2023-11-06 22:06:30,031 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/data/1f2cb0d96/da48649aa27a4ab98e10b639067fecf9/FLAG460ea0ce5 [2023-11-06 22:06:30,052 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/data/1f2cb0d96/da48649aa27a4ab98e10b639067fecf9 [2023-11-06 22:06:30,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:06:30,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:06:30,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:30,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:06:30,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:06:30,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:30" (1/1) ... [2023-11-06 22:06:30,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b96dbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:30, skipping insertion in model container [2023-11-06 22:06:30,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:30" (1/1) ... [2023-11-06 22:06:30,117 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:06:30,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:30,496 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-06 22:06:30,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@411f14e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:30, skipping insertion in model container [2023-11-06 22:06:30,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:30,498 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-06 22:06:30,500 INFO L158 Benchmark]: Toolchain (without parser) took 439.55ms. Allocated memory is still 115.3MB. Free memory was 72.5MB in the beginning and 60.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:06:30,500 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 115.3MB. Free memory is still 63.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:06:30,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.70ms. Allocated memory is still 115.3MB. Free memory was 72.2MB in the beginning and 60.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:06:30,503 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 115.3MB. Free memory is still 63.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.70ms. Allocated memory is still 115.3MB. Free memory was 72.2MB in the beginning and 60.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 571]: Unsupported Syntax Found a cast between two array/pointer types of different sizes 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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:06:32,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:06:33,064 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:06:33,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:06:33,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:06:33,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:06:33,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:06:33,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:06:33,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:06:33,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:06:33,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:06:33,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:06:33,140 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:06:33,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:06:33,143 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:06:33,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:06:33,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:06:33,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:06:33,145 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:06:33,145 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:06:33,146 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:06:33,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:06:33,147 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:06:33,147 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:06:33,148 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:06:33,148 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:06:33,149 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:06:33,149 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:06:33,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:06:33,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:06:33,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:06:33,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:33,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:06:33,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:06:33,153 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:06:33,154 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:06:33,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:06:33,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:06:33,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:06:33,156 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:06:33,156 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:06:33,156 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/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_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2023-11-06 22:06:33,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:06:33,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:06:33,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:06:33,641 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:06:33,642 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:06:33,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2023-11-06 22:06:36,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:06:37,157 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:06:37,157 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2023-11-06 22:06:37,173 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/data/6ab1d6a09/22534d0f39a248db9102556323740b74/FLAGbbb8a99f4 [2023-11-06 22:06:37,188 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/data/6ab1d6a09/22534d0f39a248db9102556323740b74 [2023-11-06 22:06:37,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:06:37,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:06:37,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:37,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:06:37,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:06:37,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:37,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c64bfcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37, skipping insertion in model container [2023-11-06 22:06:37,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:37,250 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:06:37,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:37,665 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-06 22:06:37,687 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:06:37,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:37,785 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:06:37,845 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:37,882 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:06:37,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37 WrapperNode [2023-11-06 22:06:37,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:37,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:06:37,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:06:37,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:06:37,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:37,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:37,965 INFO L138 Inliner]: procedures = 125, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 168 [2023-11-06 22:06:37,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:06:37,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:06:37,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:06:37,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:06:37,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:37,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:37,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:37,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:38,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:38,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:38,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:38,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:38,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:06:38,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:06:38,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:06:38,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:06:38,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37" (1/1) ... [2023-11-06 22:06:38,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:38,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:38,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:06:38,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:06:38,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:06:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:06:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:06:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:06:38,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:06:38,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:06:38,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:06:38,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:06:38,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:06:38,260 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:06:38,262 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:06:39,071 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:06:39,080 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:06:39,080 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:06:39,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:39 BoogieIcfgContainer [2023-11-06 22:06:39,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:06:39,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:06:39,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:06:39,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:06:39,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:06:37" (1/3) ... [2023-11-06 22:06:39,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f424d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:39, skipping insertion in model container [2023-11-06 22:06:39,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:37" (2/3) ... [2023-11-06 22:06:39,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f424d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:39, skipping insertion in model container [2023-11-06 22:06:39,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:39" (3/3) ... [2023-11-06 22:06:39,092 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_dsw.i [2023-11-06 22:06:39,113 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:06:39,113 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2023-11-06 22:06:39,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:06:39,170 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f781e50, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:06:39,170 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2023-11-06 22:06:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 82 states have (on average 2.158536585365854) internal successors, (177), 159 states have internal predecessors, (177), 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) [2023-11-06 22:06:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:06:39,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:39,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:06:39,188 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:39,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:39,197 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-11-06 22:06:39,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:39,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175367408] [2023-11-06 22:06:39,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:39,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:39,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:39,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:39,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:06:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:39,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:06:39,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:39,416 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:06:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:39,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:39,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:39,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175367408] [2023-11-06 22:06:39,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175367408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:39,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:39,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:06:39,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982004025] [2023-11-06 22:06:39,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:39,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:06:39,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:39,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:06:39,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:06:39,492 INFO L87 Difference]: Start difference. First operand has 160 states, 82 states have (on average 2.158536585365854) internal successors, (177), 159 states have internal predecessors, (177), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-11-06 22:06:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:39,854 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2023-11-06 22:06:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:06:39,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2023-11-06 22:06:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:39,867 INFO L225 Difference]: With dead ends: 174 [2023-11-06 22:06:39,867 INFO L226 Difference]: Without dead ends: 172 [2023-11-06 22:06:39,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:06:39,872 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 124 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:39,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 134 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:06:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-06 22:06:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 156. [2023-11-06 22:06:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 81 states have (on average 2.0864197530864197) internal successors, (169), 155 states have internal predecessors, (169), 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) [2023-11-06 22:06:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2023-11-06 22:06:39,917 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 3 [2023-11-06 22:06:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:39,918 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2023-11-06 22:06:39,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-11-06 22:06:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2023-11-06 22:06:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:06:39,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:39,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:06:39,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:40,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:40,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:40,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-11-06 22:06:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:40,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464617556] [2023-11-06 22:06:40,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:40,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:40,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:40,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:40,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:06:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:06:40,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:40,230 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:06:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:40,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:40,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:40,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464617556] [2023-11-06 22:06:40,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464617556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:40,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:06:40,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998979104] [2023-11-06 22:06:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:40,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:06:40,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:40,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:06:40,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:06:40,253 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-11-06 22:06:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:40,639 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2023-11-06 22:06:40,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:06:40,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2023-11-06 22:06:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:40,642 INFO L225 Difference]: With dead ends: 154 [2023-11-06 22:06:40,642 INFO L226 Difference]: Without dead ends: 154 [2023-11-06 22:06:40,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:06:40,644 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 159 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:40,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 90 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:06:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-06 22:06:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2023-11-06 22:06:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 81 states have (on average 2.0617283950617282) internal successors, (167), 153 states have internal predecessors, (167), 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) [2023-11-06 22:06:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 167 transitions. [2023-11-06 22:06:40,657 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 167 transitions. Word has length 3 [2023-11-06 22:06:40,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:40,658 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 167 transitions. [2023-11-06 22:06:40,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-11-06 22:06:40,658 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2023-11-06 22:06:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 22:06:40,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:40,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:40,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:40,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:40,870 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:40,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2023-11-06 22:06:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:40,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763525767] [2023-11-06 22:06:40,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:40,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:40,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:40,874 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:40,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:06:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:06:40,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:41,011 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:06:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:41,062 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:41,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:41,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763525767] [2023-11-06 22:06:41,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763525767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:41,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:41,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:06:41,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518120101] [2023-11-06 22:06:41,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:41,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:06:41,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:41,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:06:41,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:06:41,078 INFO L87 Difference]: Start difference. First operand 154 states and 167 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-11-06 22:06:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:41,620 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2023-11-06 22:06:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:06:41,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 [2023-11-06 22:06:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:41,622 INFO L225 Difference]: With dead ends: 165 [2023-11-06 22:06:41,623 INFO L226 Difference]: Without dead ends: 165 [2023-11-06 22:06:41,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:41,624 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 219 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:41,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 100 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:06:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-06 22:06:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 139. [2023-11-06 22:06:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.8452380952380953) internal successors, (155), 138 states have internal predecessors, (155), 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) [2023-11-06 22:06:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2023-11-06 22:06:41,651 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 7 [2023-11-06 22:06:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:41,651 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2023-11-06 22:06:41,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-11-06 22:06:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2023-11-06 22:06:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 22:06:41,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:41,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:41,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-06 22:06:41,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:41,863 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:41,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2023-11-06 22:06:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:41,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522332034] [2023-11-06 22:06:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:41,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:41,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:41,866 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:41,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:06:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:41,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:06:41,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:41,965 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:06:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:42,044 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:42,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:42,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522332034] [2023-11-06 22:06:42,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522332034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:42,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:42,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:06:42,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289380476] [2023-11-06 22:06:42,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:42,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:06:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:42,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:06:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:06:42,053 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-11-06 22:06:42,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:42,817 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2023-11-06 22:06:42,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:06:42,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 [2023-11-06 22:06:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:42,821 INFO L225 Difference]: With dead ends: 195 [2023-11-06 22:06:42,821 INFO L226 Difference]: Without dead ends: 195 [2023-11-06 22:06:42,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:42,823 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 261 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:42,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 125 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:06:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-06 22:06:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 174. [2023-11-06 22:06:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 119 states have (on average 1.6890756302521008) internal successors, (201), 173 states have internal predecessors, (201), 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) [2023-11-06 22:06:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 201 transitions. [2023-11-06 22:06:42,837 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 201 transitions. Word has length 7 [2023-11-06 22:06:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:42,837 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 201 transitions. [2023-11-06 22:06:42,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-11-06 22:06:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 201 transitions. [2023-11-06 22:06:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:06:42,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:42,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:42,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:43,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:43,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:43,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:43,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1237590610, now seen corresponding path program 1 times [2023-11-06 22:06:43,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:43,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999028575] [2023-11-06 22:06:43,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:43,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:43,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:43,053 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:43,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:06:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:43,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:06:43,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:43,137 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:06:43,196 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:06:43,197 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-11-06 22:06:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:43,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:43,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:43,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999028575] [2023-11-06 22:06:43,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999028575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:43,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:43,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:06:43,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118335741] [2023-11-06 22:06:43,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:43,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:06:43,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:43,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:06:43,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:06:43,210 INFO L87 Difference]: Start difference. First operand 174 states and 201 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2023-11-06 22:06:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:43,622 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2023-11-06 22:06:43,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:06:43,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 [2023-11-06 22:06:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:43,624 INFO L225 Difference]: With dead ends: 191 [2023-11-06 22:06:43,625 INFO L226 Difference]: Without dead ends: 191 [2023-11-06 22:06:43,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:43,626 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 119 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:43,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 189 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:06:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-06 22:06:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2023-11-06 22:06:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 119 states have (on average 1.680672268907563) internal successors, (200), 173 states have internal predecessors, (200), 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) [2023-11-06 22:06:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 200 transitions. [2023-11-06 22:06:43,653 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 200 transitions. Word has length 10 [2023-11-06 22:06:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:43,653 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 200 transitions. [2023-11-06 22:06:43,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2023-11-06 22:06:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 200 transitions. [2023-11-06 22:06:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:06:43,655 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:43,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:43,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:43,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:43,856 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:43,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2023-11-06 22:06:43,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:43,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759081960] [2023-11-06 22:06:43,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:43,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:43,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:43,858 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:43,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:06:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:43,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:06:43,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:43,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:43,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:43,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759081960] [2023-11-06 22:06:43,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759081960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:43,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:43,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:06:43,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224415697] [2023-11-06 22:06:43,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:43,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:06:43,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:43,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:06:43,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:06:43,965 INFO L87 Difference]: Start difference. First operand 174 states and 200 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2023-11-06 22:06:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:43,986 INFO L93 Difference]: Finished difference Result 176 states and 202 transitions. [2023-11-06 22:06:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:06:43,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 14 [2023-11-06 22:06:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:43,988 INFO L225 Difference]: With dead ends: 176 [2023-11-06 22:06:43,988 INFO L226 Difference]: Without dead ends: 176 [2023-11-06 22:06:43,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:06:43,989 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:43,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:06:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-11-06 22:06:43,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2023-11-06 22:06:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 121 states have (on average 1.6694214876033058) internal successors, (202), 175 states have internal predecessors, (202), 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) [2023-11-06 22:06:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 202 transitions. [2023-11-06 22:06:43,996 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 202 transitions. Word has length 14 [2023-11-06 22:06:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:43,996 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 202 transitions. [2023-11-06 22:06:43,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2023-11-06 22:06:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 202 transitions. [2023-11-06 22:06:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:06:43,997 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:43,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:44,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:44,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:44,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:44,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:44,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2023-11-06 22:06:44,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:44,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426558780] [2023-11-06 22:06:44,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:44,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:44,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:44,212 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:44,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:06:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:44,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:06:44,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:44,298 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-11-06 22:06:44,309 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-11-06 22:06:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:44,449 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:44,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:44,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426558780] [2023-11-06 22:06:44,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426558780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:44,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:44,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:06:44,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468069208] [2023-11-06 22:06:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:44,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:06:44,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:44,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:06:44,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:06:44,452 INFO L87 Difference]: Start difference. First operand 176 states and 202 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-11-06 22:06:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:45,181 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2023-11-06 22:06:45,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:06:45,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2023-11-06 22:06:45,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:45,183 INFO L225 Difference]: With dead ends: 225 [2023-11-06 22:06:45,183 INFO L226 Difference]: Without dead ends: 225 [2023-11-06 22:06:45,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:06:45,184 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 67 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:45,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 570 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:06:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-06 22:06:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 192. [2023-11-06 22:06:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 137 states have (on average 1.635036496350365) internal successors, (224), 191 states have internal predecessors, (224), 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) [2023-11-06 22:06:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 224 transitions. [2023-11-06 22:06:45,191 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 224 transitions. Word has length 16 [2023-11-06 22:06:45,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:45,192 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 224 transitions. [2023-11-06 22:06:45,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-11-06 22:06:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 224 transitions. [2023-11-06 22:06:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:06:45,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:45,193 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:45,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-06 22:06:45,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:45,404 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:45,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1853935746, now seen corresponding path program 1 times [2023-11-06 22:06:45,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:45,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924052309] [2023-11-06 22:06:45,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:45,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:45,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:45,413 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:45,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:06:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:45,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:06:45,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:45,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:45,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:45,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924052309] [2023-11-06 22:06:45,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924052309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:45,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:45,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:06:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046981146] [2023-11-06 22:06:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:45,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:06:45,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:45,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:06:45,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:06:45,554 INFO L87 Difference]: Start difference. First operand 192 states and 224 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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) [2023-11-06 22:06:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:46,068 INFO L93 Difference]: Finished difference Result 234 states and 270 transitions. [2023-11-06 22:06:46,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:06:46,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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 18 [2023-11-06 22:06:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:46,071 INFO L225 Difference]: With dead ends: 234 [2023-11-06 22:06:46,071 INFO L226 Difference]: Without dead ends: 234 [2023-11-06 22:06:46,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:46,072 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 139 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:46,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 187 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:06:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-11-06 22:06:46,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2023-11-06 22:06:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 139 states have (on average 1.6402877697841727) internal successors, (228), 193 states have internal predecessors, (228), 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) [2023-11-06 22:06:46,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 228 transitions. [2023-11-06 22:06:46,078 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 228 transitions. Word has length 18 [2023-11-06 22:06:46,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:46,078 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 228 transitions. [2023-11-06 22:06:46,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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) [2023-11-06 22:06:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 228 transitions. [2023-11-06 22:06:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:06:46,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:46,079 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:46,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:46,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:46,289 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:46,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1853935745, now seen corresponding path program 1 times [2023-11-06 22:06:46,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:46,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122376508] [2023-11-06 22:06:46,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:46,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:46,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:46,291 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:46,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:06:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:06:46,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:46,471 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:46,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:46,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122376508] [2023-11-06 22:06:46,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122376508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:46,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:46,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:06:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064350804] [2023-11-06 22:06:46,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:46,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:06:46,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:46,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:06:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:06:46,474 INFO L87 Difference]: Start difference. First operand 194 states and 228 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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) [2023-11-06 22:06:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:47,523 INFO L93 Difference]: Finished difference Result 321 states and 362 transitions. [2023-11-06 22:06:47,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:06:47,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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 18 [2023-11-06 22:06:47,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:47,526 INFO L225 Difference]: With dead ends: 321 [2023-11-06 22:06:47,526 INFO L226 Difference]: Without dead ends: 321 [2023-11-06 22:06:47,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:06:47,527 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 416 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:47,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 395 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:06:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-06 22:06:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 197. [2023-11-06 22:06:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 142 states have (on average 1.6408450704225352) internal successors, (233), 196 states have internal predecessors, (233), 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) [2023-11-06 22:06:47,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 233 transitions. [2023-11-06 22:06:47,535 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 233 transitions. Word has length 18 [2023-11-06 22:06:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:47,536 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 233 transitions. [2023-11-06 22:06:47,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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) [2023-11-06 22:06:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 233 transitions. [2023-11-06 22:06:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:06:47,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:47,537 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:47,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-06 22:06:47,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:47,749 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:47,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1853933824, now seen corresponding path program 1 times [2023-11-06 22:06:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:47,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873596256] [2023-11-06 22:06:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:47,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:47,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:47,751 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:47,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:06:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:47,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:06:47,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:47,882 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:06:47,891 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:06:47,934 INFO L351 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-06 22:06:47,952 INFO L351 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-06 22:06:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:48,167 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:48,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:48,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873596256] [2023-11-06 22:06:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873596256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:48,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:48,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:06:48,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182790370] [2023-11-06 22:06:48,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:48,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:06:48,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:48,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:06:48,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:06:48,169 INFO L87 Difference]: Start difference. First operand 197 states and 233 transitions. Second operand has 8 states, 8 states have (on average 2.25) 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) [2023-11-06 22:06:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:49,048 INFO L93 Difference]: Finished difference Result 298 states and 339 transitions. [2023-11-06 22:06:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:06:49,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) 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 18 [2023-11-06 22:06:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:49,051 INFO L225 Difference]: With dead ends: 298 [2023-11-06 22:06:49,051 INFO L226 Difference]: Without dead ends: 298 [2023-11-06 22:06:49,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:06:49,052 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 164 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:49,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 779 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:06:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-11-06 22:06:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 207. [2023-11-06 22:06:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.5986842105263157) internal successors, (243), 206 states have internal predecessors, (243), 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) [2023-11-06 22:06:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 243 transitions. [2023-11-06 22:06:49,060 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 243 transitions. Word has length 18 [2023-11-06 22:06:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:49,060 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 243 transitions. [2023-11-06 22:06:49,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) 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) [2023-11-06 22:06:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 243 transitions. [2023-11-06 22:06:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:06:49,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:49,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:49,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:49,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:49,269 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:49,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2023-11-06 22:06:49,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:49,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39217284] [2023-11-06 22:06:49,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:49,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:49,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:49,271 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:49,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-06 22:06:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:06:49,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:49,377 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:06:49,396 INFO L351 Elim1Store]: Elim1 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 15 treesize of output 1 [2023-11-06 22:06:49,417 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-11-06 22:06:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:49,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:49,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:49,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39217284] [2023-11-06 22:06:49,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39217284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:49,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:49,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:06:49,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392127349] [2023-11-06 22:06:49,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:49,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:06:49,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:49,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:06:49,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:49,430 INFO L87 Difference]: Start difference. First operand 207 states and 243 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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) [2023-11-06 22:06:49,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:49,961 INFO L93 Difference]: Finished difference Result 206 states and 241 transitions. [2023-11-06 22:06:49,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:06:49,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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 18 [2023-11-06 22:06:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:49,964 INFO L225 Difference]: With dead ends: 206 [2023-11-06 22:06:49,964 INFO L226 Difference]: Without dead ends: 206 [2023-11-06 22:06:49,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:06:49,965 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 7 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:49,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 356 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:06:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-06 22:06:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2023-11-06 22:06:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 152 states have (on average 1.5855263157894737) internal successors, (241), 205 states have internal predecessors, (241), 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) [2023-11-06 22:06:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 241 transitions. [2023-11-06 22:06:49,971 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 241 transitions. Word has length 18 [2023-11-06 22:06:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:49,971 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 241 transitions. [2023-11-06 22:06:49,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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) [2023-11-06 22:06:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 241 transitions. [2023-11-06 22:06:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:06:49,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:49,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:49,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:50,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:50,173 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:50,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2023-11-06 22:06:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:50,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906620031] [2023-11-06 22:06:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:50,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:50,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:50,175 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:50,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-06 22:06:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:50,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:06:50,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:50,275 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:06:50,304 INFO L351 Elim1Store]: Elim1 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 15 treesize of output 1 [2023-11-06 22:06:50,309 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:06:50,348 INFO L351 Elim1Store]: Elim1 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 17 treesize of output 9 [2023-11-06 22:06:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:50,366 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:50,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:50,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906620031] [2023-11-06 22:06:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906620031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:50,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:50,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:06:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001803446] [2023-11-06 22:06:50,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:50,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:06:50,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:50,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:06:50,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:50,368 INFO L87 Difference]: Start difference. First operand 206 states and 241 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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) [2023-11-06 22:06:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:50,995 INFO L93 Difference]: Finished difference Result 205 states and 239 transitions. [2023-11-06 22:06:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:06:50,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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 18 [2023-11-06 22:06:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:50,997 INFO L225 Difference]: With dead ends: 205 [2023-11-06 22:06:50,997 INFO L226 Difference]: Without dead ends: 205 [2023-11-06 22:06:50,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:06:50,998 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 5 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:50,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 338 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:06:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-06 22:06:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2023-11-06 22:06:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 152 states have (on average 1.5723684210526316) internal successors, (239), 204 states have internal predecessors, (239), 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) [2023-11-06 22:06:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 239 transitions. [2023-11-06 22:06:51,004 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 239 transitions. Word has length 18 [2023-11-06 22:06:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:51,004 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 239 transitions. [2023-11-06 22:06:51,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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) [2023-11-06 22:06:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 239 transitions. [2023-11-06 22:06:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 22:06:51,005 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:51,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:51,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:51,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:51,217 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:51,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:51,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1637434257, now seen corresponding path program 1 times [2023-11-06 22:06:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:51,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98418063] [2023-11-06 22:06:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:51,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:51,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:51,219 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:51,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-06 22:06:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:06:51,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:51,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:06:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:51,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:51,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98418063] [2023-11-06 22:06:51,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98418063] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:06:51,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:06:51,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-11-06 22:06:51,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818433638] [2023-11-06 22:06:51,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:06:51,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:06:51,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:51,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:06:51,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:06:51,460 INFO L87 Difference]: Start difference. First operand 205 states and 239 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2023-11-06 22:06:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:51,907 INFO L93 Difference]: Finished difference Result 282 states and 320 transitions. [2023-11-06 22:06:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:06:51,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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 19 [2023-11-06 22:06:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:51,910 INFO L225 Difference]: With dead ends: 282 [2023-11-06 22:06:51,910 INFO L226 Difference]: Without dead ends: 282 [2023-11-06 22:06:51,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:06:51,911 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 333 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:51,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 440 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:06:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-06 22:06:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 204. [2023-11-06 22:06:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 151 states have (on average 1.5695364238410596) internal successors, (237), 203 states have internal predecessors, (237), 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) [2023-11-06 22:06:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 237 transitions. [2023-11-06 22:06:51,918 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 237 transitions. Word has length 19 [2023-11-06 22:06:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:51,918 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 237 transitions. [2023-11-06 22:06:51,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2023-11-06 22:06:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 237 transitions. [2023-11-06 22:06:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:06:51,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:51,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:51,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-06 22:06:52,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:52,129 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:52,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:52,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2023-11-06 22:06:52,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:52,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716556506] [2023-11-06 22:06:52,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:52,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:52,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:52,131 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:52,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-06 22:06:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:52,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:06:52,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:52,293 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:06:52,293 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-06 22:06:52,488 INFO L322 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-06 22:06:52,488 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-06 22:06:52,598 INFO L351 Elim1Store]: Elim1 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 15 treesize of output 1 [2023-11-06 22:06:52,773 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:06:52,773 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2023-11-06 22:06:52,856 INFO L351 Elim1Store]: Elim1 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 43 treesize of output 27 [2023-11-06 22:06:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:52,956 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:52,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:52,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716556506] [2023-11-06 22:06:52,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716556506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:52,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:52,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:06:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421991562] [2023-11-06 22:06:52,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:52,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:06:52,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:52,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:06:52,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:06:52,958 INFO L87 Difference]: Start difference. First operand 204 states and 237 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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) [2023-11-06 22:06:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:54,443 INFO L93 Difference]: Finished difference Result 224 states and 257 transitions. [2023-11-06 22:06:54,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:06:54,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 [2023-11-06 22:06:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:54,445 INFO L225 Difference]: With dead ends: 224 [2023-11-06 22:06:54,445 INFO L226 Difference]: Without dead ends: 224 [2023-11-06 22:06:54,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:06:54,446 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 349 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:54,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 305 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:06:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-06 22:06:54,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 203. [2023-11-06 22:06:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 151 states have (on average 1.5496688741721854) internal successors, (234), 202 states have internal predecessors, (234), 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) [2023-11-06 22:06:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 234 transitions. [2023-11-06 22:06:54,457 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 234 transitions. Word has length 21 [2023-11-06 22:06:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:54,458 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 234 transitions. [2023-11-06 22:06:54,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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) [2023-11-06 22:06:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 234 transitions. [2023-11-06 22:06:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:06:54,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:54,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:54,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:54,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:54,672 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:54,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:54,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2023-11-06 22:06:54,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:54,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982561023] [2023-11-06 22:06:54,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:54,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:54,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:54,674 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:54,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-06 22:06:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:06:54,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:54,821 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:06:54,872 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:06:54,876 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-11-06 22:06:54,887 INFO L351 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:06:54,919 INFO L351 Elim1Store]: Elim1 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 15 treesize of output 1 [2023-11-06 22:06:54,930 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:06:55,051 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:06:55,052 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-06 22:06:55,059 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-11-06 22:06:55,096 INFO L351 Elim1Store]: Elim1 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 25 treesize of output 13 [2023-11-06 22:06:55,103 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-06 22:06:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:55,128 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:55,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:55,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982561023] [2023-11-06 22:06:55,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982561023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:55,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:55,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:06:55,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330479895] [2023-11-06 22:06:55,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:55,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:06:55,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:55,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:06:55,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:06:55,131 INFO L87 Difference]: Start difference. First operand 203 states and 234 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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) [2023-11-06 22:06:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:56,250 INFO L93 Difference]: Finished difference Result 223 states and 255 transitions. [2023-11-06 22:06:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:06:56,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 [2023-11-06 22:06:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:56,253 INFO L225 Difference]: With dead ends: 223 [2023-11-06 22:06:56,253 INFO L226 Difference]: Without dead ends: 223 [2023-11-06 22:06:56,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:06:56,254 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 193 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:56,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 229 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:06:56,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-11-06 22:06:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 202. [2023-11-06 22:06:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 151 states have (on average 1.5364238410596027) internal successors, (232), 201 states have internal predecessors, (232), 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) [2023-11-06 22:06:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 232 transitions. [2023-11-06 22:06:56,261 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 232 transitions. Word has length 21 [2023-11-06 22:06:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:56,261 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 232 transitions. [2023-11-06 22:06:56,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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) [2023-11-06 22:06:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 232 transitions. [2023-11-06 22:06:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:06:56,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:56,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:56,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-06 22:06:56,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:56,473 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:56,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2023-11-06 22:06:56,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:56,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565909235] [2023-11-06 22:06:56,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:56,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:56,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:56,475 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:56,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-06 22:06:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:56,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:06:56,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:56,591 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:06:56,603 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-06 22:06:56,625 INFO L351 Elim1Store]: Elim1 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 11 [2023-11-06 22:06:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:56,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:56,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:56,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565909235] [2023-11-06 22:06:56,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565909235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:56,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:56,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:06:56,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047857941] [2023-11-06 22:06:56,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:56,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:06:56,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:56,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:06:56,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:56,639 INFO L87 Difference]: Start difference. First operand 202 states and 232 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) [2023-11-06 22:06:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:57,176 INFO L93 Difference]: Finished difference Result 201 states and 230 transitions. [2023-11-06 22:06:57,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:06:57,176 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 [2023-11-06 22:06:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:57,178 INFO L225 Difference]: With dead ends: 201 [2023-11-06 22:06:57,178 INFO L226 Difference]: Without dead ends: 201 [2023-11-06 22:06:57,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:06:57,179 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 7 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:57,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 345 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:06:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-06 22:06:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2023-11-06 22:06:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 151 states have (on average 1.5231788079470199) internal successors, (230), 200 states have internal predecessors, (230), 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) [2023-11-06 22:06:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 230 transitions. [2023-11-06 22:06:57,186 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 230 transitions. Word has length 22 [2023-11-06 22:06:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:57,186 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 230 transitions. [2023-11-06 22:06:57,186 INFO L496 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) [2023-11-06 22:06:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 230 transitions. [2023-11-06 22:06:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:06:57,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:57,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:57,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:57,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:57,398 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:57,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2023-11-06 22:06:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:57,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937129518] [2023-11-06 22:06:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:57,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:57,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:57,401 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:57,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-06 22:06:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:57,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:06:57,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:57,505 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:06:57,528 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-11-06 22:06:57,551 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-06 22:06:57,587 INFO L351 Elim1Store]: Elim1 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 21 treesize of output 9 [2023-11-06 22:06:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:57,606 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:57,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:57,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937129518] [2023-11-06 22:06:57,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937129518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:57,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:57,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:06:57,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443571120] [2023-11-06 22:06:57,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:57,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:06:57,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:57,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:06:57,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:57,609 INFO L87 Difference]: Start difference. First operand 201 states and 230 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) [2023-11-06 22:06:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:58,207 INFO L93 Difference]: Finished difference Result 200 states and 228 transitions. [2023-11-06 22:06:58,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:06:58,209 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 [2023-11-06 22:06:58,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:58,211 INFO L225 Difference]: With dead ends: 200 [2023-11-06 22:06:58,211 INFO L226 Difference]: Without dead ends: 200 [2023-11-06 22:06:58,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:06:58,212 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 5 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:58,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 327 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:06:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-06 22:06:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2023-11-06 22:06:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 151 states have (on average 1.509933774834437) internal successors, (228), 199 states have internal predecessors, (228), 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) [2023-11-06 22:06:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 228 transitions. [2023-11-06 22:06:58,218 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 228 transitions. Word has length 22 [2023-11-06 22:06:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:58,219 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 228 transitions. [2023-11-06 22:06:58,219 INFO L496 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) [2023-11-06 22:06:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 228 transitions. [2023-11-06 22:06:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 22:06:58,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:58,220 INFO L195 NwaCegarLoop]: 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] [2023-11-06 22:06:58,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:58,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:58,433 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:06:58,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2023-11-06 22:06:58,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:58,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037277989] [2023-11-06 22:06:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:58,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:58,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:58,435 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:06:58,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-06 22:06:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:58,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:06:58,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:58,623 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:06:58,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-06 22:06:58,854 INFO L322 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-06 22:06:58,855 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-06 22:06:58,925 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-06 22:06:59,127 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 22:06:59,128 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2023-11-06 22:06:59,209 INFO L351 Elim1Store]: Elim1 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 51 treesize of output 27 [2023-11-06 22:06:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:59,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:59,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:06:59,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037277989] [2023-11-06 22:06:59,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037277989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:59,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:59,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:06:59,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209617397] [2023-11-06 22:06:59,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:59,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:06:59,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:06:59,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:06:59,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:06:59,293 INFO L87 Difference]: Start difference. First operand 200 states and 228 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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) [2023-11-06 22:07:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:00,719 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2023-11-06 22:07:00,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:07:00,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 [2023-11-06 22:07:00,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:00,721 INFO L225 Difference]: With dead ends: 220 [2023-11-06 22:07:00,721 INFO L226 Difference]: Without dead ends: 220 [2023-11-06 22:07:00,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:07:00,722 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 333 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:00,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 295 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:07:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-06 22:07:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 199. [2023-11-06 22:07:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 151 states have (on average 1.5033112582781456) internal successors, (227), 198 states have internal predecessors, (227), 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) [2023-11-06 22:07:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 227 transitions. [2023-11-06 22:07:00,729 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 227 transitions. Word has length 25 [2023-11-06 22:07:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:00,729 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 227 transitions. [2023-11-06 22:07:00,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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) [2023-11-06 22:07:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 227 transitions. [2023-11-06 22:07:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 22:07:00,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:00,730 INFO L195 NwaCegarLoop]: 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] [2023-11-06 22:07:00,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:00,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:00,942 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:07:00,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:00,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2023-11-06 22:07:00,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:07:00,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639349102] [2023-11-06 22:07:00,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:00,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:00,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:07:00,944 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:07:00,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-06 22:07:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:01,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:07:01,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:01,094 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:07:01,155 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:07:01,155 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-11-06 22:07:01,162 INFO L351 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:07:01,190 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-11-06 22:07:01,200 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-06 22:07:01,319 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 22:07:01,320 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-06 22:07:01,330 INFO L351 Elim1Store]: Elim1 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 30 treesize of output 13 [2023-11-06 22:07:01,371 INFO L351 Elim1Store]: Elim1 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 31 treesize of output 13 [2023-11-06 22:07:01,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2023-11-06 22:07:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:01,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:07:01,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:07:01,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639349102] [2023-11-06 22:07:01,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639349102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:01,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:01,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:07:01,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713493222] [2023-11-06 22:07:01,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:01,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:07:01,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:07:01,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:07:01,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:07:01,401 INFO L87 Difference]: Start difference. First operand 199 states and 227 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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) [2023-11-06 22:07:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:02,628 INFO L93 Difference]: Finished difference Result 219 states and 249 transitions. [2023-11-06 22:07:02,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:07:02,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 [2023-11-06 22:07:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:02,635 INFO L225 Difference]: With dead ends: 219 [2023-11-06 22:07:02,635 INFO L226 Difference]: Without dead ends: 219 [2023-11-06 22:07:02,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:07:02,636 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 181 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:02,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 265 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:07:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-06 22:07:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 198. [2023-11-06 22:07:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 151 states have (on average 1.4966887417218544) internal successors, (226), 197 states have internal predecessors, (226), 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) [2023-11-06 22:07:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 226 transitions. [2023-11-06 22:07:02,642 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 226 transitions. Word has length 25 [2023-11-06 22:07:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:02,643 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 226 transitions. [2023-11-06 22:07:02,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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) [2023-11-06 22:07:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2023-11-06 22:07:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:07:02,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:02,644 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:02,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:02,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:02,856 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:07:02,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash 447243293, now seen corresponding path program 1 times [2023-11-06 22:07:02,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:07:02,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180685698] [2023-11-06 22:07:02,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:02,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:02,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:07:02,858 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:07:02,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-06 22:07:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:03,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-06 22:07:03,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:03,012 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-11-06 22:07:03,019 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-11-06 22:07:03,131 INFO L351 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-06 22:07:03,143 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:07:03,208 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:07:03,208 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 14 [2023-11-06 22:07:03,215 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2023-11-06 22:07:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:03,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:03,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:07:03,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180685698] [2023-11-06 22:07:03,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180685698] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:03,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:07:03,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2023-11-06 22:07:03,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921607395] [2023-11-06 22:07:03,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:03,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:07:03,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:07:03,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:07:03,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:07:03,534 INFO L87 Difference]: Start difference. First operand 198 states and 226 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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) [2023-11-06 22:07:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:05,115 INFO L93 Difference]: Finished difference Result 242 states and 274 transitions. [2023-11-06 22:07:05,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:07:05,116 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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 27 [2023-11-06 22:07:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:05,117 INFO L225 Difference]: With dead ends: 242 [2023-11-06 22:07:05,117 INFO L226 Difference]: Without dead ends: 242 [2023-11-06 22:07:05,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:07:05,119 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 86 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:05,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1035 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:07:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-11-06 22:07:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 207. [2023-11-06 22:07:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.46875) internal successors, (235), 206 states have internal predecessors, (235), 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) [2023-11-06 22:07:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 235 transitions. [2023-11-06 22:07:05,132 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 235 transitions. Word has length 27 [2023-11-06 22:07:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:05,133 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 235 transitions. [2023-11-06 22:07:05,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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) [2023-11-06 22:07:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 235 transitions. [2023-11-06 22:07:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 22:07:05,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:05,134 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:05,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:05,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:05,347 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:07:05,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1691592608, now seen corresponding path program 2 times [2023-11-06 22:07:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:07:05,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829590625] [2023-11-06 22:07:05,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:07:05,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:05,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:07:05,348 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:07:05,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-06 22:07:05,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:07:05,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:07:05,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 22:07:05,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:05,521 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:07:05,552 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-06 22:07:05,627 INFO L351 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-06 22:07:05,681 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:07:05,682 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 18 [2023-11-06 22:07:05,727 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-11-06 22:07:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:05,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:05,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:07:05,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829590625] [2023-11-06 22:07:05,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829590625] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:05,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:07:05,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2023-11-06 22:07:05,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140592054] [2023-11-06 22:07:05,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:05,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:07:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:07:05,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:07:05,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:07:05,915 INFO L87 Difference]: Start difference. First operand 207 states and 235 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 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) [2023-11-06 22:07:08,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:08,244 INFO L93 Difference]: Finished difference Result 341 states and 380 transitions. [2023-11-06 22:07:08,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:07:08,245 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 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 36 [2023-11-06 22:07:08,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:08,247 INFO L225 Difference]: With dead ends: 341 [2023-11-06 22:07:08,247 INFO L226 Difference]: Without dead ends: 341 [2023-11-06 22:07:08,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:07:08,249 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 283 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:08,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 659 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 22:07:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-11-06 22:07:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 243. [2023-11-06 22:07:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 196 states have (on average 1.4540816326530612) internal successors, (285), 242 states have internal predecessors, (285), 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) [2023-11-06 22:07:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 285 transitions. [2023-11-06 22:07:08,257 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 285 transitions. Word has length 36 [2023-11-06 22:07:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:08,257 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 285 transitions. [2023-11-06 22:07:08,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 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) [2023-11-06 22:07:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 285 transitions. [2023-11-06 22:07:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 22:07:08,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:08,258 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:08,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:08,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:08,471 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:07:08,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:08,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1691592609, now seen corresponding path program 1 times [2023-11-06 22:07:08,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:07:08,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795493795] [2023-11-06 22:07:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:08,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:08,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:07:08,473 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:07:08,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-06 22:07:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:08,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-06 22:07:08,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:08,766 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-11-06 22:07:08,774 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-11-06 22:07:08,925 INFO L351 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-06 22:07:08,936 INFO L351 Elim1Store]: Elim1 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 27 treesize of output 20 [2023-11-06 22:07:09,045 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:07:09,045 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 14 [2023-11-06 22:07:09,056 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2023-11-06 22:07:09,144 INFO L351 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-11-06 22:07:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:09,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:09,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:07:09,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795493795] [2023-11-06 22:07:09,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795493795] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:09,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:07:09,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2023-11-06 22:07:09,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21818157] [2023-11-06 22:07:09,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:09,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 22:07:09,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:07:09,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 22:07:09,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:07:09,791 INFO L87 Difference]: Start difference. First operand 243 states and 285 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 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) [2023-11-06 22:07:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:12,123 INFO L93 Difference]: Finished difference Result 338 states and 385 transitions. [2023-11-06 22:07:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:07:12,124 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 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 36 [2023-11-06 22:07:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:12,125 INFO L225 Difference]: With dead ends: 338 [2023-11-06 22:07:12,125 INFO L226 Difference]: Without dead ends: 338 [2023-11-06 22:07:12,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:07:12,127 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 141 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:12,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1899 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 22:07:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-11-06 22:07:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 244. [2023-11-06 22:07:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 197 states have (on average 1.4517766497461928) internal successors, (286), 243 states have internal predecessors, (286), 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) [2023-11-06 22:07:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 286 transitions. [2023-11-06 22:07:12,135 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 286 transitions. Word has length 36 [2023-11-06 22:07:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:12,135 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 286 transitions. [2023-11-06 22:07:12,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 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) [2023-11-06 22:07:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 286 transitions. [2023-11-06 22:07:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:07:12,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:12,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:12,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:12,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:12,350 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:07:12,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:12,350 INFO L85 PathProgramCache]: Analyzing trace with hash 899762317, now seen corresponding path program 1 times [2023-11-06 22:07:12,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:07:12,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977375466] [2023-11-06 22:07:12,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:12,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:12,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:07:12,351 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:07:12,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-06 22:07:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:12,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:07:12,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:07:12,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:07:12,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:07:12,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977375466] [2023-11-06 22:07:12,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977375466] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:12,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:07:12,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2023-11-06 22:07:12,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271330278] [2023-11-06 22:07:12,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:12,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:07:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:07:12,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:07:12,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:07:12,997 INFO L87 Difference]: Start difference. First operand 244 states and 286 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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) [2023-11-06 22:07:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:13,468 INFO L93 Difference]: Finished difference Result 268 states and 313 transitions. [2023-11-06 22:07:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:07:13,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 37 [2023-11-06 22:07:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:13,471 INFO L225 Difference]: With dead ends: 268 [2023-11-06 22:07:13,471 INFO L226 Difference]: Without dead ends: 268 [2023-11-06 22:07:13,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:07:13,472 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 301 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:13,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 390 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:07:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-11-06 22:07:13,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 246. [2023-11-06 22:07:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 199 states have (on average 1.4522613065326633) internal successors, (289), 245 states have internal predecessors, (289), 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) [2023-11-06 22:07:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 289 transitions. [2023-11-06 22:07:13,479 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 289 transitions. Word has length 37 [2023-11-06 22:07:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:13,479 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 289 transitions. [2023-11-06 22:07:13,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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) [2023-11-06 22:07:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 289 transitions. [2023-11-06 22:07:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:07:13,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:13,480 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:13,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:13,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:13,693 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:07:13,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2122833187, now seen corresponding path program 1 times [2023-11-06 22:07:13,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:07:13,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203840952] [2023-11-06 22:07:13,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:13,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:13,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:07:13,694 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:07:13,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-06 22:07:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:13,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:07:13,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:13,883 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:07:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 22:07:13,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:07:13,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:07:13,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203840952] [2023-11-06 22:07:13,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203840952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:13,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:13,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:07:13,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558277549] [2023-11-06 22:07:13,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:13,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:07:13,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:07:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:07:13,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:07:13,894 INFO L87 Difference]: Start difference. First operand 246 states and 289 transitions. Second operand has 3 states, 2 states have (on average 10.5) 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) [2023-11-06 22:07:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:14,175 INFO L93 Difference]: Finished difference Result 251 states and 294 transitions. [2023-11-06 22:07:14,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:07:14,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) 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 38 [2023-11-06 22:07:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:14,177 INFO L225 Difference]: With dead ends: 251 [2023-11-06 22:07:14,177 INFO L226 Difference]: Without dead ends: 251 [2023-11-06 22:07:14,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:07:14,178 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:14,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 191 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:07:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-11-06 22:07:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 246. [2023-11-06 22:07:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 201 states have (on average 1.4477611940298507) internal successors, (291), 245 states have internal predecessors, (291), 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) [2023-11-06 22:07:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 291 transitions. [2023-11-06 22:07:14,185 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 291 transitions. Word has length 38 [2023-11-06 22:07:14,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:14,185 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 291 transitions. [2023-11-06 22:07:14,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) 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) [2023-11-06 22:07:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 291 transitions. [2023-11-06 22:07:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:07:14,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:14,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:14,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:14,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:14,399 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:07:14,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2122833186, now seen corresponding path program 1 times [2023-11-06 22:07:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:07:14,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962252413] [2023-11-06 22:07:14,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:14,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:14,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:07:14,402 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:07:14,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-06 22:07:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:14,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:07:14,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:14,599 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:07:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 22:07:14,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:07:14,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:07:14,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962252413] [2023-11-06 22:07:14,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962252413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:14,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:14,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:07:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376614780] [2023-11-06 22:07:14,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:14,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:07:14,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:07:14,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:07:14,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:07:14,608 INFO L87 Difference]: Start difference. First operand 246 states and 291 transitions. Second operand has 3 states, 2 states have (on average 10.5) 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) [2023-11-06 22:07:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:14,808 INFO L93 Difference]: Finished difference Result 245 states and 289 transitions. [2023-11-06 22:07:14,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:07:14,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) 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 38 [2023-11-06 22:07:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:14,810 INFO L225 Difference]: With dead ends: 245 [2023-11-06 22:07:14,810 INFO L226 Difference]: Without dead ends: 245 [2023-11-06 22:07:14,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:07:14,811 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 5 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:14,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 203 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:07:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-11-06 22:07:14,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2023-11-06 22:07:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 201 states have (on average 1.4328358208955223) internal successors, (288), 243 states have internal predecessors, (288), 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) [2023-11-06 22:07:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 288 transitions. [2023-11-06 22:07:14,818 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 288 transitions. Word has length 38 [2023-11-06 22:07:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:14,818 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 288 transitions. [2023-11-06 22:07:14,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) 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) [2023-11-06 22:07:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 288 transitions. [2023-11-06 22:07:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:07:14,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:14,819 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:14,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:15,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:15,032 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:07:15,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:15,032 INFO L85 PathProgramCache]: Analyzing trace with hash -756843594, now seen corresponding path program 1 times [2023-11-06 22:07:15,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:07:15,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010492995] [2023-11-06 22:07:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:15,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:15,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:07:15,034 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:07:15,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-06 22:07:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:15,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:07:15,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:15,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:16,435 INFO L322 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-06 22:07:16,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2023-11-06 22:07:16,448 INFO L322 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-06 22:07:16,449 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2023-11-06 22:07:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:16,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:07:16,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010492995] [2023-11-06 22:07:16,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010492995] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:16,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:07:16,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2023-11-06 22:07:16,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238064146] [2023-11-06 22:07:16,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:16,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:07:16,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:07:16,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:07:16,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:07:16,543 INFO L87 Difference]: Start difference. First operand 244 states and 288 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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) [2023-11-06 22:07:18,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:07:20,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:07:22,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:07:24,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:07:26,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:07:28,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:07:30,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:07:32,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:07:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:34,044 INFO L93 Difference]: Finished difference Result 290 states and 341 transitions. [2023-11-06 22:07:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:07:34,045 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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 38 [2023-11-06 22:07:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:34,046 INFO L225 Difference]: With dead ends: 290 [2023-11-06 22:07:34,047 INFO L226 Difference]: Without dead ends: 290 [2023-11-06 22:07:34,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:07:34,048 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 126 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 18 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:34,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 755 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 418 Invalid, 8 Unknown, 0 Unchecked, 17.1s Time] [2023-11-06 22:07:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-11-06 22:07:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 260. [2023-11-06 22:07:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 217 states have (on average 1.4193548387096775) internal successors, (308), 259 states have internal predecessors, (308), 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) [2023-11-06 22:07:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 308 transitions. [2023-11-06 22:07:34,055 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 308 transitions. Word has length 38 [2023-11-06 22:07:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:34,055 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 308 transitions. [2023-11-06 22:07:34,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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) [2023-11-06 22:07:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 308 transitions. [2023-11-06 22:07:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:07:34,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:34,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:34,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:34,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:34,268 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:07:34,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:34,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1767960844, now seen corresponding path program 1 times [2023-11-06 22:07:34,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:07:34,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758924390] [2023-11-06 22:07:34,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:34,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:34,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:07:34,272 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:07:34,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-06 22:07:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:34,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 22:07:34,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:34,486 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:07:34,508 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:07:34,515 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:07:34,702 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:07:34,702 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-11-06 22:07:34,746 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:07:34,754 INFO L351 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-11-06 22:07:34,875 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:07:34,876 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2023-11-06 22:07:34,884 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-11-06 22:07:34,975 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:07:34,975 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2023-11-06 22:07:34,983 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-11-06 22:07:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:07:35,048 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:07:35,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:07:35,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758924390] [2023-11-06 22:07:35,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758924390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:35,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:35,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:07:35,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479103064] [2023-11-06 22:07:35,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:35,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:07:35,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:07:35,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:07:35,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:07:35,050 INFO L87 Difference]: Start difference. First operand 260 states and 308 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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) [2023-11-06 22:07:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:36,785 INFO L93 Difference]: Finished difference Result 316 states and 372 transitions. [2023-11-06 22:07:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:07:36,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2023-11-06 22:07:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:36,787 INFO L225 Difference]: With dead ends: 316 [2023-11-06 22:07:36,788 INFO L226 Difference]: Without dead ends: 316 [2023-11-06 22:07:36,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:07:36,788 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 183 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:36,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 585 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:07:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-06 22:07:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 284. [2023-11-06 22:07:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 241 states have (on average 1.3983402489626555) internal successors, (337), 283 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) [2023-11-06 22:07:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 337 transitions. [2023-11-06 22:07:36,797 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 337 transitions. Word has length 38 [2023-11-06 22:07:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:36,797 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 337 transitions. [2023-11-06 22:07:36,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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) [2023-11-06 22:07:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 337 transitions. [2023-11-06 22:07:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:07:36,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:36,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:36,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:37,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:37,010 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:07:37,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:37,011 INFO L85 PathProgramCache]: Analyzing trace with hash 734177974, now seen corresponding path program 1 times [2023-11-06 22:07:37,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:07:37,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646914804] [2023-11-06 22:07:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:37,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:07:37,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:07:37,012 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:07:37,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-11-06 22:07:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:37,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:07:37,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:37,194 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:07:37,355 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 22:07:37,356 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 27 [2023-11-06 22:07:37,435 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-06 22:07:37,582 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 22:07:37,582 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-06 22:07:37,692 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 22:07:37,692 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-06 22:07:37,873 INFO L351 Elim1Store]: Elim1 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 33 treesize of output 15 [2023-11-06 22:07:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:37,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:38,104 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_887) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-06 22:07:38,120 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_887) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-06 22:07:38,152 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_886))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_887)) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-06 22:07:38,174 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_886))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_887))) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-06 22:07:38,197 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:07:38,197 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2023-11-06 22:07:38,222 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:07:38,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 267 [2023-11-06 22:07:38,251 INFO L351 Elim1Store]: Elim1 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 207 treesize of output 191 [2023-11-06 22:07:38,273 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:07:38,273 INFO L351 Elim1Store]: Elim1 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 191 treesize of output 175 [2023-11-06 22:07:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:56,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:07:56,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646914804] [2023-11-06 22:07:56,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646914804] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:56,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:07:56,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2023-11-06 22:07:56,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572563759] [2023-11-06 22:07:56,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:56,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 22:07:56,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:07:56,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:07:56,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=261, Unknown=8, NotChecked=148, Total=506 [2023-11-06 22:07:56,769 INFO L87 Difference]: Start difference. First operand 284 states and 337 transitions. Second operand has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 23 states have internal predecessors, (75), 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) [2023-11-06 22:08:03,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:08:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:07,969 INFO L93 Difference]: Finished difference Result 456 states and 549 transitions. [2023-11-06 22:08:07,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:08:07,970 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 23 states have internal predecessors, (75), 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 38 [2023-11-06 22:08:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:07,973 INFO L225 Difference]: With dead ends: 456 [2023-11-06 22:08:07,973 INFO L226 Difference]: Without dead ends: 456 [2023-11-06 22:08:07,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=226, Invalid=535, Unknown=11, NotChecked=220, Total=992 [2023-11-06 22:08:07,974 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 717 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 65 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 2284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1331 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:07,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 671 Invalid, 2284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 887 Invalid, 1 Unknown, 1331 Unchecked, 4.6s Time] [2023-11-06 22:08:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-11-06 22:08:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 328. [2023-11-06 22:08:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 285 states have (on average 1.4175438596491228) internal successors, (404), 327 states have internal predecessors, (404), 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) [2023-11-06 22:08:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 404 transitions. [2023-11-06 22:08:07,983 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 404 transitions. Word has length 38 [2023-11-06 22:08:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:07,983 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 404 transitions. [2023-11-06 22:08:07,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 23 states have internal predecessors, (75), 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) [2023-11-06 22:08:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 404 transitions. [2023-11-06 22:08:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:08:07,985 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:07,985 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:07,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:08,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:08:08,196 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:08:08,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:08,197 INFO L85 PathProgramCache]: Analyzing trace with hash 734177975, now seen corresponding path program 1 times [2023-11-06 22:08:08,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:08:08,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849718190] [2023-11-06 22:08:08,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:08,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:08:08,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:08:08,198 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:08:08,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-06 22:08:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:08,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-06 22:08:08,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:08,380 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:08:08,579 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:08:08,580 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-11-06 22:08:08,597 INFO L351 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:08:08,649 INFO L351 Elim1Store]: Elim1 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 15 treesize of output 1 [2023-11-06 22:08:08,654 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:08:08,828 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:08:08,828 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-06 22:08:08,835 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-11-06 22:08:08,949 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:08:08,950 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-06 22:08:08,959 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-11-06 22:08:09,169 INFO L351 Elim1Store]: Elim1 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 25 treesize of output 13 [2023-11-06 22:08:09,176 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-06 22:08:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:09,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:09,754 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_930 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0)))) (forall ((v_ArrVal_930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2023-11-06 22:08:09,794 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_930) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_930 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_930) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_929) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))) is different from false [2023-11-06 22:08:09,861 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_928) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_930) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_927))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_928) .cse3 v_ArrVal_930) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_929) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))))) is different from false [2023-11-06 22:08:09,991 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (and (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_928) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_927) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_930) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_927))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_928) .cse4 v_ArrVal_930) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_929) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))))))))) is different from false [2023-11-06 22:08:10,052 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:10,052 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-06 22:08:10,069 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:10,069 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2023-11-06 22:08:10,110 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:10,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 400 treesize of output 345 [2023-11-06 22:08:10,172 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:10,173 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1008 treesize of output 953 [2023-11-06 22:08:10,191 INFO L351 Elim1Store]: Elim1 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 218 treesize of output 202 [2023-11-06 22:08:10,200 INFO L351 Elim1Store]: Elim1 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 202 treesize of output 186 [2023-11-06 22:08:10,229 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:10,230 INFO L351 Elim1Store]: Elim1 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 186 treesize of output 158 [2023-11-06 22:08:10,245 INFO L351 Elim1Store]: Elim1 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 78 treesize of output 70 [2023-11-06 22:08:20,089 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:20,090 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 78 [2023-11-06 22:08:20,109 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:20,109 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2023-11-06 22:08:20,121 INFO L351 Elim1Store]: Elim1 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 98 treesize of output 80 [2023-11-06 22:08:20,167 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:20,167 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 235 [2023-11-06 22:08:20,193 INFO L351 Elim1Store]: Elim1 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 86 treesize of output 78 [2023-11-06 22:08:20,204 INFO L351 Elim1Store]: Elim1 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 112 treesize of output 88 [2023-11-06 22:08:20,237 INFO L351 Elim1Store]: Elim1 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 62 treesize of output 54 [2023-11-06 22:08:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:20,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:08:20,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849718190] [2023-11-06 22:08:20,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849718190] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:08:20,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:08:20,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2023-11-06 22:08:20,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629449564] [2023-11-06 22:08:20,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:08:20,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 22:08:20,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:08:20,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:08:20,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=290, Unknown=4, NotChecked=148, Total=506 [2023-11-06 22:08:20,831 INFO L87 Difference]: Start difference. First operand 328 states and 404 transitions. Second operand has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 23 states have internal predecessors, (75), 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) [2023-11-06 22:08:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:26,334 INFO L93 Difference]: Finished difference Result 468 states and 554 transitions. [2023-11-06 22:08:26,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:08:26,335 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 23 states have internal predecessors, (75), 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 38 [2023-11-06 22:08:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:26,337 INFO L225 Difference]: With dead ends: 468 [2023-11-06 22:08:26,337 INFO L226 Difference]: Without dead ends: 468 [2023-11-06 22:08:26,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=230, Invalid=774, Unknown=4, NotChecked=252, Total=1260 [2023-11-06 22:08:26,338 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 608 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1378 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:26,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 882 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1186 Invalid, 0 Unknown, 1378 Unchecked, 4.3s Time] [2023-11-06 22:08:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-11-06 22:08:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 355. [2023-11-06 22:08:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 317 states have (on average 1.3722397476340693) internal successors, (435), 354 states have internal predecessors, (435), 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) [2023-11-06 22:08:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 435 transitions. [2023-11-06 22:08:26,347 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 435 transitions. Word has length 38 [2023-11-06 22:08:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:26,347 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 435 transitions. [2023-11-06 22:08:26,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 23 states have internal predecessors, (75), 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) [2023-11-06 22:08:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 435 transitions. [2023-11-06 22:08:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:08:26,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:26,348 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:26,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:26,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:08:26,560 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:08:26,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:26,561 INFO L85 PathProgramCache]: Analyzing trace with hash 733993276, now seen corresponding path program 1 times [2023-11-06 22:08:26,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:08:26,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342868167] [2023-11-06 22:08:26,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:26,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:08:26,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:08:26,563 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:08:26,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-11-06 22:08:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:26,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 22:08:26,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:26,793 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:08:26,805 INFO L351 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-06 22:08:26,808 INFO L351 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-06 22:08:27,147 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:08:27,147 INFO L351 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-11-06 22:08:27,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:08:27,209 INFO L351 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-06 22:08:27,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:08:27,240 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 22:08:27,399 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 22:08:27,400 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2023-11-06 22:08:27,417 INFO L351 Elim1Store]: Elim1 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 28 treesize of output 11 [2023-11-06 22:08:27,528 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 22:08:27,528 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2023-11-06 22:08:27,534 INFO L351 Elim1Store]: Elim1 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 28 treesize of output 11 [2023-11-06 22:08:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:27,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:27,813 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_974) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2023-11-06 22:08:27,832 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))))) (and (forall ((v_ArrVal_973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_973) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_974) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2023-11-06 22:08:27,868 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_971))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_973)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_972) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_971) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_974) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2023-11-06 22:08:27,896 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_971))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_973)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_972) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_971) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_974) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2023-11-06 22:08:27,957 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.base|)))) (and (forall ((|ULTIMATE.start_main_#t~malloc20#1.offset| (_ BitVec 32)) (v_ArrVal_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |ULTIMATE.start_main_#t~malloc20#1.offset|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_972) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_971) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_974) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_971))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_973)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2023-11-06 22:08:28,023 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_14| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_14|))) (forall ((|ULTIMATE.start_main_#t~malloc20#1.offset| (_ BitVec 32)) (v_ArrVal_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |ULTIMATE.start_main_#t~malloc20#1.offset|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_14| v_ArrVal_972) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse1 .cse0 |v_ULTIMATE.start_main_#t~malloc20#1.base_14|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_14| v_ArrVal_971) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_974) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_14| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_14|))) (forall ((v_ArrVal_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse1 .cse0 |v_ULTIMATE.start_main_#t~malloc20#1.base_14|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_14| v_ArrVal_971))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_973)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))))) is different from false [2023-11-06 22:08:31,553 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:31,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2023-11-06 22:08:31,569 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2023-11-06 22:08:31,577 INFO L351 Elim1Store]: Elim1 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 9 treesize of output 7 [2023-11-06 22:08:31,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-11-06 22:08:31,602 INFO L322 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2023-11-06 22:08:31,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 1 [2023-11-06 22:08:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:31,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:08:31,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342868167] [2023-11-06 22:08:31,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342868167] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:08:31,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:08:31,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2023-11-06 22:08:31,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566911489] [2023-11-06 22:08:31,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:08:31,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 22:08:31,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:08:31,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 22:08:31,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=346, Unknown=10, NotChecked=258, Total=702 [2023-11-06 22:08:31,613 INFO L87 Difference]: Start difference. First operand 355 states and 435 transitions. Second operand has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 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) [2023-11-06 22:08:34,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:08:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:38,434 INFO L93 Difference]: Finished difference Result 492 states and 601 transitions. [2023-11-06 22:08:38,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:08:38,437 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 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 38 [2023-11-06 22:08:38,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:38,439 INFO L225 Difference]: With dead ends: 492 [2023-11-06 22:08:38,439 INFO L226 Difference]: Without dead ends: 492 [2023-11-06 22:08:38,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=283, Invalid=853, Unknown=10, NotChecked=414, Total=1560 [2023-11-06 22:08:38,440 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 328 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 2421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1390 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:38,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1032 Invalid, 2421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 986 Invalid, 0 Unknown, 1390 Unchecked, 5.6s Time] [2023-11-06 22:08:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2023-11-06 22:08:38,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 401. [2023-11-06 22:08:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 363 states have (on average 1.3581267217630855) internal successors, (493), 400 states have internal predecessors, (493), 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) [2023-11-06 22:08:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 493 transitions. [2023-11-06 22:08:38,450 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 493 transitions. Word has length 38 [2023-11-06 22:08:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:38,450 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 493 transitions. [2023-11-06 22:08:38,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 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) [2023-11-06 22:08:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 493 transitions. [2023-11-06 22:08:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 22:08:38,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:38,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:38,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:38,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:08:38,663 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 22:08:38,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1149651364, now seen corresponding path program 1 times [2023-11-06 22:08:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:08:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236657320] [2023-11-06 22:08:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:38,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:08:38,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:08:38,665 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:08:38,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03640cea-d46d-43d2-816a-1fa66a6659e6/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-06 22:08:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:38,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-06 22:08:38,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:38,866 INFO L351 Elim1Store]: Elim1 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 7 [2023-11-06 22:08:39,005 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 22:08:39,005 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 27 [2023-11-06 22:08:39,065 INFO L351 Elim1Store]: Elim1 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 15 treesize of output 1 [2023-11-06 22:08:39,075 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:08:39,275 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:08:39,276 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-11-06 22:08:39,287 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-11-06 22:08:39,415 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:08:39,416 INFO L351 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-11-06 22:08:39,424 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-11-06 22:08:39,634 INFO L322 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2023-11-06 22:08:39,635 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 41 [2023-11-06 22:08:39,732 INFO L351 Elim1Store]: Elim1 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 35 treesize of output 19 [2023-11-06 22:08:39,738 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-06 22:08:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:40,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:40,627 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1031) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) .cse0) (_ bv1 1))) (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (or (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1030) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1031) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)))))) is different from false [2023-11-06 22:08:40,657 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (or (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1030) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1031) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)) (_ bv0 1)))) (forall ((v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1031) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) .cse1) (_ bv1 1)) (_ bv0 1))))))) is different from false [2023-11-06 22:08:40,719 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_ArrVal_1028 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1028))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1031)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) .cse0) (_ bv1 1))) (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (forall ((v_ArrVal_1028 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1029 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1028))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (or (forall ((v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) (select (select (store .cse2 .cse3 v_ArrVal_1031) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)))) (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1029) .cse3 v_ArrVal_1030) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))))) is different from false [2023-11-06 22:08:40,788 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_ArrVal_1028 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1028))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1031)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) .cse0)) (_ bv0 1))))) (forall ((v_ArrVal_1028 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1029 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1028))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (or (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1029) .cse3 v_ArrVal_1030) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) (select (select (store .cse4 .cse3 v_ArrVal_1031) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv0 1))))))))) is different from false [2023-11-06 22:08:40,832 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:40,832 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 56 [2023-11-06 22:08:40,856 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:40,857 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 258 [2023-11-06 22:08:40,874 INFO L351 Elim1Store]: Elim1 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 171 treesize of output 163 [2023-11-06 22:08:40,901 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:40,902 INFO L351 Elim1Store]: Elim1 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 163 treesize of output 151 [2023-11-06 22:08:49,123 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:49,124 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 64 [2023-11-06 22:08:49,163 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:49,164 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 238 [2023-11-06 22:08:49,179 INFO L351 Elim1Store]: Elim1 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 126 treesize of output 120 [2023-11-06 22:08:49,213 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:49,213 INFO L351 Elim1Store]: Elim1 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 112 treesize of output 108 [2023-11-06 22:08:49,232 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:49,232 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 41 [2023-11-06 22:08:49,277 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:49,277 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 149 [2023-11-06 22:08:49,293 INFO L351 Elim1Store]: Elim1 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 76 treesize of output 70 [2023-11-06 22:08:49,306 INFO L351 Elim1Store]: Elim1 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 48 treesize of output 46 [2023-11-06 22:09:12,897 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~root~0#1.base|)) (.cse8 (store |c_#valid| |c_ULTIMATE.start_main_~root~0#1.base| (_ bv1 1))) (.cse1 (store |c_#valid| |c_ULTIMATE.start_main_~n~0#1.base| (_ bv1 1)))) (let ((.cse102 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_129 (_ BitVec 32))) (let ((.cse160 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse160 v_arrayElimCell_129) (_ bv1 1))) (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse160 v_arrayElimCell_125))))))) (.cse108 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122)) (_ bv0 1))))))) (.cse111 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse159 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse159 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse159 v_arrayElimCell_122)) (_ bv0 1)))))))) (.cse54 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse158 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse158 v_arrayElimCell_122) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse158 v_arrayElimCell_120)) (_ bv0 1)))))))) (.cse4 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse157 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse157 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse157 v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) (.cse6 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse2 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv0 1)))) (.cse29 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse156 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse156 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse156 v_arrayElimCell_122)) (_ bv0 1)))))) (.cse30 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122)) (_ bv0 1))))) (.cse85 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse155 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse155 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse155 v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) (.cse119 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_127) (_ bv1 1))))) (.cse13 (not .cse9)) (.cse10 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~root~0#1.base|))))) (let ((.cse18 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv1 1)))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse22 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse154 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse154 v_arrayElimCell_127) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse154 |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv1 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse17 (or (and (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_129 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (= (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_129) (_ bv1 1)) (_ bv0 1)))) .cse13) (forall ((v_arrayElimCell_129 (_ BitVec 32))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse153 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse153 v_arrayElimCell_127) (_ bv1 1)))) (= (bvadd (select .cse153 v_arrayElimCell_129) (_ bv1 1)) (_ bv0 1)))))))) .cse10)) (.cse25 (or (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse152 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse152 v_arrayElimCell_127) (_ bv1 1)))) (= (bvadd (select .cse152 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))) .cse13)) .cse10)) (.cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse151 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse151 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse151 v_arrayElimCell_122) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse19 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_129 (_ BitVec 32))) (let ((.cse150 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse150 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse150 v_arrayElimCell_129) (_ bv1 1))) (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|))))) (.cse40 (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse149 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse149 v_arrayElimCell_127) (_ bv1 1))) (= (bvadd (select .cse149 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))))) .cse13)) (.cse42 (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))) .cse13)) (.cse41 (or (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_129 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_129) (_ bv1 1))) (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|))) (forall ((v_arrayElimCell_129 (_ BitVec 32))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse148 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse148 v_arrayElimCell_129) (_ bv1 1))) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse148 v_arrayElimCell_127) (_ bv1 1))))))))) .cse119) .cse13)) (.cse67 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_120) (_ bv1 1)))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse69 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse147 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (_ bv1 1) (select .cse147 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse147 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse68 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_124 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse146 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse146 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select .cse146 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse146 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse47 (or .cse85 .cse10)) (.cse48 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse145 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse145 v_arrayElimCell_120) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse145 v_arrayElimCell_122) (_ bv1 1)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse49 (or .cse10 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse144 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse144 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse144 v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse50 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_arrayElimCell_124 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse143 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse143 v_arrayElimCell_124) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse143 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse143 v_arrayElimCell_122) (_ bv1 1)))))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse51 (or .cse2 (and .cse29 .cse30 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse141 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse141 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse141 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse141 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse142 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (_ bv1 1) (select .cse142 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse142 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse52 (or .cse30 .cse2)) (.cse57 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse140 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse140 v_arrayElimCell_124) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse140 v_arrayElimCell_120) (_ bv1 1))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse140 v_arrayElimCell_122) (_ bv1 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse58 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_120) (_ bv1 1))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse61 (or .cse2 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse139 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse139 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse139 v_arrayElimCell_122)) (_ bv0 1))))))) (.cse53 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32))) (let ((.cse138 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse138 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse138 v_arrayElimCell_120) (_ bv1 1))))))) (.cse63 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_124 (_ BitVec 32))) (or (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse137 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse137 v_arrayElimCell_124) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse137 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse137 v_arrayElimCell_122) (_ bv1 1)))))))))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse66 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_124 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse136 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse136 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse136 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse64 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_124 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse135 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse135 v_arrayElimCell_124) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse135 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse135 v_arrayElimCell_122) (_ bv1 1)))))))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse70 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_120) (_ bv1 1))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse71 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse134 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse134 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse134 v_arrayElimCell_122) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse72 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_120) (_ bv1 1)))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse91 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_123 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (or (= v_arrayElimCell_123 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_123) (_ bv1 1)) (_ bv0 1))))) (.cse73 (or .cse29 .cse2)) (.cse65 (and .cse54 .cse4 .cse6 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse133 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse133 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse133 v_arrayElimCell_122) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse133 v_arrayElimCell_120)) (_ bv0 1))))))))) (.cse14 (forall ((v_arrayElimCell_124 (_ BitVec 32))) (or (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (= (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1))) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse55 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse132 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse132 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse132 v_arrayElimCell_122) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse132 v_arrayElimCell_120)) (_ bv0 1)))))))))) (.cse12 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse131 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse131 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse131 v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))))) (.cse56 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse130 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse130 v_arrayElimCell_122) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse130 v_arrayElimCell_120)) (_ bv0 1)))))))))) (.cse16 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse74 (or (and .cse54 .cse85 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse129 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse129 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse129 v_arrayElimCell_122) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse129 v_arrayElimCell_120)) (_ bv0 1))))))) .cse6) .cse10)) (.cse75 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_124 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse128 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse128 v_arrayElimCell_124) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse128 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse128 v_arrayElimCell_122) (_ bv1 1)))))) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse76 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse127 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse127 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse127 v_arrayElimCell_122) (_ bv1 1)))))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse77 (or .cse10 .cse6)) (.cse78 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse126 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse126 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse126 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse126 v_arrayElimCell_122) (_ bv1 1)))))))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse62 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse125 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse125 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse125 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse125 v_arrayElimCell_120) (_ bv1 1))))))) (.cse59 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse124 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse124 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse124 v_arrayElimCell_120) (_ bv1 1))))))) (.cse80 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse123 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse123 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse123 v_arrayElimCell_122) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse81 (or (and .cse108 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse121 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse121 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse121 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse121 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse122 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (_ bv1 1) (select .cse122 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse122 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) .cse111) .cse2)) (.cse82 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse120 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse120 v_arrayElimCell_120) (_ bv1 1))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse120 v_arrayElimCell_122) (_ bv1 1))))))))) (.cse83 (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122)) (_ bv0 1)))) .cse2)) (.cse20 (or .cse10 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_127) (_ bv1 1)))))) (.cse21 (or .cse2 .cse119)) (.cse36 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_129 (_ BitVec 32))) (let ((.cse118 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse118 v_arrayElimCell_125) (_ bv1 1))) (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (= (bvadd (_ bv1 1) (select .cse118 v_arrayElimCell_129)) (_ bv0 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse45 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((v_arrayElimCell_125 (_ BitVec 32)) (v_arrayElimCell_129 (_ BitVec 32))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse117 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse117 v_arrayElimCell_125) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse117 v_arrayElimCell_129)) (_ bv0 1)) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (bvadd (select .cse117 v_arrayElimCell_127) (_ bv1 1)) (_ bv0 1)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse46 (or .cse102 .cse2)) (.cse37 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_125) (_ bv1 1)))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse38 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse116 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (forall ((v_arrayElimCell_128 (_ BitVec 32))) (= (bvadd (select .cse116 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse116 v_arrayElimCell_125))))))) (.cse39 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse115 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse115 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse115 v_arrayElimCell_125))))))) (.cse43 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse114 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse114 v_arrayElimCell_127) (_ bv1 1))) (forall ((v_arrayElimCell_128 (_ BitVec 32))) (= (bvadd (select .cse114 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse114 v_arrayElimCell_125))))))) (.cse26 (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~root~0#1.offset|)) (.cse44 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse113 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse113 v_arrayElimCell_125) (_ bv1 1))) (= (bvadd (select .cse113 v_arrayElimCell_127) (_ bv1 1)) (_ bv0 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse92 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse112 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse112 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse112 v_arrayElimCell_122)) (_ bv0 1)))))) (.cse93 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (or (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse34 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (or (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|))))) (and (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse0 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse0 v_arrayElimCell_122)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) .cse2) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse3 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse3 v_arrayElimCell_122)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) .cse2) (or (and .cse4 .cse5 .cse6 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse7 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse7 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse7 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse7 v_arrayElimCell_122) (_ bv1 1))))))))) .cse9 .cse10) (or .cse10 (and (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse11 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse11 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse11 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse11 v_arrayElimCell_122) (_ bv1 1)))))))))) .cse12 (or .cse13 (and .cse14 (forall ((v_arrayElimCell_124 (_ BitVec 32))) (or (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse15 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse15 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse15 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))))) (or (and .cse5 .cse6) .cse9) .cse16)) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|))) .cse2) (or (and .cse17 .cse18 (or .cse19 .cse2) .cse20 .cse21 .cse22 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))) (forall ((v_arrayElimCell_129 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse23 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (_ bv1 1) (select .cse23 v_arrayElimCell_129)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse23 |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv1 1))) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (bvadd (select .cse23 v_arrayElimCell_127) (_ bv1 1)) (_ bv0 1)))))) (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_129 (_ BitVec 32))) (let ((.cse24 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (= (bvadd (_ bv1 1) (select .cse24 v_arrayElimCell_129)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse24 |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv1 1)))))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))))) .cse25) .cse26) (or .cse9 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse27 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse27 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse27 v_arrayElimCell_122)) (_ bv0 1))))) .cse2) (or .cse10 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse28 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse28 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse28 v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) (or .cse2 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) (or (and .cse29 .cse30 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse31 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse31 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse31 v_arrayElimCell_122)) (_ bv0 1))))))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse32 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse32 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse32 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse32 v_arrayElimCell_122)) (_ bv0 1))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) .cse2) (or (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse33 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse33 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select .cse33 v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) .cse9 .cse10) (or .cse13 .cse2 .cse34) (or .cse9 (and .cse18 .cse20 .cse21 .cse22 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse35 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse35 |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv1 1))) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (bvadd (select .cse35 v_arrayElimCell_127) (_ bv1 1)) (_ bv0 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))))))) (or (and .cse17 .cse36 .cse20 .cse21 .cse37 (or .cse2 (and .cse38 (or .cse9 .cse39) .cse40 .cse41 .cse42 .cse43)) .cse25 .cse44 .cse45 .cse46) .cse26) (or (and .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 (or .cse53 .cse2) (or .cse10 (and .cse54 .cse55 .cse12 .cse6 .cse56 .cse16)) .cse57 .cse58 (or .cse59 .cse2) (or .cse2 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32))) (let ((.cse60 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse60 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse60 v_arrayElimCell_120) (_ bv1 1))))))) .cse61 (or .cse62 .cse2) .cse63 .cse64 (or .cse10 .cse65) (or (and .cse66 .cse67 .cse68 .cse69) .cse2) .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78 (or .cse10 .cse4) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_123 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32))) (let ((.cse79 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= v_arrayElimCell_123 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse79 v_arrayElimCell_123) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse79 v_arrayElimCell_120) (_ bv1 1)))))) .cse2 .cse26) .cse80 .cse81 .cse82 .cse83) .cse9) (or .cse9 .cse2 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse84 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse84 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse84 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse84 v_arrayElimCell_122)) (_ bv0 1)))))) (or (and .cse85 .cse5 .cse6) .cse10) (or (and (forall ((v_arrayElimCell_129 (_ BitVec 32))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse86 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse86 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse86 v_arrayElimCell_129) (_ bv1 1))) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse86 v_arrayElimCell_127) (_ bv1 1))))))))) .cse19 (or .cse26 (and (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse87 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse87 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (select .cse87 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))))) .cse9) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse88 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse88 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (forall ((v_arrayElimCell_128 (_ BitVec 32))) (= (bvadd (select .cse88 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1)))))) .cse40 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse89 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse89 v_arrayElimCell_127) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse89 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (forall ((v_arrayElimCell_128 (_ BitVec 32))) (= (bvadd (select .cse89 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1)))))) .cse42)) .cse41) .cse2) (or .cse30 .cse9 .cse2) (or .cse10 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (or (and (or .cse13 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_123 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse90 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse90 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (select .cse90 v_arrayElimCell_123) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_123 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) .cse91)) (or .cse13 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_123 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (or (= v_arrayElimCell_123 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_123) (_ bv1 1)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|))))) .cse2 .cse26) (or (let ((.cse96 (or .cse93 .cse13))) (and (or (and (or .cse9 (and .cse67 .cse69)) .cse66 (or .cse92 .cse13) (or (and .cse92 .cse93 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse94 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse94 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse94 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse95 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse95 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select .cse95 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse95 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) .cse13) .cse68 .cse96) .cse2) .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse57 .cse58 .cse61 (or .cse53 .cse9 .cse2) .cse63 (or .cse2 (and .cse66 .cse96)) .cse64 .cse70 .cse71 (or .cse9 .cse10 .cse4) .cse72 (or (and (or .cse13 .cse91) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_123 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse97 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse97 v_arrayElimCell_123) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse97 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_123 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (or (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_123 (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse98 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse98 v_arrayElimCell_123) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse98 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_123 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) .cse91) .cse13)) .cse2) .cse73 (or .cse9 .cse10 .cse65) (or (and (or (and (forall ((v_arrayElimCell_124 (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse99 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse99 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select .cse99 v_arrayElimCell_120)) (_ bv0 1))))) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|))) .cse14) .cse13) .cse55 .cse12 (or (and .cse54 .cse6) .cse9) .cse56 .cse16) .cse10) .cse74 .cse75 .cse76 .cse77 .cse78 (or .cse62 .cse9 .cse2) (or .cse9 .cse59 .cse2) .cse80 .cse81 .cse82 .cse83)) .cse26) (or (and .cse20 .cse21 (or .cse26 (and (or .cse10 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_129 (_ BitVec 32))) (let ((.cse100 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select .cse100 v_arrayElimCell_127) (_ bv1 1))) (= (bvadd (select .cse100 v_arrayElimCell_129) (_ bv1 1)) (_ bv0 1)))))) .cse36 (or .cse10 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse101 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse101 v_arrayElimCell_127) (_ bv1 1))) (= (bvadd (select .cse101 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1)))))) .cse45 .cse46)) .cse37 (or (and (or (and .cse38 .cse39 .cse43) .cse26) .cse102 (forall ((v_arrayElimCell_125 (_ BitVec 32)) (v_arrayElimCell_129 (_ BitVec 32))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse103 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse103 v_arrayElimCell_129) (_ bv1 1))) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse103 v_arrayElimCell_127) (_ bv1 1)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse103 v_arrayElimCell_125))))))))) .cse2) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse104 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse104 v_arrayElimCell_125) (_ bv1 1))) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (bvadd (select .cse104 v_arrayElimCell_127) (_ bv1 1)) (_ bv0 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))))) .cse44) .cse9) (or (and (or (and .cse92 .cse93 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse105 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse105 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse105 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse105 v_arrayElimCell_122)) (_ bv0 1))))))) (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse106 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse106 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse106 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))))))) .cse13) (or .cse13 .cse34) (or (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse107 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse107 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse107 v_arrayElimCell_122)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) .cse13)) .cse2) (or .cse29 .cse9 .cse2) (or (and .cse108 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse109 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse109 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse109 v_arrayElimCell_122)) (_ bv0 1))))))))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse110 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse110 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse110 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse110 v_arrayElimCell_122)) (_ bv0 1))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) .cse111) .cse2))))) is different from true [2023-11-06 22:10:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:03,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:03,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236657320] [2023-11-06 22:10:03,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236657320] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:03,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:10:03,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-11-06 22:10:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546329133] [2023-11-06 22:10:03,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:03,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 22:10:03,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:03,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 22:10:03,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=315, Unknown=5, NotChecked=200, Total=600 [2023-11-06 22:10:03,005 INFO L87 Difference]: Start difference. First operand 401 states and 493 transitions. Second operand has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 25 states have internal predecessors, (74), 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) [2023-11-06 22:10:05,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:10:09,763 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#valid| |c_ULTIMATE.start_main_~root~0#1.base|)) (.cse9 (= |c_ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~root~0#1.base|)) (.cse8 (store |c_#valid| |c_ULTIMATE.start_main_~root~0#1.base| (_ bv1 1))) (.cse1 (store |c_#valid| |c_ULTIMATE.start_main_~n~0#1.base| (_ bv1 1)))) (let ((.cse103 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_129 (_ BitVec 32))) (let ((.cse161 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse161 v_arrayElimCell_129) (_ bv1 1))) (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse161 v_arrayElimCell_125))))))) (.cse109 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122)) (_ bv0 1))))))) (.cse112 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse160 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse160 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse160 v_arrayElimCell_122)) (_ bv0 1)))))))) (.cse55 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse159 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse159 v_arrayElimCell_122) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse159 v_arrayElimCell_120)) (_ bv0 1)))))))) (.cse4 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse158 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse158 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse158 v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) (.cse6 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse2 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv0 1)))) (.cse30 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse157 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse157 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse157 v_arrayElimCell_122)) (_ bv0 1)))))) (.cse31 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122)) (_ bv0 1))))) (.cse86 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse156 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse156 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse156 v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) (.cse120 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_127) (_ bv1 1))))) (.cse13 (not .cse9)) (.cse10 (not (= (_ bv0 1) .cse17)))) (let ((.cse19 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv1 1)))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse23 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse155 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse155 v_arrayElimCell_127) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse155 |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv1 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse18 (or (and (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_129 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (= (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_129) (_ bv1 1)) (_ bv0 1)))) .cse13) (forall ((v_arrayElimCell_129 (_ BitVec 32))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse154 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse154 v_arrayElimCell_127) (_ bv1 1)))) (= (bvadd (select .cse154 v_arrayElimCell_129) (_ bv1 1)) (_ bv0 1)))))))) .cse10)) (.cse26 (or (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse153 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse153 v_arrayElimCell_127) (_ bv1 1)))) (= (bvadd (select .cse153 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))) .cse13)) .cse10)) (.cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse152 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse152 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse152 v_arrayElimCell_122) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse20 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_129 (_ BitVec 32))) (let ((.cse151 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse151 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse151 v_arrayElimCell_129) (_ bv1 1))) (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|))))) (.cse41 (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse150 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse150 v_arrayElimCell_127) (_ bv1 1))) (= (bvadd (select .cse150 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))))) .cse13)) (.cse43 (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))) .cse13)) (.cse42 (or (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_129 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_129) (_ bv1 1))) (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|))) (forall ((v_arrayElimCell_129 (_ BitVec 32))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse149 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse149 v_arrayElimCell_129) (_ bv1 1))) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse149 v_arrayElimCell_127) (_ bv1 1))))))))) .cse120) .cse13)) (.cse68 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_120) (_ bv1 1)))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse70 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse148 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (_ bv1 1) (select .cse148 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse148 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse69 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_124 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse147 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse147 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select .cse147 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse147 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse48 (or .cse86 .cse10)) (.cse49 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse146 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse146 v_arrayElimCell_120) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse146 v_arrayElimCell_122) (_ bv1 1)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse50 (or .cse10 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse145 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse145 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse145 v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse51 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_arrayElimCell_124 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse144 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse144 v_arrayElimCell_124) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse144 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse144 v_arrayElimCell_122) (_ bv1 1)))))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse52 (or .cse2 (and .cse30 .cse31 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse142 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse142 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse142 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse142 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse143 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (_ bv1 1) (select .cse143 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse143 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse53 (or .cse31 .cse2)) (.cse58 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse141 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse141 v_arrayElimCell_124) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse141 v_arrayElimCell_120) (_ bv1 1))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse141 v_arrayElimCell_122) (_ bv1 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse59 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_120) (_ bv1 1))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse62 (or .cse2 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse140 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse140 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse140 v_arrayElimCell_122)) (_ bv0 1))))))) (.cse54 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32))) (let ((.cse139 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse139 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse139 v_arrayElimCell_120) (_ bv1 1))))))) (.cse64 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_124 (_ BitVec 32))) (or (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse138 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse138 v_arrayElimCell_124) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse138 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse138 v_arrayElimCell_122) (_ bv1 1)))))))))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse67 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_124 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse137 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse137 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse137 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse65 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_124 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse136 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse136 v_arrayElimCell_124) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse136 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse136 v_arrayElimCell_122) (_ bv1 1)))))))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse71 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_120) (_ bv1 1))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse72 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse135 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse135 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse135 v_arrayElimCell_122) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse73 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_120) (_ bv1 1)))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse92 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_123 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (or (= v_arrayElimCell_123 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_123) (_ bv1 1)) (_ bv0 1))))) (.cse74 (or .cse30 .cse2)) (.cse66 (and .cse55 .cse4 .cse6 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse134 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse134 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse134 v_arrayElimCell_122) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse134 v_arrayElimCell_120)) (_ bv0 1))))))))) (.cse14 (forall ((v_arrayElimCell_124 (_ BitVec 32))) (or (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (= (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1))) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse56 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse133 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse133 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse133 v_arrayElimCell_122) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse133 v_arrayElimCell_120)) (_ bv0 1)))))))))) (.cse12 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse132 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse132 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse132 v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))))) (.cse57 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse131 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse131 v_arrayElimCell_122) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse131 v_arrayElimCell_120)) (_ bv0 1)))))))))) (.cse16 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse75 (or (and .cse55 .cse86 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse130 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse130 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse130 v_arrayElimCell_122) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse130 v_arrayElimCell_120)) (_ bv0 1))))))) .cse6) .cse10)) (.cse76 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_124 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse129 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse129 v_arrayElimCell_124) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse129 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse129 v_arrayElimCell_122) (_ bv1 1)))))) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse77 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse128 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse128 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse128 v_arrayElimCell_122) (_ bv1 1)))))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse78 (or .cse10 .cse6)) (.cse79 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse127 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse127 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse127 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse127 v_arrayElimCell_122) (_ bv1 1)))))))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse63 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse126 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse126 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse126 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse126 v_arrayElimCell_120) (_ bv1 1))))))) (.cse60 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse125 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse125 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse125 v_arrayElimCell_120) (_ bv1 1))))))) (.cse81 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse124 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse124 v_arrayElimCell_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse124 v_arrayElimCell_122) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse82 (or (and .cse109 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse122 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse122 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse122 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse122 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse123 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (_ bv1 1) (select .cse123 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse123 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) .cse112) .cse2)) (.cse83 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse121 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse121 v_arrayElimCell_120) (_ bv1 1))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse121 v_arrayElimCell_122) (_ bv1 1))))))))) (.cse84 (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122)) (_ bv0 1)))) .cse2)) (.cse21 (or .cse10 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_127) (_ bv1 1)))))) (.cse22 (or .cse2 .cse120)) (.cse37 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_129 (_ BitVec 32))) (let ((.cse119 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse119 v_arrayElimCell_125) (_ bv1 1))) (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (= (bvadd (_ bv1 1) (select .cse119 v_arrayElimCell_129)) (_ bv0 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse46 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((v_arrayElimCell_125 (_ BitVec 32)) (v_arrayElimCell_129 (_ BitVec 32))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse118 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse118 v_arrayElimCell_125) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse118 v_arrayElimCell_129)) (_ bv0 1)) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (bvadd (select .cse118 v_arrayElimCell_127) (_ bv1 1)) (_ bv0 1)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse47 (or .cse103 .cse2)) (.cse38 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_125) (_ bv1 1)))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse39 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse117 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (forall ((v_arrayElimCell_128 (_ BitVec 32))) (= (bvadd (select .cse117 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse117 v_arrayElimCell_125))))))) (.cse40 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse116 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse116 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse116 v_arrayElimCell_125))))))) (.cse44 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse115 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse115 v_arrayElimCell_127) (_ bv1 1))) (forall ((v_arrayElimCell_128 (_ BitVec 32))) (= (bvadd (select .cse115 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse115 v_arrayElimCell_125))))))) (.cse27 (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~root~0#1.offset|)) (.cse45 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse114 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse114 v_arrayElimCell_125) (_ bv1 1))) (= (bvadd (select .cse114 v_arrayElimCell_127) (_ bv1 1)) (_ bv0 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1)))))) (.cse93 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse113 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse113 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse113 v_arrayElimCell_122)) (_ bv0 1)))))) (.cse94 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (or (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse35 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (or (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|))))) (and (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse0 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse0 v_arrayElimCell_122)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) .cse2) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse3 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse3 v_arrayElimCell_122)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) .cse2) (or (and .cse4 .cse5 .cse6 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse7 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse7 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse7 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse7 v_arrayElimCell_122) (_ bv1 1))))))))) .cse9 .cse10) (or .cse10 (and (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse11 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse11 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse11 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse11 v_arrayElimCell_122) (_ bv1 1)))))))))) .cse12 (or .cse13 (and .cse14 (forall ((v_arrayElimCell_124 (_ BitVec 32))) (or (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse15 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse15 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse15 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))))) (or (and .cse5 .cse6) .cse9) .cse16)) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|))) .cse2) (= (bvadd .cse17 (_ bv1 1)) (_ bv0 1)) (or (and .cse18 .cse19 (or .cse20 .cse2) .cse21 .cse22 .cse23 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))) (forall ((v_arrayElimCell_129 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse24 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (_ bv1 1) (select .cse24 v_arrayElimCell_129)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse24 |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv1 1))) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (bvadd (select .cse24 v_arrayElimCell_127) (_ bv1 1)) (_ bv0 1)))))) (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_129 (_ BitVec 32))) (let ((.cse25 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (= (bvadd (_ bv1 1) (select .cse25 v_arrayElimCell_129)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse25 |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv1 1)))))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_13| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))))) .cse26) .cse27) (or .cse9 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse28 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse28 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse28 v_arrayElimCell_122)) (_ bv0 1))))) .cse2) (or .cse10 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse29 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse29 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse29 v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) (or .cse2 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) (or (and .cse30 .cse31 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse32 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse32 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse32 v_arrayElimCell_122)) (_ bv0 1))))))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse33 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse33 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse33 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse33 v_arrayElimCell_122)) (_ bv0 1))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) .cse2) (or (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse34 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse34 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select .cse34 v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) .cse9 .cse10) .cse9 (or .cse13 .cse2 .cse35) (or .cse9 (and .cse19 .cse21 .cse22 .cse23 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse36 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse36 |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv1 1))) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (bvadd (select .cse36 v_arrayElimCell_127) (_ bv1 1)) (_ bv0 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))))))) (or (and .cse18 .cse37 .cse21 .cse22 .cse38 (or .cse2 (and .cse39 (or .cse9 .cse40) .cse41 .cse42 .cse43 .cse44)) .cse26 .cse45 .cse46 .cse47) .cse27) (or (and .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 (or .cse54 .cse2) (or .cse10 (and .cse55 .cse56 .cse12 .cse6 .cse57 .cse16)) .cse58 .cse59 (or .cse60 .cse2) (or .cse2 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32))) (let ((.cse61 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse61 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse61 v_arrayElimCell_120) (_ bv1 1))))))) .cse62 (or .cse63 .cse2) .cse64 .cse65 (or .cse10 .cse66) (or (and .cse67 .cse68 .cse69 .cse70) .cse2) .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78 .cse79 (or .cse10 .cse4) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_123 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_120 (_ BitVec 32))) (let ((.cse80 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= v_arrayElimCell_123 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse80 v_arrayElimCell_123) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse80 v_arrayElimCell_120) (_ bv1 1)))))) .cse2 .cse27) .cse81 .cse82 .cse83 .cse84) .cse9) (or .cse9 .cse2 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse85 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse85 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse85 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse85 v_arrayElimCell_122)) (_ bv0 1)))))) (or (and .cse86 .cse5 .cse6) .cse10) (or (and (forall ((v_arrayElimCell_129 (_ BitVec 32))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse87 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse87 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse87 v_arrayElimCell_129) (_ bv1 1))) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse87 v_arrayElimCell_127) (_ bv1 1))))))))) .cse20 (or .cse27 (and (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse88 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse88 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (select .cse88 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1))))) .cse9) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse89 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse89 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (forall ((v_arrayElimCell_128 (_ BitVec 32))) (= (bvadd (select .cse89 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1)))))) .cse41 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse90 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse90 v_arrayElimCell_127) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse90 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (forall ((v_arrayElimCell_128 (_ BitVec 32))) (= (bvadd (select .cse90 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1)))))) .cse43)) .cse42) .cse2) (or .cse31 .cse9 .cse2) (or .cse10 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_122) (_ bv1 1))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (or (and (or .cse13 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_123 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse91 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse91 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (select .cse91 v_arrayElimCell_123) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_123 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) .cse92)) (or .cse13 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_123 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (or (= v_arrayElimCell_123 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032) v_arrayElimCell_123) (_ bv1 1)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|))))) .cse2 .cse27) .cse27 (or (let ((.cse97 (or .cse94 .cse13))) (and (or (and (or .cse9 (and .cse68 .cse70)) .cse67 (or .cse93 .cse13) (or (and .cse93 .cse94 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse95 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse95 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse95 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse96 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse96 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select .cse96 v_arrayElimCell_122)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse96 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) .cse13) .cse69 .cse97) .cse2) .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse58 .cse59 .cse62 (or .cse54 .cse9 .cse2) .cse64 (or .cse2 (and .cse67 .cse97)) .cse65 .cse71 .cse72 (or .cse9 .cse10 .cse4) .cse73 (or (and (or .cse13 .cse92) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_arrayElimCell_123 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse98 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse98 v_arrayElimCell_123) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse98 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_123 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (or (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_123 (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse99 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse99 v_arrayElimCell_123) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse99 v_arrayElimCell_120) (_ bv1 1)))))) (= v_arrayElimCell_123 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) .cse92) .cse13)) .cse2) .cse74 (or .cse9 .cse10 .cse66) (or (and (or (and (forall ((v_arrayElimCell_124 (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse100 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse100 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select .cse100 v_arrayElimCell_120)) (_ bv0 1))))) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|))) .cse14) .cse13) .cse56 .cse12 (or (and .cse55 .cse6) .cse9) .cse57 .cse16) .cse10) .cse75 .cse76 .cse77 .cse78 .cse79 (or .cse63 .cse9 .cse2) (or .cse9 .cse60 .cse2) .cse81 .cse82 .cse83 .cse84)) .cse27) (or (and .cse21 .cse22 (or .cse27 (and (or .cse10 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_129 (_ BitVec 32))) (let ((.cse101 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select .cse101 v_arrayElimCell_127) (_ bv1 1))) (= (bvadd (select .cse101 v_arrayElimCell_129) (_ bv1 1)) (_ bv0 1)))))) .cse37 (or .cse10 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse102 (store .cse8 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse102 v_arrayElimCell_127) (_ bv1 1))) (= (bvadd (select .cse102 v_arrayElimCell_128) (_ bv1 1)) (_ bv0 1)))))) .cse46 .cse47)) .cse38 (or (and (or (and .cse39 .cse40 .cse44) .cse27) .cse103 (forall ((v_arrayElimCell_125 (_ BitVec 32)) (v_arrayElimCell_129 (_ BitVec 32))) (or (= v_arrayElimCell_129 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse104 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse104 v_arrayElimCell_129) (_ bv1 1))) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse104 v_arrayElimCell_127) (_ bv1 1)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse104 v_arrayElimCell_125))))))))) .cse2) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_125 (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1))) (let ((.cse105 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse105 v_arrayElimCell_125) (_ bv1 1))) (forall ((v_arrayElimCell_127 (_ BitVec 32))) (= (bvadd (select .cse105 v_arrayElimCell_127) (_ bv1 1)) (_ bv0 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_13|) (_ bv0 1))))) .cse45) .cse9) (or (and (or (and .cse93 .cse94 (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse106 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse106 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse106 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse106 v_arrayElimCell_122)) (_ bv0 1))))))) (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_124 |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse107 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse107 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse107 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))))))) .cse13) (or .cse13 .cse35) (or (forall ((v_arrayElimCell_124 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_1032 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse108 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (bvadd (select .cse108 v_arrayElimCell_124) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_124 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (_ bv1 1) (select .cse108 v_arrayElimCell_122)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) .cse13)) .cse2) (or .cse30 .cse9 .cse2) (or (and .cse109 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse110 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse110 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse110 v_arrayElimCell_122)) (_ bv0 1))))))))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_122 (_ BitVec 32))) (or (forall ((v_ArrVal_1032 (_ BitVec 1))) (let ((.cse111 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_1032))) (or (= (_ bv0 1) (bvadd (select .cse111 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse111 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse111 v_arrayElimCell_122)) (_ bv0 1))))) (= v_arrayElimCell_122 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) .cse112) .cse2))))) is different from true [2023-11-06 22:10:11,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:10:14,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:10:16,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:10:23,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]