./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:14:02,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:14:02,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:14:02,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:14:02,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:14:02,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:14:02,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:14:02,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:14:02,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:14:02,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:14:02,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:14:02,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:14:02,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:14:02,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:14:02,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:14:02,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:14:02,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:14:02,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:14:02,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:14:02,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:14:02,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:14:02,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:14:02,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:14:02,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:14:02,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:14:02,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:14:02,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:14:02,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:14:02,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:14:02,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:14:02,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:14:02,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:14:02,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:14:02,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:14:02,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:14:02,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:14:02,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:14:02,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:14:02,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:14:02,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:14:02,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:14:02,841 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 18:14:02,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:14:02,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:14:02,892 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:14:02,893 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:14:02,894 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:14:02,894 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:14:02,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:14:02,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:14:02,896 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:14:02,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:14:02,898 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:14:02,899 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:14:02,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:14:02,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:14:02,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:14:02,900 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:14:02,900 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:14:02,901 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:14:02,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:14:02,901 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:14:02,902 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:14:02,902 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:14:02,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:14:02,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:14:02,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:14:02,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:14:02,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:14:02,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:14:02,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:14:02,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:14:02,906 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:14:02,906 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:14:02,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:14:02,907 INFO L138 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_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2022-11-25 18:14:03,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:14:03,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:14:03,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:14:03,399 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:14:03,400 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:14:03,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-11-25 18:14:06,970 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:14:07,321 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:14:07,322 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-11-25 18:14:07,343 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/data/ae087b592/fd0d2472f8c849579465a7c5936e26b6/FLAG734b6d7bb [2022-11-25 18:14:07,370 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/data/ae087b592/fd0d2472f8c849579465a7c5936e26b6 [2022-11-25 18:14:07,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:14:07,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:14:07,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:14:07,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:14:07,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:14:07,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:14:07" (1/1) ... [2022-11-25 18:14:07,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a31309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:07, skipping insertion in model container [2022-11-25 18:14:07,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:14:07" (1/1) ... [2022-11-25 18:14:07,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:14:07,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:14:07,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:14:07,941 ERROR L326 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) [2022-11-25 18:14:07,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@10b6e567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:07, skipping insertion in model container [2022-11-25 18:14:07,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:14:07,943 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 18:14:07,946 INFO L158 Benchmark]: Toolchain (without parser) took 568.12ms. Allocated memory is still 159.4MB. Free memory was 121.0MB in the beginning and 125.9MB in the end (delta: -4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 18:14:07,947 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:14:07,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.70ms. Allocated memory is still 159.4MB. Free memory was 120.4MB in the beginning and 125.9MB in the end (delta: -5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 18:14:07,949 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.70ms. Allocated memory is still 159.4MB. Free memory was 120.4MB in the beginning and 125.9MB in the end (delta: -5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: 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_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:14:10,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:14:10,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:14:10,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:14:10,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:14:10,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:14:10,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:14:10,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:14:10,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:14:10,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:14:10,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:14:10,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:14:10,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:14:10,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:14:10,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:14:10,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:14:10,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:14:10,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:14:10,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:14:10,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:14:10,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:14:10,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:14:10,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:14:10,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:14:10,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:14:10,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:14:10,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:14:10,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:14:10,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:14:10,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:14:10,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:14:10,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:14:10,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:14:10,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:14:10,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:14:10,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:14:10,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:14:10,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:14:10,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:14:10,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:14:10,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:14:10,805 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 18:14:10,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:14:10,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:14:10,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:14:10,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:14:10,855 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:14:10,855 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:14:10,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:14:10,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:14:10,857 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:14:10,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:14:10,858 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:14:10,858 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:14:10,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:14:10,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:14:10,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:14:10,859 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:14:10,859 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:14:10,860 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:14:10,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:14:10,860 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:14:10,861 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 18:14:10,861 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 18:14:10,861 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:14:10,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:14:10,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:14:10,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:14:10,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:14:10,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:14:10,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:14:10,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:14:10,864 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 18:14:10,864 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 18:14:10,864 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:14:10,865 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:14:10,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:14:10,865 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 18:14:10,866 INFO L138 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_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2022-11-25 18:14:11,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:14:11,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:14:11,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:14:11,339 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:14:11,340 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:14:11,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-11-25 18:14:14,970 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:14:15,256 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:14:15,257 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-11-25 18:14:15,271 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/data/e68e8fad3/3b36d3d39fd14cb88a05f4108c243c7c/FLAG5d6ef545e [2022-11-25 18:14:15,285 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/data/e68e8fad3/3b36d3d39fd14cb88a05f4108c243c7c [2022-11-25 18:14:15,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:14:15,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:14:15,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:14:15,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:14:15,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:14:15,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:14:15" (1/1) ... [2022-11-25 18:14:15,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50cf4149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:15, skipping insertion in model container [2022-11-25 18:14:15,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:14:15" (1/1) ... [2022-11-25 18:14:15,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:14:15,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:14:15,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:14:15,794 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 18:14:15,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:14:15,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:14:15,889 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:14:15,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:14:16,008 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:14:16,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16 WrapperNode [2022-11-25 18:14:16,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:14:16,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:14:16,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:14:16,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:14:16,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16" (1/1) ... [2022-11-25 18:14:16,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16" (1/1) ... [2022-11-25 18:14:16,093 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-11-25 18:14:16,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:14:16,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:14:16,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:14:16,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:14:16,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16" (1/1) ... [2022-11-25 18:14:16,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16" (1/1) ... [2022-11-25 18:14:16,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16" (1/1) ... [2022-11-25 18:14:16,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16" (1/1) ... [2022-11-25 18:14:16,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16" (1/1) ... [2022-11-25 18:14:16,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16" (1/1) ... [2022-11-25 18:14:16,157 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16" (1/1) ... [2022-11-25 18:14:16,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16" (1/1) ... [2022-11-25 18:14:16,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:14:16,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:14:16,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:14:16,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:14:16,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16" (1/1) ... [2022-11-25 18:14:16,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:14:16,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:14:16,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:14:16,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:14:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 18:14:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:14:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2022-11-25 18:14:16,305 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2022-11-25 18:14:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:14:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:14:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:14:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:14:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:14:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 18:14:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:14:16,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 18:14:16,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:14:16,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:14:16,450 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:14:16,452 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:14:17,477 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:14:17,485 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:14:17,485 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 18:14:17,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:14:17 BoogieIcfgContainer [2022-11-25 18:14:17,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:14:17,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:14:17,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:14:17,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:14:17,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:14:15" (1/3) ... [2022-11-25 18:14:17,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4806192f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:14:17, skipping insertion in model container [2022-11-25 18:14:17,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:14:16" (2/3) ... [2022-11-25 18:14:17,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4806192f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:14:17, skipping insertion in model container [2022-11-25 18:14:17,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:14:17" (3/3) ... [2022-11-25 18:14:17,497 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2022-11-25 18:14:17,517 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:14:17,517 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-11-25 18:14:17,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:14:17,573 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;@12323df1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:14:17,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-11-25 18:14:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 18:14:17,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:17,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 18:14:17,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:17,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2022-11-25 18:14:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:17,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200801118] [2022-11-25 18:14:17,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:17,610 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 [2022-11-25 18:14:17,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:17,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:17,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:17,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 18:14:17,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:17,828 INFO L350 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 [2022-11-25 18:14:17,880 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:14:17,881 INFO L350 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 [2022-11-25 18:14:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:17,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:14:17,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:17,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200801118] [2022-11-25 18:14:17,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200801118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:14:17,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:14:17,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:14:17,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64911602] [2022-11-25 18:14:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:14:17,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:14:17,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:17,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:14:17,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:14:17,982 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2022-11-25 18:14:18,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:18,783 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2022-11-25 18:14:18,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:14:18,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2022-11-25 18:14:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:18,795 INFO L225 Difference]: With dead ends: 208 [2022-11-25 18:14:18,796 INFO L226 Difference]: Without dead ends: 206 [2022-11-25 18:14:18,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:14:18,809 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:18,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 288 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:14:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-25 18:14:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2022-11-25 18:14:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2022-11-25 18:14:18,907 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 4 [2022-11-25 18:14:18,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:18,909 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2022-11-25 18:14:18,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2022-11-25 18:14:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2022-11-25 18:14:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 18:14:18,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:18,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 18:14:18,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:19,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:19,123 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:19,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2022-11-25 18:14:19,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:19,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511223590] [2022-11-25 18:14:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:19,126 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 [2022-11-25 18:14:19,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:19,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:19,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:19,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:14:19,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:19,268 INFO L350 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 [2022-11-25 18:14:19,301 INFO L350 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 [2022-11-25 18:14:19,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:19,422 INFO L350 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 12 treesize of output 14 [2022-11-25 18:14:19,437 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:14:19,438 INFO L350 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 [2022-11-25 18:14:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:19,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:14:19,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:19,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511223590] [2022-11-25 18:14:19,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511223590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:14:19,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:14:19,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:14:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558926465] [2022-11-25 18:14:19,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:14:19,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:14:19,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:19,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:14:19,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:14:19,477 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2022-11-25 18:14:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:20,401 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-11-25 18:14:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:14:20,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2022-11-25 18:14:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:20,405 INFO L225 Difference]: With dead ends: 196 [2022-11-25 18:14:20,406 INFO L226 Difference]: Without dead ends: 196 [2022-11-25 18:14:20,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:14:20,407 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:20,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 341 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 18:14:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-25 18:14:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2022-11-25 18:14:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2022-11-25 18:14:20,440 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 4 [2022-11-25 18:14:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:20,441 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2022-11-25 18:14:20,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2022-11-25 18:14:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2022-11-25 18:14:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 18:14:20,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:20,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:14:20,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:20,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:20,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2022-11-25 18:14:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:20,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970754480] [2022-11-25 18:14:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:20,662 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 [2022-11-25 18:14:20,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:20,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:20,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:20,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:14:20,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:20,760 INFO L350 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 [2022-11-25 18:14:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:20,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:14:20,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:20,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970754480] [2022-11-25 18:14:20,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970754480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:14:20,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:14:20,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:14:20,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826356367] [2022-11-25 18:14:20,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:14:20,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:14:20,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:20,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:14:20,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:14:20,780 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:21,171 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-11-25 18:14:21,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:14:21,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 18:14:21,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:21,173 INFO L225 Difference]: With dead ends: 208 [2022-11-25 18:14:21,174 INFO L226 Difference]: Without dead ends: 208 [2022-11-25 18:14:21,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:14:21,175 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:21,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 230 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:14:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-25 18:14:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183. [2022-11-25 18:14:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:21,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-11-25 18:14:21,187 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5 [2022-11-25 18:14:21,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:21,188 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-11-25 18:14:21,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:21,188 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-11-25 18:14:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 18:14:21,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:21,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:14:21,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:21,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:21,405 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:21,406 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2022-11-25 18:14:21,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:21,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962300039] [2022-11-25 18:14:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:21,407 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 [2022-11-25 18:14:21,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:21,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:21,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:21,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 18:14:21,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:21,481 INFO L350 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 [2022-11-25 18:14:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:21,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:14:21,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:21,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962300039] [2022-11-25 18:14:21,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962300039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:14:21,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:14:21,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:14:21,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063105839] [2022-11-25 18:14:21,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:14:21,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:14:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:21,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:14:21,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:14:21,501 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:21,986 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-11-25 18:14:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:14:21,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 18:14:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:21,988 INFO L225 Difference]: With dead ends: 181 [2022-11-25 18:14:21,988 INFO L226 Difference]: Without dead ends: 181 [2022-11-25 18:14:21,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:14:21,990 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:21,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:14:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-25 18:14:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-11-25 18:14:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2022-11-25 18:14:22,006 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 5 [2022-11-25 18:14:22,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:22,006 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2022-11-25 18:14:22,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:22,007 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-11-25 18:14:22,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 18:14:22,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:22,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:14:22,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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)] Ended with exit code 0 [2022-11-25 18:14:22,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:22,214 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:22,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2022-11-25 18:14:22,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:22,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077531995] [2022-11-25 18:14:22,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:22,215 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 [2022-11-25 18:14:22,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:22,217 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:22,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:22,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 18:14:22,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:22,328 INFO L350 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 [2022-11-25 18:14:22,378 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:14:22,379 INFO L350 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 [2022-11-25 18:14:22,454 INFO L350 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 14 treesize of output 16 [2022-11-25 18:14:22,465 INFO L350 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 14 treesize of output 16 [2022-11-25 18:14:22,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:14:22,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:14:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:22,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:14:22,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:22,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077531995] [2022-11-25 18:14:22,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077531995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:14:22,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:14:22,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:14:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457859495] [2022-11-25 18:14:22,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:14:22,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:14:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:14:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:14:22,544 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:23,226 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-11-25 18:14:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:14:23,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 18:14:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:23,228 INFO L225 Difference]: With dead ends: 183 [2022-11-25 18:14:23,228 INFO L226 Difference]: Without dead ends: 183 [2022-11-25 18:14:23,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:14:23,229 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 6 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:23,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 602 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:14:23,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-25 18:14:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2022-11-25 18:14:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2022-11-25 18:14:23,238 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2022-11-25 18:14:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:23,238 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2022-11-25 18:14:23,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-11-25 18:14:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 18:14:23,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:23,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:14:23,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:23,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:23,440 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2022-11-25 18:14:23,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:23,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671166006] [2022-11-25 18:14:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:23,441 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 [2022-11-25 18:14:23,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:23,442 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:23,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:23,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:14:23,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:23,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:14:23,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:23,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671166006] [2022-11-25 18:14:23,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671166006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:14:23,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:14:23,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:14:23,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686302938] [2022-11-25 18:14:23,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:14:23,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:14:23,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:23,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:14:23,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:14:23,556 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:23,597 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-11-25 18:14:23,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:14:23,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 18:14:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:23,599 INFO L225 Difference]: With dead ends: 258 [2022-11-25 18:14:23,600 INFO L226 Difference]: Without dead ends: 258 [2022-11-25 18:14:23,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:14:23,601 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 80 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:23,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 545 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:14:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-25 18:14:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2022-11-25 18:14:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2022-11-25 18:14:23,610 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2022-11-25 18:14:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:23,611 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2022-11-25 18:14:23,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2022-11-25 18:14:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:14:23,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:23,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:14:23,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:23,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:23,824 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2022-11-25 18:14:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:23,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374884451] [2022-11-25 18:14:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:23,825 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 [2022-11-25 18:14:23,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:23,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:23,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:23,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:14:23,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:23,960 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:14:23,961 INFO L350 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 [2022-11-25 18:14:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:23,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:14:23,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:23,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374884451] [2022-11-25 18:14:23,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374884451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:14:23,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:14:23,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:14:23,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709002836] [2022-11-25 18:14:23,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:14:23,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:14:23,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:23,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:14:23,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:14:23,983 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:24,365 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2022-11-25 18:14:24,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:14:24,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 18:14:24,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:24,366 INFO L225 Difference]: With dead ends: 209 [2022-11-25 18:14:24,367 INFO L226 Difference]: Without dead ends: 209 [2022-11-25 18:14:24,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:14:24,368 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 60 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:24,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 196 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:14:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-25 18:14:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-11-25 18:14:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 136 states have (on average 1.7573529411764706) internal successors, (239), 202 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 243 transitions. [2022-11-25 18:14:24,375 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 243 transitions. Word has length 13 [2022-11-25 18:14:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:24,375 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 243 transitions. [2022-11-25 18:14:24,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 243 transitions. [2022-11-25 18:14:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:14:24,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:24,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:14:24,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:24,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:24,588 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:24,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:24,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2022-11-25 18:14:24,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:24,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202375291] [2022-11-25 18:14:24,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:24,590 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 [2022-11-25 18:14:24,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:24,591 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:24,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:24,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:14:24,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:24,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,712 INFO L350 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 9 treesize of output 11 [2022-11-25 18:14:24,722 INFO L350 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 [2022-11-25 18:14:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:24,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:14:24,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:24,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202375291] [2022-11-25 18:14:24,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202375291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:14:24,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:14:24,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:14:24,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511175869] [2022-11-25 18:14:24,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:14:24,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:14:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:24,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:14:24,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:14:24,736 INFO L87 Difference]: Start difference. First operand 207 states and 243 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:25,161 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2022-11-25 18:14:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:14:25,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 18:14:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:25,163 INFO L225 Difference]: With dead ends: 194 [2022-11-25 18:14:25,163 INFO L226 Difference]: Without dead ends: 194 [2022-11-25 18:14:25,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:14:25,164 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:25,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 198 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:14:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-25 18:14:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-11-25 18:14:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 136 states have (on average 1.536764705882353) internal successors, (209), 187 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2022-11-25 18:14:25,170 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 13 [2022-11-25 18:14:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:25,171 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2022-11-25 18:14:25,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:25,171 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2022-11-25 18:14:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:14:25,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:25,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:14:25,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:25,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:25,384 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:25,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:25,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2022-11-25 18:14:25,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:25,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246496097] [2022-11-25 18:14:25,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:25,385 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 [2022-11-25 18:14:25,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:25,386 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:25,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:25,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 18:14:25,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:25,510 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 18:14:25,510 INFO L350 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 19 [2022-11-25 18:14:25,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:14:25,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 18:14:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:25,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:14:25,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:25,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246496097] [2022-11-25 18:14:25,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246496097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:14:25,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:14:25,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:14:25,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249729143] [2022-11-25 18:14:25,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:14:25,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:14:25,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:25,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:14:25,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:14:25,565 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:26,318 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2022-11-25 18:14:26,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:14:26,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 18:14:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:26,321 INFO L225 Difference]: With dead ends: 243 [2022-11-25 18:14:26,321 INFO L226 Difference]: Without dead ends: 243 [2022-11-25 18:14:26,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:14:26,322 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 26 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:26,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 387 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:14:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-25 18:14:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 198. [2022-11-25 18:14:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 193 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2022-11-25 18:14:26,329 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 17 [2022-11-25 18:14:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:26,329 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2022-11-25 18:14:26,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2022-11-25 18:14:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:14:26,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:26,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:14:26,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:26,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:26,542 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:26,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2022-11-25 18:14:26,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:26,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515521114] [2022-11-25 18:14:26,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:26,543 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 [2022-11-25 18:14:26,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:26,544 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:26,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:26,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 18:14:26,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:26,685 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:14:26,685 INFO L350 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 [2022-11-25 18:14:26,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:14:26,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:14:26,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-25 18:14:26,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 18:14:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:26,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:14:26,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:26,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515521114] [2022-11-25 18:14:26,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515521114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:14:26,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:14:26,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:14:26,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441951686] [2022-11-25 18:14:26,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:14:26,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:14:26,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:26,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:14:26,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:14:26,826 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:27,885 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-11-25 18:14:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:14:27,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 18:14:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:27,887 INFO L225 Difference]: With dead ends: 200 [2022-11-25 18:14:27,887 INFO L226 Difference]: Without dead ends: 200 [2022-11-25 18:14:27,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:14:27,888 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 3 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:27,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 486 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 18:14:27,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-25 18:14:27,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2022-11-25 18:14:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 193 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2022-11-25 18:14:27,894 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 17 [2022-11-25 18:14:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:27,894 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2022-11-25 18:14:27,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2022-11-25 18:14:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 18:14:27,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:27,895 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:14:27,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:28,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:28,107 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2022-11-25 18:14:28,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:28,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990926246] [2022-11-25 18:14:28,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:28,108 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 [2022-11-25 18:14:28,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:28,109 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:28,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:28,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 18:14:28,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:28,304 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:14:28,305 INFO L350 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 19 treesize of output 22 [2022-11-25 18:14:28,337 INFO L350 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 13 treesize of output 9 [2022-11-25 18:14:28,456 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:14:28,456 INFO L350 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 36 treesize of output 37 [2022-11-25 18:14:28,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 18:14:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 18:14:28,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:14:28,632 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_176) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1)))) is different from false [2022-11-25 18:14:28,662 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_176) c_create_data_~data~0.base) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 18:14:28,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:14:28,687 INFO L350 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 26 treesize of output 27 [2022-11-25 18:14:28,691 INFO L350 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 44 treesize of output 32 [2022-11-25 18:14:28,711 INFO L350 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 11 treesize of output 7 [2022-11-25 18:14:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 18:14:28,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:28,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990926246] [2022-11-25 18:14:28,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990926246] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:14:28,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:14:28,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-11-25 18:14:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866743439] [2022-11-25 18:14:28,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:14:28,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:14:28,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:28,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:14:28,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-11-25 18:14:28,792 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:30,411 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2022-11-25 18:14:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:14:30,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 18:14:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:30,413 INFO L225 Difference]: With dead ends: 203 [2022-11-25 18:14:30,413 INFO L226 Difference]: Without dead ends: 203 [2022-11-25 18:14:30,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=64, Unknown=2, NotChecked=34, Total=132 [2022-11-25 18:14:30,414 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 23 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:30,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 797 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 506 Invalid, 0 Unknown, 186 Unchecked, 1.5s Time] [2022-11-25 18:14:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-25 18:14:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 197. [2022-11-25 18:14:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 142 states have (on average 1.5) internal successors, (213), 192 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2022-11-25 18:14:30,420 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 22 [2022-11-25 18:14:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:30,420 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2022-11-25 18:14:30,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2022-11-25 18:14:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 18:14:30,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:30,421 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:14:30,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:14:30,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:30,622 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:30,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:30,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2022-11-25 18:14:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:30,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056025505] [2022-11-25 18:14:30,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:30,623 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 [2022-11-25 18:14:30,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:30,624 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:30,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:30,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 18:14:30,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:30,837 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:14:30,838 INFO L350 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 [2022-11-25 18:14:30,846 INFO L350 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 [2022-11-25 18:14:30,874 INFO L350 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 13 treesize of output 9 [2022-11-25 18:14:30,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:14:31,054 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:14:31,054 INFO L350 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 46 treesize of output 45 [2022-11-25 18:14:31,063 INFO L350 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 22 treesize of output 24 [2022-11-25 18:14:31,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 18:14:31,202 INFO L350 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 19 treesize of output 7 [2022-11-25 18:14:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:31,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:14:31,659 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_220) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-11-25 18:14:31,723 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_221) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_221) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_220) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-25 18:14:31,803 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_220) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-25 18:14:31,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:14:31,829 INFO L350 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 45 treesize of output 46 [2022-11-25 18:14:31,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:14:31,845 INFO L350 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 35 treesize of output 36 [2022-11-25 18:14:31,855 INFO L350 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 62 treesize of output 50 [2022-11-25 18:14:31,861 INFO L350 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 96 treesize of output 78 [2022-11-25 18:14:31,872 INFO L350 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 40 treesize of output 32 [2022-11-25 18:14:31,876 INFO L350 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 66 treesize of output 58 [2022-11-25 18:14:32,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:14:32,058 INFO L350 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 45 treesize of output 36 [2022-11-25 18:14:32,069 INFO L350 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 54 treesize of output 36 [2022-11-25 18:14:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 18:14:32,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:32,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056025505] [2022-11-25 18:14:32,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056025505] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:14:32,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:14:32,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-25 18:14:32,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531058927] [2022-11-25 18:14:32,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:14:32,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 18:14:32,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:32,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 18:14:32,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2022-11-25 18:14:32,202 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:35,038 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2022-11-25 18:14:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:14:35,040 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 18:14:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:35,041 INFO L225 Difference]: With dead ends: 209 [2022-11-25 18:14:35,041 INFO L226 Difference]: Without dead ends: 209 [2022-11-25 18:14:35,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2022-11-25 18:14:35,043 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 7 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:35,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 889 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 464 Invalid, 0 Unknown, 242 Unchecked, 2.5s Time] [2022-11-25 18:14:35,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-25 18:14:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-11-25 18:14:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 202 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:14:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 227 transitions. [2022-11-25 18:14:35,050 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 227 transitions. Word has length 22 [2022-11-25 18:14:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:35,050 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 227 transitions. [2022-11-25 18:14:35,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 227 transitions. [2022-11-25 18:14:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:14:35,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:35,052 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:14:35,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:35,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:35,260 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:14:35,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2022-11-25 18:14:35,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:35,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221584059] [2022-11-25 18:14:35,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:14:35,261 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 [2022-11-25 18:14:35,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:35,262 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:14:35,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:14:35,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:14:35,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:14:35,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 18:14:35,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:35,568 INFO L350 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 [2022-11-25 18:14:35,577 INFO L350 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 9 treesize of output 11 [2022-11-25 18:14:35,605 INFO L350 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 13 treesize of output 9 [2022-11-25 18:14:35,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:14:35,791 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:14:35,791 INFO L350 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 46 treesize of output 45 [2022-11-25 18:14:35,803 INFO L350 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 22 treesize of output 24 [2022-11-25 18:14:36,007 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:14:36,007 INFO L350 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 46 treesize of output 45 [2022-11-25 18:14:36,018 INFO L350 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 22 treesize of output 24 [2022-11-25 18:14:36,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 18:14:36,148 INFO L350 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 19 treesize of output 7 [2022-11-25 18:14:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:36,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:14:36,591 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) c_create_data_~data~0.base) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-11-25 18:14:36,640 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_282) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_282) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-25 18:14:36,721 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse3 .cse2) (bvadd .cse3 .cse2 (_ bv12 32)))))))) is different from false [2022-11-25 18:14:38,294 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_280))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_281) .cse1 v_ArrVal_282) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_281) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_280) c_create_data_~data~0.base) .cse2) v_ArrVal_282) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2022-11-25 18:14:38,379 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_281) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_280) c_create_data_~data~0.base) .cse2) v_ArrVal_282) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_280))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_281) .cse3 v_ArrVal_282) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_283) c_create_data_~data~0.base) .cse2))))))))) is different from false [2022-11-25 18:14:38,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:14:38,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-11-25 18:14:38,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:14:38,434 INFO L350 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 69 treesize of output 60 [2022-11-25 18:14:38,443 INFO L350 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 102 treesize of output 84 [2022-11-25 18:14:38,457 INFO L350 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 174 treesize of output 144 [2022-11-25 18:14:38,478 INFO L350 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 102 treesize of output 86 [2022-11-25 18:14:38,485 INFO L350 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 124 treesize of output 100 [2022-11-25 18:14:38,513 INFO L350 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 70 treesize of output 62 [2022-11-25 18:14:38,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:14:38,586 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-11-25 18:14:38,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:14:38,610 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-11-25 18:14:38,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:14:38,623 INFO L350 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 92 treesize of output 56 [2022-11-25 18:14:38,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:14:38,637 INFO L350 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 50 treesize of output 32 [2022-11-25 18:14:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-25 18:14:38,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:38,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221584059] [2022-11-25 18:14:38,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221584059] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:14:38,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:14:38,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2022-11-25 18:14:38,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597426549] [2022-11-25 18:14:38,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:14:38,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 18:14:38,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:38,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 18:14:38,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=162, Unknown=10, NotChecked=150, Total=380 [2022-11-25 18:14:38,807 INFO L87 Difference]: Start difference. First operand 207 states and 227 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:44,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:14:46,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:14:48,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:14:49,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:14:51,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:14:53,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:14:53,157 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse4 (bvadd (_ bv8 32) .cse3 .cse2)) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (= (select |c_#length| |c_create_data_#t~mem9.base|) (_ bv80 32)) (= |c_create_data_#t~mem9.offset| (_ bv0 32)) (= c_create_data_~counter~0 (_ bv2 32)) (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1)))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) .cse4) (bvule .cse4 (select |c_#length| .cse0)) (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse5 .cse2) (bvadd .cse5 .cse2 (_ bv12 32))))))))) is different from false [2022-11-25 18:14:53,195 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse4 (bvadd (_ bv8 32) .cse3 .cse2)) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1)))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) .cse4) (bvule .cse4 (select |c_#length| .cse0)) (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse5 .cse2) (bvadd .cse5 .cse2 (_ bv12 32))))))))) is different from false [2022-11-25 18:14:53,234 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| c_create_data_~data~0.base) .cse3)) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3)) (.cse4 (bvadd (_ bv4 32) .cse5 .cse1))) (and (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_282) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_282) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3)))) (bvule .cse4 (select |c_#length| .cse2)) (bvule (bvadd .cse5 .cse1) .cse4))))) is different from false [2022-11-25 18:15:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:01,990 INFO L93 Difference]: Finished difference Result 277 states and 309 transitions. [2022-11-25 18:15:01,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:15:01,993 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 18:15:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:01,994 INFO L225 Difference]: With dead ends: 277 [2022-11-25 18:15:01,994 INFO L226 Difference]: Without dead ends: 277 [2022-11-25 18:15:01,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=116, Invalid=354, Unknown=24, NotChecked=376, Total=870 [2022-11-25 18:15:01,995 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 29 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 11 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 570 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:01,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1319 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 741 Invalid, 8 Unknown, 570 Unchecked, 19.0s Time] [2022-11-25 18:15:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-25 18:15:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 237. [2022-11-25 18:15:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 182 states have (on average 1.4120879120879122) internal successors, (257), 232 states have internal predecessors, (257), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:15:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 261 transitions. [2022-11-25 18:15:02,006 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 261 transitions. Word has length 27 [2022-11-25 18:15:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:02,006 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 261 transitions. [2022-11-25 18:15:02,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 261 transitions. [2022-11-25 18:15:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 18:15:02,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:02,014 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:02,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:15:02,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:15:02,227 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:15:02,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 543118897, now seen corresponding path program 1 times [2022-11-25 18:15:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:15:02,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386601229] [2022-11-25 18:15:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:02,228 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 [2022-11-25 18:15:02,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:15:02,229 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:15:02,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:15:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:02,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:15:02,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:15:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:02,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:15:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:02,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:15:02,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386601229] [2022-11-25 18:15:02,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386601229] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:15:02,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:15:02,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-25 18:15:02,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418540203] [2022-11-25 18:15:02,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:15:02,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:15:02,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:15:02,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:15:02,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:15:02,817 INFO L87 Difference]: Start difference. First operand 237 states and 261 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:03,418 INFO L93 Difference]: Finished difference Result 265 states and 287 transitions. [2022-11-25 18:15:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:15:03,419 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-25 18:15:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:03,420 INFO L225 Difference]: With dead ends: 265 [2022-11-25 18:15:03,421 INFO L226 Difference]: Without dead ends: 265 [2022-11-25 18:15:03,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:15:03,422 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 26 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:03,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1076 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:15:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-25 18:15:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2022-11-25 18:15:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 208 states have (on average 1.3605769230769231) internal successors, (283), 258 states have internal predecessors, (283), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:15:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 287 transitions. [2022-11-25 18:15:03,430 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 287 transitions. Word has length 39 [2022-11-25 18:15:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:03,430 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 287 transitions. [2022-11-25 18:15:03,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 287 transitions. [2022-11-25 18:15:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 18:15:03,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:03,432 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:03,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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)] Ended with exit code 0 [2022-11-25 18:15:03,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:15:03,646 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-25 18:15:03,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:03,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1380990834, now seen corresponding path program 3 times [2022-11-25 18:15:03,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:15:03,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130154600] [2022-11-25 18:15:03,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:15:03,648 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 [2022-11-25 18:15:03,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:15:03,650 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 18:15:03,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_698c2266-2a72-49af-b559-a342fd9e1b10/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 18:15:04,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 18:15:04,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:15:04,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 18:15:04,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:15:04,856 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:15:04,856 INFO L350 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 [2022-11-25 18:15:04,869 INFO L350 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 [2022-11-25 18:15:04,913 INFO L350 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 13 treesize of output 9 [2022-11-25 18:15:04,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:15:05,226 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:15:05,226 INFO L350 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 46 treesize of output 45 [2022-11-25 18:15:05,236 INFO L350 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 22 treesize of output 24 [2022-11-25 18:15:05,564 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:15:05,564 INFO L350 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 46 treesize of output 45 [2022-11-25 18:15:05,588 INFO L350 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 22 treesize of output 24 [2022-11-25 18:15:05,900 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:15:05,901 INFO L350 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 46 treesize of output 45 [2022-11-25 18:15:05,924 INFO L350 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 22 treesize of output 24 [2022-11-25 18:15:06,291 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:15:06,291 INFO L350 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 46 treesize of output 45 [2022-11-25 18:15:06,313 INFO L350 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 22 treesize of output 24 [2022-11-25 18:15:06,674 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:15:06,675 INFO L350 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 46 treesize of output 45 [2022-11-25 18:15:06,693 INFO L350 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 22 treesize of output 24 [2022-11-25 18:15:06,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 18:15:06,928 INFO L350 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 19 treesize of output 7 [2022-11-25 18:15:07,024 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:07,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:15:07,628 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_480) c_create_data_~data~0.base) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_479) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_480) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-11-25 18:15:07,688 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_480) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_480) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_479) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-25 18:15:07,778 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_480) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_480) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_479) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-25 18:15:08,176 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_477) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_478) c_create_data_~data~0.base) .cse2) v_ArrVal_480) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_478))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_477) .cse3 v_ArrVal_480) c_create_data_~data~0.base) .cse2) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_479) c_create_data_~data~0.base) .cse2)))))))) is different from false [2022-11-25 18:15:08,468 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_478))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_477) .cse1 v_ArrVal_480) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_479) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_477) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_478) c_create_data_~data~0.base) .cse2) v_ArrVal_480) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2022-11-25 18:15:08,588 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_477) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_478) c_create_data_~data~0.base) .cse3) v_ArrVal_480) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_478))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_477) .cse4 v_ArrVal_480) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_479) c_create_data_~data~0.base) .cse3))))))))) is different from false [2022-11-25 18:15:10,750 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_475))) (let ((.cse0 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_478))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_476) .cse0 v_ArrVal_477) .cse1 v_ArrVal_480) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_479) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_475))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_476) .cse7 v_ArrVal_477) (select (select (store .cse8 .cse7 v_ArrVal_478) c_create_data_~data~0.base) .cse2) v_ArrVal_480))) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse6 .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse3)))))) is different from false [2022-11-25 18:15:12,917 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_475))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_476) .cse3 v_ArrVal_477) (select (select (store .cse4 .cse3 v_ArrVal_478) c_create_data_~data~0.base) .cse5) v_ArrVal_480))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_475))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_478))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_476) .cse6 v_ArrVal_477) .cse7 v_ArrVal_480) c_create_data_~data~0.base) .cse5) .cse1) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_479) c_create_data_~data~0.base) .cse5))))))))))) is different from false [2022-11-25 18:15:13,114 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_475))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_478))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_476) .cse1 v_ArrVal_477) .cse2 v_ArrVal_480) c_create_data_~data~0.base) .cse3) (_ bv20 32) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_479) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_475))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_476) .cse8 v_ArrVal_477) (select (select (store .cse9 .cse8 v_ArrVal_478) c_create_data_~data~0.base) .cse3) v_ArrVal_480))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) .cse7 .cse4) (bvadd .cse7 (_ bv20 32) .cse4))))))) is different from false [2022-11-25 18:15:15,830 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_474))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_475))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_473) .cse2 v_ArrVal_476) .cse3 v_ArrVal_477) (select (select (store .cse4 .cse3 v_ArrVal_478) c_create_data_~data~0.base) .cse5) v_ArrVal_480))))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_474))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_475))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_478))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_473) .cse7 v_ArrVal_476) .cse8 v_ArrVal_477) .cse9 v_ArrVal_480) c_create_data_~data~0.base) .cse5) (_ bv20 32) .cse1) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_479) c_create_data_~data~0.base) .cse5)))))))))))) is different from false [2022-11-25 18:15:18,434 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_474))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_475))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_473) .cse3 v_ArrVal_476) .cse4 v_ArrVal_477) (select (select (store .cse5 .cse4 v_ArrVal_478) c_create_data_~data~0.base) .cse6) v_ArrVal_480))))) c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_474))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_475))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_478))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_473) .cse8 v_ArrVal_476) .cse9 v_ArrVal_477) .cse10 v_ArrVal_480) c_create_data_~data~0.base) .cse6) (_ bv20 32) .cse1) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_479) c_create_data_~data~0.base) .cse6))))))))))))) is different from false [2022-11-25 18:15:36,637 WARN L233 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:15:39,397 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_472))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_474))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_475))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_471) .cse2 v_ArrVal_473) .cse3 v_ArrVal_476) .cse4 v_ArrVal_477) (select (select (store .cse5 .cse4 v_ArrVal_478) c_create_data_~data~0.base) .cse6) v_ArrVal_480))))))) c_create_data_~data~0.base) .cse6))) (bvule (bvadd .cse0 (_ bv20 32) .cse1) (bvadd .cse0 .cse1 (_ bv24 32))))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_472))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse6))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_474))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse6))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_475))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse6))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_478))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_471) .cse9 v_ArrVal_473) .cse10 v_ArrVal_476) .cse11 v_ArrVal_477) .cse12 v_ArrVal_480) c_create_data_~data~0.base) .cse6) .cse1 (_ bv24 32)) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_479) c_create_data_~data~0.base) .cse6)))))))))))))) is different from false [2022-11-25 18:15:42,092 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (and (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_472))) (let ((.cse3 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_474))) (let ((.cse4 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_475))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse7))) (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_471) .cse3 v_ArrVal_473) .cse4 v_ArrVal_476) .cse5 v_ArrVal_477) (select (select (store .cse6 .cse5 v_ArrVal_478) c_create_data_~data~0.base) .cse7) v_ArrVal_480))))))) c_create_data_~data~0.base) .cse7))) (bvule (bvadd .cse0 (_ bv20 32) .cse1) (bvadd .cse0 .cse1 (_ bv24 32))))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_472))) (let ((.cse10 (select (select .cse17 c_create_data_~data~0.base) .cse7))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_474))) (let ((.cse11 (select (select .cse16 c_create_data_~data~0.base) .cse7))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_475))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse7))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_478))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse7))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_471) .cse10 v_ArrVal_473) .cse11 v_ArrVal_476) .cse12 v_ArrVal_477) .cse13 v_ArrVal_480) c_create_data_~data~0.base) .cse7) .cse1 (_ bv24 32)) (select |c_#length| (select (select (store .cse14 .cse13 v_ArrVal_479) c_create_data_~data~0.base) .cse7))))))))))))))) is different from false [2022-11-25 18:15:44,818 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_472))) (let ((.cse1 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_474))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_475))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_478))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_471) .cse1 v_ArrVal_473) .cse2 v_ArrVal_476) .cse3 v_ArrVal_477) .cse4 v_ArrVal_480) c_create_data_~data~0.base) .cse5) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_479) c_create_data_~data~0.base) .cse5)))))))))))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_472))) (let ((.cse11 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_474))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_475))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_471) .cse11 v_ArrVal_473) .cse12 v_ArrVal_476) .cse13 v_ArrVal_477) (select (select (store .cse14 .cse13 v_ArrVal_478) c_create_data_~data~0.base) .cse5) v_ArrVal_480))))))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd .cse10 (_ bv20 32)) (bvadd .cse10 (_ bv24 32)))))))) is different from false [2022-11-25 18:15:44,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:15:44,975 INFO L350 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 705 treesize of output 696 [2022-11-25 18:15:45,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:15:45,059 INFO L350 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 685 treesize of output 396 [2022-11-25 18:15:45,147 INFO L350 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 2063208 treesize of output 1765842 [2022-11-25 18:16:42,879 WARN L233 SmtUtils]: Spent 57.73s on a formula simplification. DAG size of input: 1445 DAG size of output: 1445 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:17:09,480 WARN L233 SmtUtils]: Spent 26.59s on a formula simplification. DAG size of input: 1436 DAG size of output: 1434 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:17:12,216 INFO L350 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 191978904 treesize of output 189256722 [2022-11-25 18:24:53,175 WARN L233 SmtUtils]: Spent 7.68m on a formula simplification that was a NOOP. DAG size: 9247 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)