./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/sync-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/sync-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 64bit --witnessprinter.graph.data.programhash 727341e103cd8bce499d9ef3aeff00ef12cc47b8d9139b3e1b87abd8c9cbf8f9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:39,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:39,677 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-06 21:53:39,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:39,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:39,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:39,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:39,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:39,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:39,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:39,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:39,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:39,747 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:39,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:39,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:39,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:39,750 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:53:39,751 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:53:39,751 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:53:39,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:39,752 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:53:39,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:53:39,754 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:39,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:39,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:39,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:39,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:39,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:39,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:39,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:53:39,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:53:39,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:39,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:39,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:39,761 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:39,761 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_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 727341e103cd8bce499d9ef3aeff00ef12cc47b8d9139b3e1b87abd8c9cbf8f9 [2023-11-06 21:53:40,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:40,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:40,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:40,084 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:40,084 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:40,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/busybox-1.22.0/sync-2.i [2023-11-06 21:53:43,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:43,871 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:43,872 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/sv-benchmarks/c/busybox-1.22.0/sync-2.i [2023-11-06 21:53:43,902 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/data/7dca17083/8e369306ae764276aaac825a9d9dffac/FLAGfe0d65239 [2023-11-06 21:53:43,918 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/data/7dca17083/8e369306ae764276aaac825a9d9dffac [2023-11-06 21:53:43,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:43,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:43,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:43,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:43,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:43,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:43" (1/1) ... [2023-11-06 21:53:43,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f76be68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:43, skipping insertion in model container [2023-11-06 21:53:43,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:43" (1/1) ... [2023-11-06 21:53:44,047 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:45,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:45,290 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 21:53:45,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@14f3b346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45, skipping insertion in model container [2023-11-06 21:53:45,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:45,292 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-06 21:53:45,294 INFO L158 Benchmark]: Toolchain (without parser) took 1369.48ms. Allocated memory is still 144.7MB. Free memory was 110.7MB in the beginning and 87.8MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 21:53:45,295 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 144.7MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:45,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1366.32ms. Allocated memory is still 144.7MB. Free memory was 110.5MB in the beginning and 87.8MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 21:53:45,299 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.32ms. Allocated memory is still 144.7MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1366.32ms. Allocated memory is still 144.7MB. Free memory was 110.5MB in the beginning and 87.8MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1876]: 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_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/sync-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 64bit --witnessprinter.graph.data.programhash 727341e103cd8bce499d9ef3aeff00ef12cc47b8d9139b3e1b87abd8c9cbf8f9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:48,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:48,299 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-11-06 21:53:48,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:48,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:48,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:48,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:48,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:48,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:48,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:48,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:48,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:48,379 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:48,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:48,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:48,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:48,383 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:53:48,384 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:53:48,384 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:53:48,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:48,385 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:53:48,386 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:53:48,387 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:53:48,387 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:53:48,388 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:48,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:48,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:48,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:48,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:48,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:48,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:48,392 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:53:48,393 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:53:48,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:48,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:48,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:48,394 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:53:48,395 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:48,395 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_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 727341e103cd8bce499d9ef3aeff00ef12cc47b8d9139b3e1b87abd8c9cbf8f9 [2023-11-06 21:53:48,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:48,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:48,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:48,908 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:48,909 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:48,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/busybox-1.22.0/sync-2.i [2023-11-06 21:53:52,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:52,824 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:52,825 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/sv-benchmarks/c/busybox-1.22.0/sync-2.i [2023-11-06 21:53:52,876 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/data/4655265de/023c46ce7c8e4c87bdcec303b55129cb/FLAG96b4fa0e4 [2023-11-06 21:53:52,890 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/data/4655265de/023c46ce7c8e4c87bdcec303b55129cb [2023-11-06 21:53:52,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:52,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:52,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:52,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:52,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:52,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:52" (1/1) ... [2023-11-06 21:53:52,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a17fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:52, skipping insertion in model container [2023-11-06 21:53:52,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:52" (1/1) ... [2023-11-06 21:53:52,986 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:54,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:54,611 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-06 21:53:54,645 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:54,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:54,722 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:53:54,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:54,952 WARN L672 CHandler]: The function fflush is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:53:54,959 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:53:54,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54 WrapperNode [2023-11-06 21:53:54,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:54,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:54,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:53:54,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:53:54,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54" (1/1) ... [2023-11-06 21:53:55,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54" (1/1) ... [2023-11-06 21:53:55,090 INFO L138 Inliner]: procedures = 550, calls = 128, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 389 [2023-11-06 21:53:55,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:55,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:53:55,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:53:55,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:53:55,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54" (1/1) ... [2023-11-06 21:53:55,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54" (1/1) ... [2023-11-06 21:53:55,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54" (1/1) ... [2023-11-06 21:53:55,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54" (1/1) ... [2023-11-06 21:53:55,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54" (1/1) ... [2023-11-06 21:53:55,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54" (1/1) ... [2023-11-06 21:53:55,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54" (1/1) ... [2023-11-06 21:53:55,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54" (1/1) ... [2023-11-06 21:53:55,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:53:55,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:53:55,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:53:55,199 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:53:55,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54" (1/1) ... [2023-11-06 21:53:55,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:55,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:55,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:55,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:53:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:53:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:53:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 21:53:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:53:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-11-06 21:53:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:53:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 21:53:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2023-11-06 21:53:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2023-11-06 21:53:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2023-11-06 21:53:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:53:55,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:53:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 21:53:55,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2023-11-06 21:53:55,297 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2023-11-06 21:53:55,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 21:53:55,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-06 21:53:55,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-06 21:53:55,298 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:53:55,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:53:55,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:53:55,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:53:55,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 21:53:55,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 21:53:55,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2023-11-06 21:53:55,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2023-11-06 21:53:55,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-11-06 21:53:55,920 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:53:55,922 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:53:58,529 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:53:58,550 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:53:58,554 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-06 21:53:58,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:58 BoogieIcfgContainer [2023-11-06 21:53:58,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:53:58,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:53:58,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:53:58,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:53:58,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:53:52" (1/3) ... [2023-11-06 21:53:58,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:58, skipping insertion in model container [2023-11-06 21:53:58,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:54" (2/3) ... [2023-11-06 21:53:58,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:58, skipping insertion in model container [2023-11-06 21:53:58,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:58" (3/3) ... [2023-11-06 21:53:58,568 INFO L112 eAbstractionObserver]: Analyzing ICFG sync-2.i [2023-11-06 21:53:58,585 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:53:58,585 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 117 error locations. [2023-11-06 21:53:58,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:53:58,647 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;@2af0e1cb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:53:58,648 INFO L358 AbstractCegarLoop]: Starting to check reachability of 117 error locations. [2023-11-06 21:53:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 293 states, 167 states have (on average 1.910179640718563) internal successors, (319), 284 states have internal predecessors, (319), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:53:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 21:53:58,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:58,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 21:53:58,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:53:58,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:58,669 INFO L85 PathProgramCache]: Analyzing trace with hash 62626, now seen corresponding path program 1 times [2023-11-06 21:53:58,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:53:58,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80569000] [2023-11-06 21:53:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:58,686 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 21:53:58,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:53:58,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:53:58,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:53:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:58,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 21:53:58,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:59,034 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 21:53:59,049 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 21:53:59,049 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:53:59,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:53:59,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80569000] [2023-11-06 21:53:59,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80569000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:59,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:59,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:53:59,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086493541] [2023-11-06 21:53:59,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:59,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:53:59,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:53:59,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:59,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:59,095 INFO L87 Difference]: Start difference. First operand has 293 states, 167 states have (on average 1.910179640718563) internal successors, (319), 284 states have internal predecessors, (319), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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 21:54:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:00,525 INFO L93 Difference]: Finished difference Result 427 states and 473 transitions. [2023-11-06 21:54:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:00,528 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 21:54:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:00,544 INFO L225 Difference]: With dead ends: 427 [2023-11-06 21:54:00,545 INFO L226 Difference]: Without dead ends: 425 [2023-11-06 21:54:00,547 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 21:54:00,551 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 252 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:00,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 383 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 21:54:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-11-06 21:54:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 288. [2023-11-06 21:54:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 166 states have (on average 1.8373493975903614) internal successors, (305), 279 states have internal predecessors, (305), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:54:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 317 transitions. [2023-11-06 21:54:00,631 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 317 transitions. Word has length 3 [2023-11-06 21:54:00,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:00,631 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 317 transitions. [2023-11-06 21:54:00,632 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 21:54:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 317 transitions. [2023-11-06 21:54:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 21:54:00,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:00,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 21:54:00,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:00,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:00,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:00,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash 62627, now seen corresponding path program 1 times [2023-11-06 21:54:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:00,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824863690] [2023-11-06 21:54:00,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:00,852 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 21:54:00,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:00,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:00,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:01,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:54:01,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:01,096 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 21:54:01,114 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 21:54:01,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:01,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:01,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824863690] [2023-11-06 21:54:01,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824863690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:01,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:01,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:01,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394242772] [2023-11-06 21:54:01,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:01,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:01,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:01,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:01,121 INFO L87 Difference]: Start difference. First operand 288 states and 317 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 21:54:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:02,613 INFO L93 Difference]: Finished difference Result 287 states and 316 transitions. [2023-11-06 21:54:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:02,614 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 21:54:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:02,617 INFO L225 Difference]: With dead ends: 287 [2023-11-06 21:54:02,618 INFO L226 Difference]: Without dead ends: 287 [2023-11-06 21:54:02,618 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 21:54:02,620 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 13 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:02,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 504 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 21:54:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-11-06 21:54:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2023-11-06 21:54:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 166 states have (on average 1.8313253012048192) internal successors, (304), 278 states have internal predecessors, (304), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:54:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 316 transitions. [2023-11-06 21:54:02,646 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 316 transitions. Word has length 3 [2023-11-06 21:54:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:02,646 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 316 transitions. [2023-11-06 21:54:02,647 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 21:54:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 316 transitions. [2023-11-06 21:54:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 21:54:02,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:02,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 21:54:02,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:02,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:02,857 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:02,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:02,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1865700361, now seen corresponding path program 1 times [2023-11-06 21:54:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:02,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622320752] [2023-11-06 21:54:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:02,863 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 21:54:02,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:02,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:02,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:54:03,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:03,080 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 21:54:03,164 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 21:54:03,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:03,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:03,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622320752] [2023-11-06 21:54:03,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622320752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:03,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:03,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:03,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103615102] [2023-11-06 21:54:03,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:03,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:54:03,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:03,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:54:03,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:03,168 INFO L87 Difference]: Start difference. First operand 287 states and 316 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 21:54:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:04,576 INFO L93 Difference]: Finished difference Result 291 states and 320 transitions. [2023-11-06 21:54:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:54:04,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2023-11-06 21:54:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:04,580 INFO L225 Difference]: With dead ends: 291 [2023-11-06 21:54:04,580 INFO L226 Difference]: Without dead ends: 291 [2023-11-06 21:54:04,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:04,582 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 16 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:04,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 505 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 21:54:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-11-06 21:54:04,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2023-11-06 21:54:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 168 states have (on average 1.8214285714285714) internal successors, (306), 280 states have internal predecessors, (306), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:54:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 318 transitions. [2023-11-06 21:54:04,604 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 318 transitions. Word has length 6 [2023-11-06 21:54:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:04,604 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 318 transitions. [2023-11-06 21:54:04,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 21:54:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 318 transitions. [2023-11-06 21:54:04,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 21:54:04,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:04,606 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:04,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:04,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:04,821 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:04,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:04,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1432679500, now seen corresponding path program 1 times [2023-11-06 21:54:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:04,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854063666] [2023-11-06 21:54:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:04,823 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 21:54:04,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:04,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:04,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:05,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:54:05,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:05,057 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 21:54:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:05,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:06,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:06,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854063666] [2023-11-06 21:54:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854063666] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:54:06,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:54:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-11-06 21:54:06,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868497939] [2023-11-06 21:54:06,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:54:06,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:54:06,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:06,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:54:06,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:54:06,244 INFO L87 Difference]: Start difference. First operand 289 states and 318 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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 21:54:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:13,514 INFO L93 Difference]: Finished difference Result 295 states and 324 transitions. [2023-11-06 21:54:13,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:13,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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 21:54:13,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:13,520 INFO L225 Difference]: With dead ends: 295 [2023-11-06 21:54:13,520 INFO L226 Difference]: Without dead ends: 295 [2023-11-06 21:54:13,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:54:13,523 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 33 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:13,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1095 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-11-06 21:54:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-11-06 21:54:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2023-11-06 21:54:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 175 states have (on average 1.782857142857143) internal successors, (312), 286 states have internal predecessors, (312), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:54:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 324 transitions. [2023-11-06 21:54:13,542 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 324 transitions. Word has length 10 [2023-11-06 21:54:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:13,542 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 324 transitions. [2023-11-06 21:54:13,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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 21:54:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 324 transitions. [2023-11-06 21:54:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 21:54:13,544 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:13,544 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:13,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:13,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:13,757 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:13,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash 779983744, now seen corresponding path program 1 times [2023-11-06 21:54:13,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:13,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674548033] [2023-11-06 21:54:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:13,759 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 21:54:13,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:13,762 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:13,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:14,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:54:14,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:14,138 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:14,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:14,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674548033] [2023-11-06 21:54:14,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674548033] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:54:14,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:54:14,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-06 21:54:14,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520100604] [2023-11-06 21:54:14,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:54:14,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:54:14,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:14,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:54:14,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:54:14,306 INFO L87 Difference]: Start difference. First operand 295 states and 324 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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 21:54:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:14,742 INFO L93 Difference]: Finished difference Result 315 states and 344 transitions. [2023-11-06 21:54:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:54:14,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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 21:54:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:14,746 INFO L225 Difference]: With dead ends: 315 [2023-11-06 21:54:14,746 INFO L226 Difference]: Without dead ends: 315 [2023-11-06 21:54:14,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:54:14,751 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 18 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:14,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1558 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:54:14,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-06 21:54:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2023-11-06 21:54:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 195 states have (on average 1.7025641025641025) internal successors, (332), 306 states have internal predecessors, (332), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:54:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 344 transitions. [2023-11-06 21:54:14,771 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 344 transitions. Word has length 19 [2023-11-06 21:54:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:14,772 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 344 transitions. [2023-11-06 21:54:14,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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 21:54:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 344 transitions. [2023-11-06 21:54:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 21:54:14,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:14,775 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:14,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:14,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:14,991 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:14,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:14,992 INFO L85 PathProgramCache]: Analyzing trace with hash -234229359, now seen corresponding path program 2 times [2023-11-06 21:54:14,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:14,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169778424] [2023-11-06 21:54:14,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:54:14,993 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 21:54:14,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:14,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:15,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:15,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 21:54:15,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:54:15,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:54:15,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:15,317 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 21:54:15,318 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 14 treesize of output 20 [2023-11-06 21:54:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 21:54:15,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:15,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169778424] [2023-11-06 21:54:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169778424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:15,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:15,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:54:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180373476] [2023-11-06 21:54:15,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:15,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:15,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:15,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:15,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:15,765 INFO L87 Difference]: Start difference. First operand 315 states and 344 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 21:54:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:16,994 INFO L93 Difference]: Finished difference Result 471 states and 516 transitions. [2023-11-06 21:54:16,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:16,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 39 [2023-11-06 21:54:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:17,002 INFO L225 Difference]: With dead ends: 471 [2023-11-06 21:54:17,002 INFO L226 Difference]: Without dead ends: 471 [2023-11-06 21:54:17,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:17,003 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 272 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:17,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 346 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 21:54:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2023-11-06 21:54:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 385. [2023-11-06 21:54:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 260 states have (on average 1.75) internal successors, (455), 370 states have internal predecessors, (455), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:54:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 475 transitions. [2023-11-06 21:54:17,026 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 475 transitions. Word has length 39 [2023-11-06 21:54:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:17,027 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 475 transitions. [2023-11-06 21:54:17,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 21:54:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 475 transitions. [2023-11-06 21:54:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 21:54:17,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:17,031 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:17,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:17,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:17,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:17,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash -234229358, now seen corresponding path program 1 times [2023-11-06 21:54:17,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:17,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34821912] [2023-11-06 21:54:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:17,247 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 21:54:17,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:17,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:17,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:17,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:54:17,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:17,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:18,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:18,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34821912] [2023-11-06 21:54:18,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34821912] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:54:18,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:54:18,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-06 21:54:18,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540126893] [2023-11-06 21:54:18,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:54:18,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 21:54:18,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:18,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 21:54:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-06 21:54:18,357 INFO L87 Difference]: Start difference. First operand 385 states and 475 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 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 21:54:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:19,324 INFO L93 Difference]: Finished difference Result 393 states and 483 transitions. [2023-11-06 21:54:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 21:54:19,326 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 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 39 [2023-11-06 21:54:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:19,330 INFO L225 Difference]: With dead ends: 393 [2023-11-06 21:54:19,330 INFO L226 Difference]: Without dead ends: 393 [2023-11-06 21:54:19,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-06 21:54:19,332 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 9 mSDsluCounter, 4057 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4376 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:19,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4376 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 21:54:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2023-11-06 21:54:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2023-11-06 21:54:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 268 states have (on average 1.7276119402985075) internal successors, (463), 378 states have internal predecessors, (463), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:54:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 483 transitions. [2023-11-06 21:54:19,361 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 483 transitions. Word has length 39 [2023-11-06 21:54:19,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:19,362 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 483 transitions. [2023-11-06 21:54:19,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 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 21:54:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 483 transitions. [2023-11-06 21:54:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 21:54:19,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:19,368 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:19,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:19,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:19,589 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:19,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:19,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1106246836, now seen corresponding path program 2 times [2023-11-06 21:54:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:19,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557271195] [2023-11-06 21:54:19,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:54:19,592 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 21:54:19,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:19,594 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:19,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:19,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 21:54:19,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:54:19,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:54:19,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:19,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:19,977 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 21:54:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 21:54:20,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:20,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:20,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557271195] [2023-11-06 21:54:20,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557271195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:20,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:20,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:20,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612586572] [2023-11-06 21:54:20,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:20,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:54:20,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:20,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:54:20,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:20,652 INFO L87 Difference]: Start difference. First operand 393 states and 483 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 21:54:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:23,253 INFO L93 Difference]: Finished difference Result 520 states and 565 transitions. [2023-11-06 21:54:23,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:54:23,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 47 [2023-11-06 21:54:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:23,264 INFO L225 Difference]: With dead ends: 520 [2023-11-06 21:54:23,264 INFO L226 Difference]: Without dead ends: 520 [2023-11-06 21:54:23,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:23,265 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 326 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:23,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 404 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-06 21:54:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2023-11-06 21:54:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 392. [2023-11-06 21:54:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 268 states have (on average 1.7238805970149254) internal successors, (462), 377 states have internal predecessors, (462), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:54:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 482 transitions. [2023-11-06 21:54:23,291 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 482 transitions. Word has length 47 [2023-11-06 21:54:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:23,292 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 482 transitions. [2023-11-06 21:54:23,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 21:54:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 482 transitions. [2023-11-06 21:54:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 21:54:23,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:23,296 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:23,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:23,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:23,512 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:23,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash -570417174, now seen corresponding path program 1 times [2023-11-06 21:54:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731649778] [2023-11-06 21:54:23,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:23,514 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 21:54:23,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:23,515 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:23,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:54:24,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:24,157 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 21:54:24,157 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-06 21:54:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 21:54:24,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:24,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:24,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731649778] [2023-11-06 21:54:24,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731649778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:24,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:24,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002869813] [2023-11-06 21:54:24,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:24,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:24,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:24,199 INFO L87 Difference]: Start difference. First operand 392 states and 482 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:54:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:26,407 INFO L93 Difference]: Finished difference Result 467 states and 518 transitions. [2023-11-06 21:54:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:26,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2023-11-06 21:54:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:26,411 INFO L225 Difference]: With dead ends: 467 [2023-11-06 21:54:26,411 INFO L226 Difference]: Without dead ends: 467 [2023-11-06 21:54:26,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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 21:54:26,412 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 233 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:26,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 354 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-06 21:54:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-11-06 21:54:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 387. [2023-11-06 21:54:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 268 states have (on average 1.705223880597015) internal successors, (457), 372 states have internal predecessors, (457), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:54:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 477 transitions. [2023-11-06 21:54:26,428 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 477 transitions. Word has length 55 [2023-11-06 21:54:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:26,428 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 477 transitions. [2023-11-06 21:54:26,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:54:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 477 transitions. [2023-11-06 21:54:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 21:54:26,430 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:26,430 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:26,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:26,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:26,651 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:26,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:26,651 INFO L85 PathProgramCache]: Analyzing trace with hash -570417173, now seen corresponding path program 1 times [2023-11-06 21:54:26,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:26,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213110811] [2023-11-06 21:54:26,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:26,652 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 21:54:26,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:26,653 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:26,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:27,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:54:27,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:27,464 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 21:54:27,464 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 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-06 21:54:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 21:54:27,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:27,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:27,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213110811] [2023-11-06 21:54:27,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213110811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:27,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:27,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:54:27,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696280347] [2023-11-06 21:54:27,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:27,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:27,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:27,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:27,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:27,585 INFO L87 Difference]: Start difference. First operand 387 states and 477 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:54:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:30,571 INFO L93 Difference]: Finished difference Result 427 states and 519 transitions. [2023-11-06 21:54:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:54:30,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2023-11-06 21:54:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:30,577 INFO L225 Difference]: With dead ends: 427 [2023-11-06 21:54:30,577 INFO L226 Difference]: Without dead ends: 427 [2023-11-06 21:54:30,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:30,579 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 351 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:30,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1044 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-06 21:54:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-11-06 21:54:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 405. [2023-11-06 21:54:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 287 states have (on average 1.7003484320557491) internal successors, (488), 390 states have internal predecessors, (488), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:54:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 508 transitions. [2023-11-06 21:54:30,595 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 508 transitions. Word has length 55 [2023-11-06 21:54:30,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:30,596 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 508 transitions. [2023-11-06 21:54:30,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:54:30,597 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 508 transitions. [2023-11-06 21:54:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 21:54:30,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:30,598 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:30,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:30,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:30,814 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:30,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1887596637, now seen corresponding path program 1 times [2023-11-06 21:54:30,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:30,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080420562] [2023-11-06 21:54:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:30,816 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 21:54:30,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:30,817 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:30,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 21:54:31,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:31,595 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 21:54:31,595 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 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-06 21:54:32,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:32,213 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-06 21:54:32,213 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 29 treesize of output 31 [2023-11-06 21:54:32,255 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:54:32,256 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 21:54:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 21:54:32,482 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:32,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:32,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080420562] [2023-11-06 21:54:32,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080420562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:32,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:32,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:54:32,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080834368] [2023-11-06 21:54:32,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:32,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:54:32,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:32,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:54:32,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:54:32,484 INFO L87 Difference]: Start difference. First operand 405 states and 508 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:54:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:44,388 INFO L93 Difference]: Finished difference Result 530 states and 582 transitions. [2023-11-06 21:54:44,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:54:44,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2023-11-06 21:54:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:44,394 INFO L225 Difference]: With dead ends: 530 [2023-11-06 21:54:44,394 INFO L226 Difference]: Without dead ends: 530 [2023-11-06 21:54:44,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:54:44,395 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 990 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:44,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 963 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2023-11-06 21:54:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2023-11-06 21:54:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 431. [2023-11-06 21:54:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 313 states have (on average 1.6869009584664536) internal successors, (528), 416 states have internal predecessors, (528), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:54:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 548 transitions. [2023-11-06 21:54:44,413 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 548 transitions. Word has length 58 [2023-11-06 21:54:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:44,414 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 548 transitions. [2023-11-06 21:54:44,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:54:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 548 transitions. [2023-11-06 21:54:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 21:54:44,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:44,416 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:44,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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)] Ended with exit code 0 [2023-11-06 21:54:44,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:44,629 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:44,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:44,630 INFO L85 PathProgramCache]: Analyzing trace with hash -615374760, now seen corresponding path program 1 times [2023-11-06 21:54:44,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:44,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895841075] [2023-11-06 21:54:44,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:44,631 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 21:54:44,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:44,634 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:44,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:45,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:54:45,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:45,331 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 11 treesize of output 7 [2023-11-06 21:54:45,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:45,342 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 1 [2023-11-06 21:54:45,384 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 21:54:45,385 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 14 treesize of output 20 [2023-11-06 21:54:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 21:54:45,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:45,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895841075] [2023-11-06 21:54:45,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895841075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:45,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:45,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:45,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666274295] [2023-11-06 21:54:45,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:45,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:45,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:45,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:45,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:45,424 INFO L87 Difference]: Start difference. First operand 431 states and 548 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:54:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:46,564 INFO L93 Difference]: Finished difference Result 491 states and 559 transitions. [2023-11-06 21:54:46,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:46,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2023-11-06 21:54:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:46,568 INFO L225 Difference]: With dead ends: 491 [2023-11-06 21:54:46,569 INFO L226 Difference]: Without dead ends: 491 [2023-11-06 21:54:46,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 1 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 21:54:46,569 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 224 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:46,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 352 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 21:54:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-11-06 21:54:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 439. [2023-11-06 21:54:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 322 states have (on average 1.673913043478261) internal successors, (539), 424 states have internal predecessors, (539), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:54:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 559 transitions. [2023-11-06 21:54:46,585 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 559 transitions. Word has length 61 [2023-11-06 21:54:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:46,586 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 559 transitions. [2023-11-06 21:54:46,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:54:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 559 transitions. [2023-11-06 21:54:46,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 21:54:46,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:46,588 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:46,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:46,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:46,813 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:46,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:46,813 INFO L85 PathProgramCache]: Analyzing trace with hash -615374759, now seen corresponding path program 1 times [2023-11-06 21:54:46,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:46,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186752935] [2023-11-06 21:54:46,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:46,814 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 21:54:46,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:46,815 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:46,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 21:54:47,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:47,557 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 11 treesize of output 10 [2023-11-06 21:54:47,583 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 21:54:47,599 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 16 treesize of output 10 [2023-11-06 21:54:47,628 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 11 treesize of output 7 [2023-11-06 21:54:47,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:47,980 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-06 21:54:48,018 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:54:48,018 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 21:54:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 21:54:48,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:48,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:48,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186752935] [2023-11-06 21:54:48,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186752935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:48,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:48,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:54:48,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926290752] [2023-11-06 21:54:48,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:48,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:54:48,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:48,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:54:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:54:48,280 INFO L87 Difference]: Start difference. First operand 439 states and 559 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:54:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:56,820 INFO L93 Difference]: Finished difference Result 502 states and 565 transitions. [2023-11-06 21:54:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2023-11-06 21:54:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:56,825 INFO L225 Difference]: With dead ends: 502 [2023-11-06 21:54:56,826 INFO L226 Difference]: Without dead ends: 502 [2023-11-06 21:54:56,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:54:56,827 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 677 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:56,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 779 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-11-06 21:54:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-11-06 21:54:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 439. [2023-11-06 21:54:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 322 states have (on average 1.6677018633540373) internal successors, (537), 424 states have internal predecessors, (537), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:54:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 557 transitions. [2023-11-06 21:54:56,844 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 557 transitions. Word has length 61 [2023-11-06 21:54:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:56,845 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 557 transitions. [2023-11-06 21:54:56,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:54:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 557 transitions. [2023-11-06 21:54:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 21:54:56,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:56,846 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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 21:54:56,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:57,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:57,062 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:54:57,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:57,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1709000189, now seen corresponding path program 1 times [2023-11-06 21:54:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:57,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808803087] [2023-11-06 21:54:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:57,064 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 21:54:57,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:57,065 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:57,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:54:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:57,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 21:54:57,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:57,880 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 21:54:57,920 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 21 treesize of output 1 [2023-11-06 21:54:58,152 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 21:54:58,152 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 1 case distinctions, treesize of input 36 treesize of output 28 [2023-11-06 21:54:58,277 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 21:54:58,278 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 42 treesize of output 14 [2023-11-06 21:54:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 21:54:58,311 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:58,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:58,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808803087] [2023-11-06 21:54:58,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808803087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:58,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:58,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:54:58,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267732426] [2023-11-06 21:54:58,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:58,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:54:58,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:54:58,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:54:58,314 INFO L87 Difference]: Start difference. First operand 439 states and 557 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:55:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:02,934 INFO L93 Difference]: Finished difference Result 436 states and 552 transitions. [2023-11-06 21:55:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:55:02,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2023-11-06 21:55:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:02,938 INFO L225 Difference]: With dead ends: 436 [2023-11-06 21:55:02,938 INFO L226 Difference]: Without dead ends: 436 [2023-11-06 21:55:02,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:55:02,939 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 256 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:02,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1010 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-06 21:55:02,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-11-06 21:55:02,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 406. [2023-11-06 21:55:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 292 states have (on average 1.654109589041096) internal successors, (483), 391 states have internal predecessors, (483), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:55:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 503 transitions. [2023-11-06 21:55:02,956 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 503 transitions. Word has length 64 [2023-11-06 21:55:02,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:02,956 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 503 transitions. [2023-11-06 21:55:02,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:55:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 503 transitions. [2023-11-06 21:55:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 21:55:02,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:02,958 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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 21:55:02,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:03,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:03,173 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:55:03,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1709000188, now seen corresponding path program 1 times [2023-11-06 21:55:03,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:55:03,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965803595] [2023-11-06 21:55:03,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:03,175 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 21:55:03,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:55:03,178 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:03,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:03,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 21:55:03,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:03,911 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 10 treesize of output 8 [2023-11-06 21:55:03,939 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 21:55:04,024 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 16 treesize of output 12 [2023-11-06 21:55:04,054 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 25 treesize of output 1 [2023-11-06 21:55:04,188 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 18 [2023-11-06 21:55:04,196 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 16 [2023-11-06 21:55:04,290 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 27 treesize of output 9 [2023-11-06 21:55:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 21:55:04,336 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:55:04,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:55:04,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965803595] [2023-11-06 21:55:04,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965803595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:04,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:04,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:55:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213831829] [2023-11-06 21:55:04,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:04,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:55:04,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:55:04,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:55:04,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:55:04,338 INFO L87 Difference]: Start difference. First operand 406 states and 503 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:55:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:08,986 INFO L93 Difference]: Finished difference Result 405 states and 501 transitions. [2023-11-06 21:55:08,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:55:08,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2023-11-06 21:55:08,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:08,991 INFO L225 Difference]: With dead ends: 405 [2023-11-06 21:55:08,992 INFO L226 Difference]: Without dead ends: 405 [2023-11-06 21:55:08,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:55:08,993 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 260 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:08,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 991 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-06 21:55:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-11-06 21:55:09,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2023-11-06 21:55:09,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 292 states have (on average 1.6472602739726028) internal successors, (481), 390 states have internal predecessors, (481), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:55:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 501 transitions. [2023-11-06 21:55:09,008 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 501 transitions. Word has length 64 [2023-11-06 21:55:09,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:09,008 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 501 transitions. [2023-11-06 21:55:09,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:55:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 501 transitions. [2023-11-06 21:55:09,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 21:55:09,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:09,010 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 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 21:55:09,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:55:09,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:09,235 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:55:09,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash -650561890, now seen corresponding path program 1 times [2023-11-06 21:55:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:55:09,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497040498] [2023-11-06 21:55:09,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:09,237 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 21:55:09,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:55:09,238 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:09,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 21:55:10,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:10,067 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 10 treesize of output 8 [2023-11-06 21:55:10,184 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 21:55:10,184 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 19 treesize of output 27 [2023-11-06 21:55:10,279 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 21:55:10,446 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 38 treesize of output 31 [2023-11-06 21:55:10,682 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:55:10,683 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 56 treesize of output 55 [2023-11-06 21:55:10,778 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 42 treesize of output 15 [2023-11-06 21:55:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 21:55:10,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:55:10,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:55:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497040498] [2023-11-06 21:55:10,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497040498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:10,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:10,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:55:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834442208] [2023-11-06 21:55:10,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:10,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:55:10,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:55:10,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:55:10,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:55:10,918 INFO L87 Difference]: Start difference. First operand 405 states and 501 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:55:17,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:17,441 INFO L93 Difference]: Finished difference Result 491 states and 548 transitions. [2023-11-06 21:55:17,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:55:17,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2023-11-06 21:55:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:17,445 INFO L225 Difference]: With dead ends: 491 [2023-11-06 21:55:17,446 INFO L226 Difference]: Without dead ends: 491 [2023-11-06 21:55:17,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:55:17,447 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 407 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:17,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1039 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-11-06 21:55:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-11-06 21:55:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 416. [2023-11-06 21:55:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 303 states have (on average 1.6435643564356435) internal successors, (498), 401 states have internal predecessors, (498), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:55:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 518 transitions. [2023-11-06 21:55:17,462 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 518 transitions. Word has length 69 [2023-11-06 21:55:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:17,462 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 518 transitions. [2023-11-06 21:55:17,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:55:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 518 transitions. [2023-11-06 21:55:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 21:55:17,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:17,464 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 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 21:55:17,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:17,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:17,690 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:55:17,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:17,691 INFO L85 PathProgramCache]: Analyzing trace with hash -650561889, now seen corresponding path program 1 times [2023-11-06 21:55:17,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:55:17,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864307615] [2023-11-06 21:55:17,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:17,692 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 21:55:17,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:55:17,693 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:17,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 21:55:18,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:18,491 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 10 treesize of output 8 [2023-11-06 21:55:18,564 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:55:18,565 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 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 21:55:18,578 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 21:55:18,663 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 16 treesize of output 12 [2023-11-06 21:55:18,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 21:55:18,895 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 36 treesize of output 29 [2023-11-06 21:55:18,902 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 16 [2023-11-06 21:55:19,214 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:55:19,214 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 80 treesize of output 75 [2023-11-06 21:55:19,230 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 39 treesize of output 16 [2023-11-06 21:55:19,454 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 40 treesize of output 13 [2023-11-06 21:55:19,468 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 12 treesize of output 3 [2023-11-06 21:55:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 21:55:19,545 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:55:19,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:55:19,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864307615] [2023-11-06 21:55:19,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864307615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:19,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:19,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 21:55:19,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887254519] [2023-11-06 21:55:19,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:19,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:55:19,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:55:19,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:55:19,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:55:19,548 INFO L87 Difference]: Start difference. First operand 416 states and 518 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:55:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:27,859 INFO L93 Difference]: Finished difference Result 488 states and 542 transitions. [2023-11-06 21:55:27,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:55:27,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2023-11-06 21:55:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:27,864 INFO L225 Difference]: With dead ends: 488 [2023-11-06 21:55:27,864 INFO L226 Difference]: Without dead ends: 488 [2023-11-06 21:55:27,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-06 21:55:27,865 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 420 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:27,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1114 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-11-06 21:55:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-11-06 21:55:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 416. [2023-11-06 21:55:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 303 states have (on average 1.6303630363036303) internal successors, (494), 401 states have internal predecessors, (494), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:55:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 514 transitions. [2023-11-06 21:55:27,880 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 514 transitions. Word has length 69 [2023-11-06 21:55:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:27,880 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 514 transitions. [2023-11-06 21:55:27,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:55:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 514 transitions. [2023-11-06 21:55:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-06 21:55:27,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:27,882 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2023-11-06 21:55:27,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:28,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:28,108 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:55:28,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:28,109 INFO L85 PathProgramCache]: Analyzing trace with hash 209121026, now seen corresponding path program 1 times [2023-11-06 21:55:28,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:55:28,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773776982] [2023-11-06 21:55:28,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:28,110 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 21:55:28,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:55:28,111 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:28,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 21:55:28,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:29,041 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:55:29,041 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 21:55:29,099 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 21 treesize of output 1 [2023-11-06 21:55:29,326 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 21:55:29,326 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 1 case distinctions, treesize of input 33 treesize of output 25 [2023-11-06 21:55:29,694 INFO L322 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2023-11-06 21:55:29,694 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 69 [2023-11-06 21:55:29,721 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 15 treesize of output 10 [2023-11-06 21:55:30,057 INFO L322 Elim1Store]: treesize reduction 22, result has 18.5 percent of original size [2023-11-06 21:55:30,058 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 47 [2023-11-06 21:55:30,131 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 36 treesize of output 15 [2023-11-06 21:55:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-11-06 21:55:30,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:55:32,504 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1329) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2023-11-06 21:55:32,584 INFO L322 Elim1Store]: treesize reduction 7, result has 81.1 percent of original size [2023-11-06 21:55:32,584 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 43 treesize of output 42 [2023-11-06 21:55:32,612 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64)))) (= (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem151#1.base| v_ArrVal_1328))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1329)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem151#1.base|)) is different from false [2023-11-06 21:55:32,642 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1328))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1329)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2)))) is different from false [2023-11-06 21:55:33,081 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (|ULTIMATE.start_main_~mem_track~0#1.base| (_ BitVec 64))) (let ((.cse4 (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)))) (let ((.cse2 (bvadd .cse4 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~mem_track~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~mem_track~0#1.base|) (bvadd |c_ULTIMATE.start_main_~mem_track~0#1.offset| .cse4) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_1328))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1329)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2023-11-06 21:55:35,504 INFO L322 Elim1Store]: treesize reduction 30, result has 47.4 percent of original size [2023-11-06 21:55:35,504 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 2 case distinctions, treesize of input 108 treesize of output 57 [2023-11-06 21:55:35,523 INFO L322 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-06 21:55:35,523 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 354 treesize of output 264 [2023-11-06 21:55:35,548 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 50 [2023-11-06 21:55:35,553 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 50 treesize of output 36 [2023-11-06 21:55:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2023-11-06 21:55:35,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:55:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773776982] [2023-11-06 21:55:35,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773776982] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:55:35,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:55:35,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-06 21:55:35,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108178216] [2023-11-06 21:55:35,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:55:35,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 21:55:35,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:55:35,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 21:55:35,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=217, Unknown=14, NotChecked=132, Total=420 [2023-11-06 21:55:35,772 INFO L87 Difference]: Start difference. First operand 416 states and 514 transitions. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:55:47,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:47,897 INFO L93 Difference]: Finished difference Result 483 states and 538 transitions. [2023-11-06 21:55:47,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 21:55:47,899 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2023-11-06 21:55:47,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:47,901 INFO L225 Difference]: With dead ends: 483 [2023-11-06 21:55:47,902 INFO L226 Difference]: Without dead ends: 483 [2023-11-06 21:55:47,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=138, Invalid=464, Unknown=14, NotChecked=196, Total=812 [2023-11-06 21:55:47,903 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 422 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1664 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:47,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1942 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1152 Invalid, 0 Unknown, 1664 Unchecked, 10.4s Time] [2023-11-06 21:55:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-11-06 21:55:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 415. [2023-11-06 21:55:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 303 states have (on average 1.6237623762376239) internal successors, (492), 400 states have internal predecessors, (492), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:55:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 512 transitions. [2023-11-06 21:55:47,918 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 512 transitions. Word has length 75 [2023-11-06 21:55:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:47,918 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 512 transitions. [2023-11-06 21:55:47,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:55:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 512 transitions. [2023-11-06 21:55:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-06 21:55:47,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:47,920 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2023-11-06 21:55:47,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:48,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:48,133 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:55:48,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:48,133 INFO L85 PathProgramCache]: Analyzing trace with hash 209121027, now seen corresponding path program 1 times [2023-11-06 21:55:48,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:55:48,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530028838] [2023-11-06 21:55:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:48,134 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 21:55:48,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:55:48,136 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:48,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:55:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 21:55:49,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:49,100 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 10 treesize of output 8 [2023-11-06 21:55:49,195 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:55:49,195 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 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 21:55:49,215 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 21:55:49,315 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 21:55:49,338 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 16 treesize of output 12 [2023-11-06 21:55:49,545 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 36 treesize of output 29 [2023-11-06 21:55:49,554 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 16 [2023-11-06 21:55:49,904 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:55:49,904 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 80 treesize of output 75 [2023-11-06 21:55:49,920 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 39 treesize of output 16 [2023-11-06 21:55:50,424 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:55:50,425 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 80 treesize of output 75 [2023-11-06 21:55:50,456 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 39 treesize of output 16 [2023-11-06 21:55:50,722 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 40 treesize of output 13 [2023-11-06 21:55:50,752 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 12 treesize of output 3 [2023-11-06 21:55:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-11-06 21:55:50,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:55:52,554 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1460 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem153#1.base| v_ArrVal_1460) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem153#1.base| v_ArrVal_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1460 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem153#1.base| v_ArrVal_1460) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (bvule (bvadd .cse2 .cse1) (bvadd (_ bv1 64) .cse2 .cse1)))))) is different from false [2023-11-06 21:55:52,766 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1460 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1460) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1460 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1460) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-06 21:55:53,038 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1460 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1460) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_1460 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1460) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse3) (bvadd .cse0 (_ bv1 64) .cse3))))))) is different from false [2023-11-06 21:55:53,208 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1458 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1457 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1460 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem151#1.base| v_ArrVal_1458))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem151#1.base| v_ArrVal_1457) .cse1 v_ArrVal_1460) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1458 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1457 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1460 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem151#1.base| v_ArrVal_1457) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem151#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1460) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse4) (bvadd .cse0 (_ bv1 64) .cse4)))))) is different from false [2023-11-06 21:55:55,212 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1458 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1457 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1460 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1457) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1458) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1460) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1458 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1457 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1460 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1458))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1457) .cse4 v_ArrVal_1460) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-06 21:55:55,925 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1458 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1455 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1457 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1456 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1460 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1455))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1456) .cse2 v_ArrVal_1457) (select (select (store .cse3 .cse2 v_ArrVal_1458) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1460))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1458 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1455 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1457 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1456 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1460 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1455))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1458))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1456) .cse5 v_ArrVal_1457) .cse6 v_ArrVal_1460) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-06 21:55:56,129 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:56,130 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 228 treesize of output 216 [2023-11-06 21:55:56,185 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:56,186 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 202 treesize of output 138 [2023-11-06 21:55:56,201 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 771 treesize of output 636 [2023-11-06 21:55:56,215 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 2387 treesize of output 2216 [2023-11-06 21:55:56,231 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 222 treesize of output 194 [2023-11-06 21:55:56,248 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 194 treesize of output 166 [2023-11-06 21:55:56,255 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 166 treesize of output 138 [2023-11-06 21:55:56,310 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 82 treesize of output 68 [2023-11-06 21:55:56,377 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 68 treesize of output 54 [2023-11-06 21:55:56,641 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:56,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2023-11-06 21:55:56,707 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:56,708 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2023-11-06 21:55:56,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:55:56,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 617 treesize of output 392 [2023-11-06 21:55:56,747 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:55:56,748 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:55:56,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 32 treesize of output 14 [2023-11-06 21:55:57,721 INFO L322 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-06 21:55:57,721 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 15 treesize of output 14 [2023-11-06 21:55:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 4 not checked. [2023-11-06 21:55:57,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:55:57,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530028838] [2023-11-06 21:55:57,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530028838] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:55:57,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:55:57,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2023-11-06 21:55:57,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564424859] [2023-11-06 21:55:57,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:55:57,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 21:55:57,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:55:57,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 21:55:57,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=260, Unknown=6, NotChecked=222, Total=552 [2023-11-06 21:55:57,734 INFO L87 Difference]: Start difference. First operand 415 states and 512 transitions. Second operand has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:56:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:26,871 INFO L93 Difference]: Finished difference Result 500 states and 553 transitions. [2023-11-06 21:56:26,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 21:56:26,873 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2023-11-06 21:56:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:26,876 INFO L225 Difference]: With dead ends: 500 [2023-11-06 21:56:26,876 INFO L226 Difference]: Without dead ends: 500 [2023-11-06 21:56:26,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=165, Invalid=609, Unknown=6, NotChecked=342, Total=1122 [2023-11-06 21:56:26,878 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 441 mSDsluCounter, 1898 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 4610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2647 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:26,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 2109 Invalid, 4610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1950 Invalid, 0 Unknown, 2647 Unchecked, 25.5s Time] [2023-11-06 21:56:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2023-11-06 21:56:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 427. [2023-11-06 21:56:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 315 states have (on average 1.6031746031746033) internal successors, (505), 412 states have internal predecessors, (505), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:56:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 525 transitions. [2023-11-06 21:56:26,892 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 525 transitions. Word has length 75 [2023-11-06 21:56:26,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:26,892 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 525 transitions. [2023-11-06 21:56:26,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:56:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 525 transitions. [2023-11-06 21:56:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-06 21:56:26,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:26,894 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 3, 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] [2023-11-06 21:56:26,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:56:27,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:56:27,117 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 114 more)] === [2023-11-06 21:56:27,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1115278439, now seen corresponding path program 2 times [2023-11-06 21:56:27,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:27,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705645105] [2023-11-06 21:56:27,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:56:27,118 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 21:56:27,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:27,119 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:56:27,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2b5679-8867-4762-b07f-b9fd38ce5a6e/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 21:56:28,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:56:28,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:56:28,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-06 21:56:28,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:28,555 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 10 treesize of output 8 [2023-11-06 21:56:28,633 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 21:56:28,664 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:56:28,664 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 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 21:56:28,746 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 16 treesize of output 12 [2023-11-06 21:56:28,789 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 21:56:28,995 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 36 treesize of output 29 [2023-11-06 21:56:29,026 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 16 [2023-11-06 21:56:29,325 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:56:29,325 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 80 treesize of output 75 [2023-11-06 21:56:29,350 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 39 treesize of output 16 [2023-11-06 21:56:29,841 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:56:29,842 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 80 treesize of output 75 [2023-11-06 21:56:29,871 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 39 treesize of output 16 [2023-11-06 21:56:30,540 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:56:30,541 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 80 treesize of output 75 [2023-11-06 21:56:30,556 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 39 treesize of output 16 [2023-11-06 21:56:30,852 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 40 treesize of output 13 [2023-11-06 21:56:30,866 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 12 treesize of output 3 [2023-11-06 21:56:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 21:56:30,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:32,659 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem153#1.base| v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1599 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem153#1.base| v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem153#1.base| v_ArrVal_1599) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-06 21:56:32,888 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1599 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1599) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-06 21:56:33,135 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1599 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1599) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse3) (bvadd .cse0 (_ bv1 64) .cse3))))))) is different from false [2023-11-06 21:56:33,381 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1597 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1599 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1596 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem153#1.base| v_ArrVal_1597))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem153#1.base| v_ArrVal_1596) .cse0 v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_1599) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1597 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1596 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem153#1.base| v_ArrVal_1596) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem153#1.base| v_ArrVal_1597) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv1 64))))))) is different from false [2023-11-06 21:56:33,623 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1597 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1596 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1596) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1597) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1597 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1599 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1596 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1597))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1596) .cse4 v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1599) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-06 21:56:34,020 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (_ bv2 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1597 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1596 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1596) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1597) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1597 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1599 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1596 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1597))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1596) .cse4 v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1599) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-06 21:56:34,237 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv2 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1597 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1594 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1596 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1595 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem151#1.base| v_ArrVal_1595))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem151#1.base| v_ArrVal_1594) .cse2 v_ArrVal_1596) (select (select (store .cse3 .cse2 v_ArrVal_1597) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1598))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1597 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1599 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1594 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1596 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1595 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem151#1.base| v_ArrVal_1595))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1597))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem151#1.base| v_ArrVal_1594) .cse5 v_ArrVal_1596) .cse6 v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1599) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-06 21:56:34,846 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv2 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1597 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1594 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1596 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1595 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1595))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1594) .cse3 v_ArrVal_1596) (select (select (store .cse4 .cse3 v_ArrVal_1597) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1598))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1597 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1599 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1594 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1596 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1595 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1595))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1597))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1594) .cse6 v_ArrVal_1596) .cse7 v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1599) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))))))) is different from false [2023-11-06 21:56:35,410 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (_ bv2 32))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1597 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1599 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1594 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1593 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1596 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1595 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1592 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1593))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_1595))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1597))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1592) .cse0 v_ArrVal_1594) .cse1 v_ArrVal_1596) .cse2 v_ArrVal_1598) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1599) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1598 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1597 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1594 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1593 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1596 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1595 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1592 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1593))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1595))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1592) .cse9 v_ArrVal_1594) .cse10 v_ArrVal_1596) (select (select (store .cse11 .cse10 v_ArrVal_1597) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1598))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse8 .cse4) (bvadd .cse8 (_ bv1 64) .cse4)))))) is different from false [2023-11-06 21:56:35,654 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:35,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 451 treesize of output 452 [2023-11-06 21:56:35,690 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:35,690 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 438 treesize of output 257 [2023-11-06 21:56:35,752 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 1750379 treesize of output 1439906 [2023-11-06 21:56:37,669 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 56249 treesize of output 55511 [2023-11-06 21:56:37,735 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 1214 treesize of output 997 [2023-11-06 21:56:37,745 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 997 treesize of output 920 [2023-11-06 21:56:37,756 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 920 treesize of output 871 [2023-11-06 21:56:37,778 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 871 treesize of output 703 [2023-11-06 21:56:37,798 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 703 treesize of output 612 [2023-11-06 21:56:37,845 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 281 treesize of output 218 [2023-11-06 21:56:37,855 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 549 treesize of output 528 [2023-11-06 21:56:37,901 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 211 treesize of output 204 [2023-11-06 21:56:41,527 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:41,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 452 treesize of output 440 [2023-11-06 21:56:41,645 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:41,645 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 426 treesize of output 258 [2023-11-06 21:56:41,694 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 117135 treesize of output 99540 [2023-11-06 21:56:42,585 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 202479 treesize of output 194838 [2023-11-06 21:56:43,182 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 14754 treesize of output 13634 [2023-11-06 21:56:43,277 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 13634 treesize of output 11975 [2023-11-06 21:56:43,361 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 11975 treesize of output 9735 [2023-11-06 21:56:43,451 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 9735 treesize of output 9063 [2023-11-06 21:56:43,544 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 9063 treesize of output 8615 [2023-11-06 21:56:43,628 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 8615 treesize of output 7719 [2023-11-06 21:56:43,711 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 7719 treesize of output 7271